Open AccessBurst‐by‐burst dynamic bandwidth allocation for XG‐PONs
Author(s) -
Gravalos Ilias,
Yiannopoulos Kostas,
Papadimitriou Georgios,
Varvarigos Emmanuel A.
Publication year - 2016
Publication title -
iet networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.466
H-Index - 21
eISSN - 2047-4962
pISSN - 2047-4954
DOI - 10.1049/iet-net.2015.0070
Subject(s) - dynamic bandwidth allocation , pons , computer science , bandwidth (computing) , bandwidth allocation , computer network , neuroscience , biology
The authors propose and evaluate the performance of a dynamic bandwidth allocation algorithm, namely burst‐by‐bUrst dynamic bandwidth allocation (BUDA), which enables the fair and efficient utilisation of the available upstream resources in 10‐Gigabit‐capable passive optical networks (XG‐PONs). The proposed algorithm emulates a bit‐by‐bit burst multiplexing process based on the fair queuing scheduling principle to fairly allocate the available upstream bandwidth among several end‐users with varying traffic demands. The fair queuing approach is well‐suited to the strictly synchronous communication model of XG‐PONs, where fixed duration downstream and upstream frames are utilised to delineate transmissions, and the authors demonstrate via simulations that BUDA achieves low and bounded latency, as well as resource allocation fairness over a set of different traffic loads. Furthermore, BUDA is compared with well‐known bandwidth allocation algorithms and a significant latency and fairness benefit is demonstrated.