Linear and Nonlinear Lagrange Relaxation Algorithms for Delay-Constrained Least-Cost QoS Routing


IEICE TRANSACTIONS on Communications   Vol.E85-B   No.11   pp.2437-2446
Publication Date: 2002/11/01
Online ISSN: 
Print ISSN: 0916-8516
Type of Manuscript: PAPER
Category: Network
QoS routing,  delay-constrained least-cost path,  additive QoS constraints,  Lagrange relaxation,  high-speed networking,  

Full Text: PDF>>
Buy this Article

The development of efficient quality of service (QoS) routing algorithms in a high-speed network environment is a very important and at the same time very difficult task due to the need to provide divergent services with multiple QoS requirements. Recently heuristic algorithms based on Lagrange relaxation techniques have been proposed to resolve the contradiction between the time complexity and the quality of solution. In this paper, we investigate the performance of two heuristic algorithms, LR_DCLC and NR_DCLC, for the delay-constrained least-cost (DCLC) routing problem. Algorithm LR_DCLC is based on linear relaxation, while algorithm NR_DCLC, which is proposed in this paper, is based on nonlinear relaxation. A large number of simulations demonstrate that even though both algorithms have very good performance, NR_DCLC can obtain much better solutions than LR_DCLC by running Dijkstra's algorithm on average a few more times, especially in the case when the optimal solutions are hard to find.