By Topic

Performance Evaluation of an Ultra-Fast Pipeline Scheduler for Next-Generation 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

3 Author(s)
Anan, M.T. ; Univ. of Missouri, Kansas City ; Chaudhry, G.M. ; Qaddour, J.

The Internet protocol (IP) plays a dominant role in current networking technologies and the wavelength division multiplexing (WDM) technology provides tremendous bandwidth. The IP-over-WDM is becoming the right choice for next-generation Internet networks where optical burst switches (OBS) is a promising technique to bridge the gap between IP and WDM. However, traditional OBS scheduling algorithms either have low computational complexity with high burst dropping probability or high computational complexity with low burst dropping probability. A critical design issue in OBS is how to reduce burst dropping probability as a result of resource contention using a high performance scheduling algorithm. In this paper, we present an ultra-fast scheduler which integrates the merits of both low computational complexity and low burst dropping probability. The key idea is to maintain all scheduled data bursts and void intervals in a binary representation. Then, fast hardware logic operations are performed to schedule incoming data bursts without the need to traverse and search all scheduled bursts in all channels. The new approach provides an effective optical burst switching for variable-length bursts with low computational complexity compared to existing scheduling algorithms.

Published in:

Computer Systems and Applications, 2007. AICCSA '07. IEEE/ACS International Conference on

Date of Conference:

13-16 May 2007