By Topic

Interleaved polling versus multi-thread polling for bandwidth allocation in long-reach PONs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Helmy, A. ; Electr. Eng. Dept., King Saud Univ. (KSU), Riyadh, Saudi Arabia ; Fathallah, H. ; Mouftah, H.

Long-reach passive optical networks (LR-PONs) suffer from extremely long propagation delays that degrade the performance of centralized algorithms proposed for upstream bandwidth allocation in traditional PONs. This is because these algorithms are based on bandwidth negotiation messages frequently exchanged between the optical line terminal in the central office and optical network units near the users, which become seriously delayed when the network is extended causing the performance to degrade. In this paper, we review and analyze two centralized dynamic bandwidth allocation algorithms, online interleaved polling and offline multi-thread polling that was recently proposed in the literature for LR-PONs. We investigate and compare their performances together in detail, by studying and observing their elemental delays. Unexpectedly, simulation results show that, although multi-thread polling succeeds in decreasing reporting and queueing delays, interleaved polling keeps a lower grant delay and therefore has better overall delay performance. The latter also achieves better throughput compared to multi-thread polling.

Published in:

Optical Communications and Networking, IEEE/OSA Journal of  (Volume:4 ,  Issue: 3 )