An optimal path design for GMPLS by Lagrangean relaxation method

摘要

This paper describes an optimal path design for GMPLS network by Lagrangean relaxation method. The Lagrangean method makes it possible that we design logical paths on GMPLS network in consideration of an accuracy of outputs, because there is a feature that the method solves a problem grasping an upper bound of solution. We will mention formulation and solution of the optimal path design problem by Lagrangean method, and show outputs by an prototype and consideration.