Optimization of QoS routing

  • Agrawal H
  • Grah M
  • Gregory M
  • 7


    Mendeley users who have this article in their library.
  • 4


    Citations of this article.


Next generation Internet applications provide guaranteed end-to-end quality-of-service (QoS). Optimization based on constraints for QoS routing is computationally complex and for this reason many heuristics have been proposed for routing in a practical situation. Among these delay constrained least cost (DCLC) routing is popular. In this paper we propose an algorithm for delay-constrained problems. Multimedia applications have stringent constraints on delay, delay-jitter, cost, etc. The main purpose of QoS routing is to find a feasible path that has sufficient resources to satisfy the constraints. The delay and cost constrained routing problem is NP-complete. This paper presents an technique called E-LARAC based on Lagrange relaxation that gives a lower bound on the theoretical optimal solution. Simulation results show that it can obtain better performance than CBF and DCUR.

Author-supplied keywords

  • Optimization
  • QoS routing

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free