Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Elastic ONU-class-based idle time elimination algorithm for Ethernet passive optical networks

Elastic ONU-class-based idle time elimination algorithm for Ethernet passive optical networks To fully exploit the upstream bandwidth in Ethernet passive optical networks (EPONs), dynamic bandwidth allocation (DBA) algorithms need to collect the report messages from all the optical network units (ONUs), incurring an idle time comprising the DBA computation time and the round trip time. Some studies have addressed the problem by using the data transmissions of some or all ONUs (ONU-based) to eliminate the idle time. To satisfy the stringent quality of service (QoS) requirements, for example, to improve the packet delay and jitter for delay sensitive applications without degrading QoS support for other types of applications, some studies have proposed to separate the transmission of higher-class and lower-class traffic within one scheduling cycle. Existing studies on the separable scheduling scenario use the class-based concept, that is, use either the higher-class transmission or the lower-class transmission to eliminate the idle time. By contrast, in this paper, an elastic ONU-class-based idle time elimination algorithm (EOCA) is proposed in which the idle time is eliminated using both the higher-class and lower-class transmissions. The proposed mechanism is elastic in the sense that the lower-class transmission is first considered, and then if insufficient lower-class transmissions exist to eliminate the idle time, the OLT pre-allocates the higher-class transmissions in the following cycle to test whether or not the idle time is eliminated. If the idle time is still not eliminated, the OLT reallocates the bandwidth corresponding to the uneliminated idle time to either the last ONU (uneven method) or all of the ONUs (even method) such that the ONU(s) can early transmit any lower-class packets which arrive during the waiting time. Compared to existing class-based or ONU-based idle time elimination algorithms, the proposed EOCA algorithm performs better. The validity of the proposed EOCA algorithm is demonstrated via detailed simulation experiments. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Photonic Network Communications Springer Journals

Elastic ONU-class-based idle time elimination algorithm for Ethernet passive optical networks

Loading next page...
1
 
/lp/springer_journal/elastic-onu-class-based-idle-time-elimination-algorithm-for-ethernet-GqULY1kJNn

References (12)

Publisher
Springer Journals
Copyright
Copyright © 2013 by Springer Science+Business Media New York
Subject
Computer Science; Computer Communication Networks; Electrical Engineering; Characterization and Evaluation of Materials
ISSN
1387-974X
eISSN
1572-8188
DOI
10.1007/s11107-013-0395-1
Publisher site
See Article on Publisher Site

Abstract

To fully exploit the upstream bandwidth in Ethernet passive optical networks (EPONs), dynamic bandwidth allocation (DBA) algorithms need to collect the report messages from all the optical network units (ONUs), incurring an idle time comprising the DBA computation time and the round trip time. Some studies have addressed the problem by using the data transmissions of some or all ONUs (ONU-based) to eliminate the idle time. To satisfy the stringent quality of service (QoS) requirements, for example, to improve the packet delay and jitter for delay sensitive applications without degrading QoS support for other types of applications, some studies have proposed to separate the transmission of higher-class and lower-class traffic within one scheduling cycle. Existing studies on the separable scheduling scenario use the class-based concept, that is, use either the higher-class transmission or the lower-class transmission to eliminate the idle time. By contrast, in this paper, an elastic ONU-class-based idle time elimination algorithm (EOCA) is proposed in which the idle time is eliminated using both the higher-class and lower-class transmissions. The proposed mechanism is elastic in the sense that the lower-class transmission is first considered, and then if insufficient lower-class transmissions exist to eliminate the idle time, the OLT pre-allocates the higher-class transmissions in the following cycle to test whether or not the idle time is eliminated. If the idle time is still not eliminated, the OLT reallocates the bandwidth corresponding to the uneliminated idle time to either the last ONU (uneven method) or all of the ONUs (even method) such that the ONU(s) can early transmit any lower-class packets which arrive during the waiting time. Compared to existing class-based or ONU-based idle time elimination algorithms, the proposed EOCA algorithm performs better. The validity of the proposed EOCA algorithm is demonstrated via detailed simulation experiments.

Journal

Photonic Network CommunicationsSpringer Journals

Published: Feb 10, 2013

There are no references for this article.