3 September 2002 Fair scheduling algorithms for supporting QoS in optical burst switching networks
Author Affiliations +
Proceedings Volume 4907, Optical Switching and Optical Interconnection II; (2002) https://doi.org/10.1117/12.482267
Event: Asia-Pacific Optical and Wireless Communications 2002, 2002, Shanghai, China
Abstract
In this paper, we focus on data channel scheduling algorithms for offset-time based QoS scheme in OBS networks and their performance evaluation. We propose two new data channel scheduling algorithms, namely, the Earliest Available Unscheduled Channel (EAUC) algorithm and the Least Gap with Void Filling (LGVF) algorithm. Simulation results show that the proposed burst scheduling algorithms can not only provide the better fairness for scheduling data channels and fair QoS supporting of different class service, but also achieve high link utilization while keeping the burst dropping probability low.
© (2002) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Keping Long, Rodney S. Tucker, Se-yoon Oh, "Fair scheduling algorithms for supporting QoS in optical burst switching networks", Proc. SPIE 4907, Optical Switching and Optical Interconnection II, (3 September 2002); doi: 10.1117/12.482267; https://doi.org/10.1117/12.482267
PROCEEDINGS
8 PAGES


SHARE
Back to Top