By Topic

Dynamic routing algorithms in 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
$33 $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)
R. Mewanou ; Lab. de Recherche en Reseautique et Informatique Mobile, Ecole Polytech. de Montreal, Que., Canada ; S. Pierre

In this paper, we consider dynamic routing in all-optical networks without wavelength converters which are very expensive and always not effective. We propose two new heuristic algorithms to manage optical routing based on link-state and reduce blocking probability of request arriving in the network. The first one uses a technique similar to "fixed paths least congested" (FPLC) routing by analyzing the first k links on each path whereas the second is based on an estimation of the link-congestion in the network. Both algorithms achieve good performance, for different types of network topologies, when compared to existing methods like FPLC, LLR, and FPLC-k.

Published in:

Electrical and Computer Engineering, 2003. IEEE CCECE 2003. Canadian Conference on  (Volume:2 )

Date of Conference:

4-7 May 2003