Fair scheduling algorithms for supporting QoS in optical burst switching networks

Keping Long; Rodney S. Tucker; Se-yoon Oh

doi:10.1117/12.482267

3 September 2002 Fair scheduling algorithms for supporting QoS in optical burst switching networks

Keping Long, Rodney S. Tucker, Se-yoon Oh

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.

Citation Download Citation

Keping Long, Rodney S. Tucker, and 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); https://doi.org/10.1117/12.482267

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available