By Topic

A QoS-based batch scheduling algorithm in optical burst switching WDM 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

6 Author(s)
Wei Tan ; Key Lab of Opt. Fiber Transmission & Commun. Networks, Univ. of Electron. Sci. & Technol., Chengdu, China ; Pan, Y.H. ; Du Xu ; Sheng Wang
more authors

The paper proposes a new scheduling algorithm for core routers to support QoS in optical burst switching networks. In the proposed algorithm, which is named waiting-queuing-scheduling, all BHPs (burst header packets) are deliberately delayed a properly-designed time, and added to input queues with a policy. All BHPs are scheduled in a batch when the waiting period times out. Using one of the currently well-known scheduling algorithm as its sub-algorithm, the proposed scheme is rather simple and feasible, and can yield a good performance. The simulation results show that the burst loss probabilities of higher classes can be decreased greatly, while not introducing much end-to-end delay. In addition, with proper waiting time, the average loss probability can also be decreased.

Published in:

Communications, Circuits and Systems, 2004. ICCCAS 2004. 2004 International Conference on  (Volume:1 )

Date of Conference:

27-29 June 2004