By Topic

Fast scheduling for optical packet switches with minimum configurations

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)
Zhen Zhou ; Dept. of Comput. Sci., Hong Kong Univ. of Sci. & Technol., Kowloon, China ; Xin Li ; Hamdi, M.

Scheduling optical packet switches with minimum configurations has been proven to be NP-complete. Moreover, an optimal scheduling algorithm produce as many as θ(log N) empty slots in each switching per time slot for an N × N optical switch. The best known algorithm approximates the optimal solution in O (N3.5) time. In this paper, we propose an algorithm called DNC with minimal time complexity θ(N2) based on divide-and-conquer paradigm. The number of empty slots created by our algorithm is upper bounded by θ(N). However, simulation results indicate that it is approximately O(log N) on average. Therefore, our algorithm is more practical and beats the previous ones when optical switches have large reconfiguration overhead.

Published in:

High Performance Switching and Routing, 2005. HPSR. 2005 Workshop on

Date of Conference:

12-14 May 2005