Wavelength Routing and Assignment in a Survivable WDM Mesh Network

Jeffery Kennington (), Eli Olinick (), Augustyn Ortynski () and Gheorghe Spiride ()
Additional contact information
Jeffery Kennington: Department of Engineering Management, Information, and Systems, School of Engineering, Southern Methodist University, Dallas, Texas 75275-0123
Eli Olinick: Department of Engineering Management, Information, and Systems, School of Engineering, Southern Methodist University, Dallas, Texas 75275-0123
Augustyn Ortynski: Nortel Networks, Richardson, Texas 75082
Gheorghe Spiride: Nortel Networks, Richardson, Texas 75082

Operations Research, 2003, vol. 51, issue 1, 67-79

Abstract: All-optical networks with wavelength division multiplexing (WDM) capabilities are prime candidates for future wide-area backbone networks. The simplified processing and management of these very high bandwidth networks make them very attractive. A procedure for designing low cost WDM networks is the subject of this investigation.In the literature, this design problem has been referred to as the routing and wavelength assignment problem. Our proposed solution involves a three-step process that results in a low-cost design to satisfy a set of static point-to-point demands. Our strategy simultaneously addresses the problem of routing working traffic, determining backup paths for single node or single link failures, and assigning wavelengths to both working and restoration paths.An integer linear program is presented that formally defines the routing and wavelength assignment problem (RWA) being solved along with a simple heuristic procedure. In an empirical analysis, the heuristic procedure successfully solved realistically sized test cases in under 30 seconds on a Compaq AlphaStation. CPLEX 6.6.0 using default settings required over 1,000 times longer to obtain only slightly better solutions than those obtained by our new heuristic procedure.

Keywords: Optical networks: wavelength routing; Network design: provisioning (search for similar items in EconPapers)
Date: 2003
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.51.1.67.12805 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:51:y:2003:i:1:p:67-79

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().