By Topic

A Routing Algorithm Framework for Survivable Optical Networks Based on Resource Consumption Minimization

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)
Manoj Sivakumar ; Microsoft Corp., Redmond ; Krishna M. Sivalingam

In this paper, we consider the problem of determining primary and backup paths for survivable optical wavelength-division multiplexed mesh networks. We propose a distributed routing mechanism, which is called Least Resource Consumption Routing, that tries to minimize the combined cost of the primary and the backup paths. The proposed cost model includes the effect of various factors such as mean load, variance of the load on the route, number of converters required by the route, and the length of the route. Further, we model the route cost in such a way that it is extensible to include any new parameters and vary their relative importance. The performance studies conducted for the 14-node National Science Foundation Network and a 30-node topology show that the proposed scheme leads to significant improvements in blocking probability at low and moderate loads. Further, the proposed cost model also reduces the number of converters required to obtain a target blocking performance as compared to some other techniques proposed in the literature.

Published in:

Journal of Lightwave Technology  (Volume:25 ,  Issue: 7 )