By Topic

On-line permutation routing on WDM all-optical 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

1 Author(s)
Qian-Ping Gu ; Sch. of Comput. Sci., Simon Fraser Univ., Burnaby, BC, Canada

For a sequence (s1, t1), ..., (si, ti), ... of routing requests with (si, ti) arriving at time step i on the wavelength-division multiplexing (WDM) all-optical network, the on-line routing problem is to set-up a path si → ti and assign a wavelength to the path in step i such that the paths set-up so far with the same wavelength are edge-disjoint. Two measures are important for on-line routing algorithms: the number of wavelengths used and the response time. The sequence (s1,t1), ..., (si, ti), ... is called a permutation if each node in the network appears in the sequence at most once as a source and at most once as a destination. Let Hn be the n-dimensional WDM all-optical hypercube. We develop two on-line routing algorithms on Hn. Our first algorithm is a deterministic one which realizes any permutation by at most 3(n-1)/2 + 1 wavelengths with response time O(2n). The second algorithm is a randomized one which realizes any permutation by at most (3/2 + δ)(n-1) wavelengths, where δ can be any value satisfying δ ≥ 2/(n-1). The average response time of the algorithm is O(n(1 + δ)/δ). Both algorithms use at most O(n) wavelengths for the permutation on Hn. This improves the previous bound of O(n2).

Published in:

Parallel Processing, 2002. Proceedings. International Conference on

Date of Conference:

2002