Scheduled System Maintenance on December 17th, 2014:
IEEE Xplore will be upgraded between 2:00 and 5:00 PM EST (18:00 - 21:00) UTC. During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

Distributed QoS-aware scheduling algorithm for WDM optical interconnects with arbitrary wavelength conversion capability

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)
Zhenghao Zhang ; Dept. of Electr. & Comput. Eng., State Univ. of New York, Stony Brook, NY, USA ; Yuanyuan Yang

We study scheduling problems in bufferless time slotted WDM optical interconnects with wavelength conversion ability. We consider the case when the connection requests have different priorities and give algorithms that are a ware of the quality of service (QoS) requirements. The wavelength conversion considered in this paper is the general case of limited range wavelength conversion with arbitrary wavelength conversion capability, as limited range wavelength conversion is easier to implement and more cost effective than full range wavelength conversion, and it also includes full range wavelength conversion as a special case. We show that the problem of maximizing network throughput and giving service differentiation can be formalized as finding an optimal matching in a weighted bipartite graph. We then give an optimal distributed scheduling algorithm called the Downwards Expanding algorithm that runs in O(k2) time to find such a matching, where k is the number of wavelengths per fiber.

Published in:

Parallel Processing, 2004. ICPP 2004. International Conference on

Date of Conference:

15-18 Aug. 2004