By Topic

An Efficient Composite Scheduling Algorithm for Optical Burst Switching Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Ruyan Wang ; Special Res. Centre for Opt. Internet & Wireless Information Networks, Chongqing Univ. of Posts & Telecommun. ; Jiaofa Chang ; Keping Long ; Xiaolong Yang

Optical burst switching (OBS) is a promising paradigm for the next generation Internet. Data channel scheduling algorithm is one of the key issues in OBS networks. In this paper, an efficient composite data channel scheduling algorithm is proposed, this algorithm select LAUC or LAUC-VF to schedule the arriving burst according to the current information of the void interval of the data channel. The algorithm reduces scheduling time of data burst while minimizing the void interval of the data channel. Simulation results show that the scheduling time of the proposed algorithm is close to LAUC, and the performance of data burst loss probability is better than LAUC-VF.

Published in:

Communications and Networking in China, 2006. ChinaCom '06. First International Conference on

Date of Conference:

25-27 Oct. 2006