Record Details

Routing and wavelength assignment in optical networks from edge disjoint path algorithms

DSpace at IIT Bombay

View Archive Info
 
 
Field Value
 
Title Routing and wavelength assignment in optical networks from edge disjoint path algorithms
 
Creator MANJUNATH, D
MANOHAR, P
SHEVGAONKAR, RK
 
Subject graph theory
network topology
optical fibre networks
telecommunication network routing
 
Description Routing and wavelength assignment (RWA) problems in wavelength-routed optical networks are typically solved using a combination of integer programming and graph coloring. Such techniques are complex and make extensive use of heuristics. We explore an alternative solution technique in the well-known maximum edge disjoint paths (EDP) problem which can be naturally adapted to the RWA problem. Maximum EDP is NP-hard, but now it is known that simple greedy algorithms for it are as good as any of the more complex heuristic solutions. In this paper we investigate the performance of a simple greedy maximum edge disjoint paths algorithm applied to the RWA problem and compare it with a previously known solution method.
 
Publisher IEEE
 
Date 2008-11-24T05:27:22Z
2011-11-25T12:34:16Z
2011-12-26T13:07:09Z
2011-12-27T05:55:11Z
2008-11-24T05:27:22Z
2011-11-25T12:34:16Z
2011-12-26T13:07:09Z
2011-12-27T05:55:11Z
2002
 
Type Article
 
Identifier IEEE Communications Letters 6(5), 211-13
1089-7798
http://dx.doi.org/10.1109/4234.1001667
http://hdl.handle.net/10054/104
http://dspace.library.iitb.ac.in/xmlui/handle/10054/104
 
Language en_US