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

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...

Full description

Saved in:
Bibliographic Details
Published in:IEEE communications letters 2002-05, Vol.6 (5), p.211-213
Main Authors: Manohar, P., Manjunath, D., Shevgaonkar, R.K.
Format: Article
Language:English
Subjects:
Algorithms
Applied sciences
Computer networks
Exact sciences and technology
Graphs
Greedy algorithms
Heuristic
Humans
Integer programming
Intelligent networks
Linear programming
Mathematical programming
Network topology
Optical communication
Optical fiber networks
Optical wavelength conversion
Routing (telecommunications)
Systems, networks and services of telecommunications
Telecommunications
Telecommunications and information theory
Teletraffic
Wavelength assignment
Wavelength routing
Wavelengths
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1089-7798
1558-2558
DOI:10.1109/4234.1001667