Proof of a fundamental result in self-similar traffic modeling
ACM SIGCOMM Computer Communication Review
SRR: An O(1) time complexity packet scheduler for flows in multi-service packet networks
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Stratified round Robin: a low complexity packet scheduler with bandwidth fairness and bounded delay
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
IEEE Journal on Selected Areas in Communications
QoS Control Schemes for Two-Stage Ethernet Passive Optical Access Networks
IEEE Journal on Selected Areas in Communications
Dynamic hierarchical bandwidth allocation using Russian Doll Model in EPON
Computers and Electrical Engineering
A study of quality of service in the universal DBA algorithm using a PIC-based EPON testbed
Photonic Network Communications
Hi-index | 0.24 |
Ethernet passive optical networks (EPONs) are being designed to deliver different quality of service (QoS) to carry heterogeneous traffic of end users. For this purpose, hierarchical scheduling is needed for upstream bandwidth allocation, with high-level scheduling for inter-optical network unit (ONU) allocation and low-level scheduling for intra-ONU distribution. In this paper, we propose new User-oriented Hierarchical bandwidth Scheduling Algorithms (UHSAs) that support differentiated services and guaranteed fairness among end users. For inter-ONU scheduling, we adopt an improved hybrid cycle approach that separates a frame into a static part for high priority traffic and an adaptive dynamic part for low priority traffic. For intra-ONU scheduling, we propose credit-based scheduling approach to guarantee fairness among end users. To improve scheduling efficiency and lower queue management complexity, we design a novel credit-based common queue (CCQ) for each traffic class to enhance scheduling architecture and minimize average number of queues in the ONU. On the other hand, we propose a transmission priority scheme for different queue groups, which together with CCQ mechanism serves the objective of improving delay and delay variation performance of high priority traffic, guaranteeing throughput for bandwidth sensitive medium priority traffic, as well as providing fairness and throughput protection among different users. The UHSAs exhibit a feature of multiple transmission opportunities (M-opportunities) per-cycle for high priority traffic that is significant in improving delay and delay variation performance for high priority traffic as compared with previous solutions of single transmission opportunity (S-opportunity) per-cycle. Detailed simulation experiments are conducted to study the performance and validate the effectiveness of the proposed protocols.