By Topic

Approximation algorithms for traffic routing in wavelength routed 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)
Aneja, Y. ; Windsor Univ., Canada ; Jaekel, A. ; Bandyopadhyay, S.

One major objective in WDM network design is to develop a logical topology and a routing that minimizes the congestion of the network. A standard approach is to decouple the problem of logical topology design and the problem of routing on this logical topology. Heuristics for finding the logical topology exist and a straight-forward linear program (LP), based on the node-arc formulation is normally used to solve the routing problem over a given logical topology. We have found that such LP formulations become computationally intractable for large networks. In this paper, we have introduced a novel approach for routing traffic over a given logical topology, using the concept of approximation algorithms. This technique allows us to efficiently route traffic for practical sized networks and obtain solutions, which are guaranteed to be within a specified bound of the optimal solution. Simulation results from different networks demonstrate that approximation algorithms can be used to quickly generate "near-optimal" solutions to the traffic routing problem in WDM networks.

Published in:

Broadband Networks, 2005. BroadNets 2005. 2nd International Conference on

Date of Conference:

3-7 Oct. 2005