A New Method for Solving Routing and Wavelength Assignment Problems in Optical Networks

The standard Lagrangian relaxation (SLR) method is an efficient method for solving the routing and wavelength assignment (RWA) problems in optical networks. However, previous work did not deal with multiple connection requests with identical source and destination pairs, which are frequently encount...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of lightwave technology Jg. 25; H. 8; S. 1895 - 1909
Hauptverfasser: Guan, Xiaohong, Guo, Sangang, Zhai, Qiaozhu, Gong, Weibo, Qiao, Chunming
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York, NY IEEE 01.08.2007
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
Algorithms
Applied sciences
Automation
Computer networks
Convergence
Exact sciences and technology
Intelligent networks
Intelligent systems
Joints
Laboratories
Lagrangian functions
Lagrangian relaxation
Low level
Mathematical models
Optical communication
Optical fiber communications
Optical fiber networks
optical networks
Optical telecommunications
optimization
Routing (telecommunications)
routing and wavelength assignment (RWA)
Studies
Systems engineering and theory
Systems, networks and services of telecommunications
Telecommunications
Telecommunications and information theory
Transmission and modulation (techniques and equipments)
Wavelength assignment
Wavelength division multiplexing
Wavelength routing
Wavelengths
optical networks
Frequency allocation
Shortest path
Routing
Algorithm
Implementation
Optimization
Optical fiber network
Lagrange multiplier
Lagrangian relaxation
Relaxation method
Numerical simulation
Optical fiber communication
routing and wavelength assignment (RWA)
Lagrangian method
ISSN:0733-8724, 1558-2213
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The standard Lagrangian relaxation (SLR) method is an efficient method for solving the routing and wavelength assignment (RWA) problems in optical networks. However, previous work did not deal with multiple connection requests with identical source and destination pairs, which are frequently encountered in practice and can cause serious issues when using SLR. More specifically, in solving the dual subproblems after the wavelength capacity constraints are relaxed, the shortest path algorithms such as Dijkstra's typically assign the same route to such connection requests, which possibly leads to a poor RWA solution. In this paper, we introduce a new method, i.e., the successive subproblem solving (SSS) method and one of its implementations, within the Lagrangian relaxation framework. The essence of SSS is to introduce coupled penalty terms and use the surrogate subgradients for search direction at the high level. The homogenous subproblems at the low level are then solved sequentially to avoid the nondecomposable difficulty. Theoretical analysis is performed to provide convergence proof. Numerical results are presented to show that the new method is effective and efficient.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
ISSN:0733-8724
1558-2213
DOI:10.1109/JLT.2007.901344