Please use this identifier to cite or link to this item: http://dspace.uniten.edu.my/jspui/handle/123456789/7190
DC FieldValueLanguage
dc.contributor.authorSadon, S.Kh.-
dc.contributor.authorRadzi, N.A.M.-
dc.contributor.authorDin, N.M.-
dc.contributor.authorMustafa, I.S.-
dc.contributor.authorAl-Mansoori, M.H.-
dc.contributor.authorYaacob, M.-
dc.date.accessioned2018-01-11T09:11:08Z-
dc.date.available2018-01-11T09:11:08Z-
dc.date.issued2009-
dc.identifier.urihttp://dspace.uniten.edu.my/jspui/handle/123456789/7190-
dc.description.abstractPassive Optical Networks (PONs) are thought to be the next step in the development of Access Networks and providing broadband access in the "last mile" area. Ethernet PON (EPON) gains the most attention from the researchers as it offers highly flexible and cost effective solution. In this paper we propose two high level scheduler algorithms inside the Optical Line Terminal (OLT) and Optical Network Units (ONU). In the proposed Dynamic Bandwidth Allocation (DBA) algorithm, the OLT allocates the bandwidth to the ONUs in proportion to the weight associated with the excess bandwidth available, while the ONU preferentially allocates its bandwidth to queues with a strict or non strict priority order. The algorithms provide dynamic bandwidth allocation and separate the burden of queue management fairly between the customer and the network. This led to less complicated and more intelligent equipment has been used on the customer's premises. We show the results of simulations to validate the effectiveness of algorithms presented and to provide quality of service (QoS) for triple play real time services in Ethernet passive optical networks (EPONs). © 2009 IEEE.-
dc.titleEnhanced hierarchical dynamic bandwidth allocation algorithm with excess bandwidth and SLA techniques for upstream ethernet PON-
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.