Please use this identifier to cite or link to this item: http://dspace.uniten.edu.my/jspui/handle/123456789/7139
DC FieldValueLanguage
dc.contributor.authorRadzi, N.A.M.
dc.contributor.authorDin, N.M.
dc.contributor.authorAl-Mansoori, M.H.
dc.contributor.authorSadon, S.K.
dc.contributor.authorMajid, M.S.A.
dc.date.accessioned2018-01-11T09:10:49Z-
dc.date.available2018-01-11T09:10:49Z-
dc.date.issued2014
dc.identifier.urihttp://dspace.uniten.edu.my/jspui/handle/123456789/7139-
dc.description.abstractEthernet Passive Optical Network (EPON) has emerged as a promising technology since it offers high bandwidth at a distance that can go up to 20 km. In the upstream EPON transmission, a dynamic bandwidth allocation (DBA) algorithm is needed to avoid collisions and to efficiently allocate the bandwidth. This paper proposes an algorithm called as a Universal DBA (UDBA) algorithm that can support the priority universally in the entire EPON system. A peripheral interface controller (PIC)-based EPON testbed is used to test the algorithm within the mulipoint control protocol environment. For the performance study, we have compared the results achieved using UDBA in terms of delay, throughput, and fairness with two other DBA algorithms. UDBA shows improvements in terms of expedited forwarding, assured forwarding and best effort delay as much as 43.9, 42.6, 20 % over User-oriented Hierarchical Bandwidth Scheduling with Single Cycle (UHSA-S) and 37.5, 20.2, 25.3 % over Modified Smallest Available Report First (MSARF), respectively. Throughput is improved as high as 17.9 % over UHSA-S and 12.8 % over MSARF. In addition, the fairness index of UDBA is higher up to 14 % as compared to UHSA-S and 2.7 % as compared to MSARF. © 2013 Springer Science+Business Media New York.
dc.titleA study of quality of service in the universal DBA algorithm using a PIC-based EPON testbed
item.grantfulltextnone-
item.fulltextNo Fulltext-
Appears in Collections:COGS Scholarly Publication
Show simple item record

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.