Model of optimal paths design for GMPLS network and algorithm based on Lagrangian relaxation method

Authors:
Teruji Sekozawa;Takashi Fukumoto
Affiliations:
Department of Information Systems Creation, Kanagawa University, Yokohama, Japan;System Development Laboratory, Hitachi Ltd., Asao-ku, Kanagawa, Japan
Venue:
ICS'08 Proceedings of the 12th WSEAS international conference on Systems
Year:
2008

Citing 3
Cited 0

Modern heuristic techniques for combinatorial problems

Modern heuristic techniques for combinatorial problems
A Survey of Algorithms for Convex Multicommodity Flow Problems

Management Science
Multiprotocol lambda switching: combining MPLS traffic engineering control with optical crossconnects

IEEE Communications Magazine

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe an optimal path design for a GMPLS network that uses the Lagrangian relaxation method, which can estimate the lower bounds of the solution to a problem. This feature helps the designer of the problem to take the accuracy of the solution obtained by the calculation into consideration when he makes a decision to assign the solution to a real network in critical situations. A formulation of the problem and how to solve it using the Lagrangian Relaxation method is described, and the results obtained by a prototype and considerations are shown in this paper.