By Topic

A dynamic routing algorithm with load balancing heuristics for restorable connections in WDM 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

3 Author(s)
Lu Ruan ; Dept. of Comput. Sci., Iowa State Univ., Ames, IA, USA ; Luo, H. ; Chang Liu

Dynamic routing of a restorable connection requires a pair of link-disjoint primary and backup lightpaths to be found online when a connection request arrives at the network. We present a distributed dynamic routing algorithm for restorable connections that uses load balancing heuristics in both primary and backup path computations to achieve low demand blocking. The key idea is to assign costs to links so that heavily loaded links will be avoided in the routing of the primary and backup paths and links with a high chance of including a sharable backup channel will be included in the backup path. Simulation results showed that the algorithm performs significantly better than a simple distributed algorithm and achieves comparable performance as a centralized algorithm.

Published in:

Selected Areas in Communications, IEEE Journal on  (Volume:22 ,  Issue: 9 )