Modern heuristic techniques for combinatorial problems
Modern heuristic techniques for combinatorial problems
A Survey of Algorithms for Convex Multicommodity Flow Problems
Management Science
Guarantee of service (GoS) support over MPLS using active techniques
AIC'04 Proceedings of the 4th WSEAS International Conference on Applied Informatics and Communications
MPLS/IP analysis and simulation for the implementation of path restoration schemes
AIC'04 Proceedings of the 4th WSEAS International Conference on Applied Informatics and Communications
Middleware design of bandwidth constrained QoS model for multi hop ad hoc networks
WSEAS TRANSACTIONS on COMMUNICATIONS
Reverse shortest path for dataflow optimization of hierarchically structure data networks
WSEAS TRANSACTIONS on COMMUNICATIONS
Using policy-based MPLS management architecture to improve QoS on IP network
WSEAS Transactions on Computers
Network reliability importance measures: combinatorics and Monte Carlo based computations
WSEAS Transactions on Computers
IEEE Communications Magazine
| Hi-index | 0.00 |
We describe an optimal path design for a GMPLS network that employs the Lagrangian relaxation method, which can be used to estimate the lower bounds of a solution to a problem. This feature assists the designer of the problem to consider the accuracy of the solution obtained by the calculation when deciding whether 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.