By Topic

Double-Phase Polling Algorithm Based on Partitioned ONU Subgroups for High Utilization in EPONs

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

5 Author(s)
Sam Yeoul Choi ; Dept. of Mobile Syst. Eng., Sungkyunkwan Univ., Suwon, South Korea ; Sangho Lee ; Tae-Jin Lee ; Min Young Chung
more authors

The Ethernet passive optical network (EPON) is an emerging technology for the next-generation broadband access networks and is considered an up-to-date candidate network for future fiber to the home. A crucial issue in EPONs is the sharing of uplink bandwidth among optical network units (ONUs). To manage resources efficiently, research on polling schemes based on multipoint control protocol has been conducted. We propose a novel polling algorithm to increase resource utilization by partitioning ONUs into two subgroups with some overlap. In the proposed scheme, after receiving frames from ONUs in one subgroup, the OLT performs dynamic bandwidth allocation for ONUs in the other. Hence, the OLT continuously receives frames from ONUs without significant interruptions. Comprehensive computer simulation results show that the proposed algorithm both defers saturation points of queues in ONUs and provides outstanding network throughput compared with previous work. It has up to 45% lower average packet delay and maximum performance improvement of 17% with respect to network throughput.

Published in:

Optical Communications and Networking, IEEE/OSA Journal of  (Volume:1 ,  Issue: 5 )