By Topic

Performance of scheduling algorithms minimizing the packet loss in optical switches equipped with limited range and shared wavelength converters

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

2 Author(s)
Eramo, V. ; INFOCOM, Rome Univ. ; Listanti, M.

This paper compares some optical packet switching architectures that use the wavelength conversion technique to solve the packet contention problem. The architectures are equipped with shared and limited-range wavelength converters. We evaluate for these architectures the performance of the optimum scheduling algorithm by resolving an integer linear programming problem. Unfortunately the optimum scheduling algorithm has a high time complexity and it cannot be adopted for optical packet switches requiring packet scheduling time in the order of 10+100 ns. For this reason we propose some scheduling algorithms allowing the best optimum scheduling performance to be reached in low computation time. In particular we propose an algorithm able to reach good performance with a complexity O(M), M being the number of wavelengths used

Published in:

Broadband Networks, 2005. BroadNets 2005. 2nd International Conference on

Date of Conference:

7-7 Oct. 2005