Burst-by-burst dynamic bandwidth allocation for XG-PONs

Burst-by-burst dynamic bandwidth allocation for XG-PONs

For access to this article, please select a purchase option:

Buy article PDF
(plus tax if applicable)
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
IET Networks — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

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.

Related content

This is a required field
Please enter a valid email address