Share Email Print

Proceedings Paper

Fair scheduling algorithms for supporting QoS in optical burst switching networks
Author(s): Keping Long; Rodney S. Tucker; Se-yoon Oh
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper 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.

Paper Details

Date Published: 3 September 2002
PDF: 8 pages
Proc. SPIE 4907, Optical Switching and Optical Interconnection II, (3 September 2002); doi: 10.1117/12.482267
Show Author Affiliations
Keping Long, Univ. of Melbourne (Australia)
Rodney S. Tucker, Univ. of Melbourne (Australia)
Se-yoon Oh, Information and Communications Univ. (South Korea)

Published in SPIE Proceedings Vol. 4907:
Optical Switching and Optical Interconnection II
Lih-Yuan Lin; Yimo Zhang; Kimio Oguchi, Editor(s)

© SPIE. Terms of Use
Back to Top