Burst‐by‐burst dynamic bandwidth allocation for XG‐PONs. Issue 3 (1st May 2016)

• Record Type: Journal Article
• Authors: Gravalos, Ilias; Yiannopoulos, Kostas; Papadimitriou, Georgios; Varvarigos, Emmanuel A.
• Is Part Of: IET networks. Volume 5:Issue 3(2016)
• Page Start: 47
• Page End: 55
• Publication Date: 2016-05-01
• Subjects: passive optical networks -- bandwidth allocation -- resource allocation -- telecommunication scheduling -- queueing theory; burst‐by‐burst dynamic bandwidth allocation -- BUDA -- available upstream resources -- XG‐passive optical networks -- XG‐PON -- bit‐by‐bit burst multiplexing process -- fair queuing scheduling principle -- end‐users -- traffic demands -- synchronous communication model -- fixed duration downstream -- upstream frames -- resource allocation fairness; Computer network architectures -- Periodicals; Computer network protocols -- Periodicals; Information networks -- Periodicals; Telecommunication systems -- Periodicals; 004.605
• DOI: 10.1049/iet-net.2015.0070
• Languages: English
• ISSNs: 2047-4954

Abstract

Abstract : 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.