ScholarLens Back to search
2007•Unpublished venueRequires access

Optimal Paths Design for a GMPLS Network using the Lagrangian Relaxation Method

Takashi Fukumoto, Norihisa Komoda

Open publisher page 0 citations

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.

About this research paper

What this paper is about

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.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

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

Key concepts: Lagrangian relaxation, Relaxation (psychology), Lagrangian, Mathematical optimization, Computer science, Network planning and design, Path (computing), Feature (linguistics)

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Optimal Paths Design for a GMPLS Network using the Lagrangian Relaxation Method — Research Paper | ScholarLens