An Improved QoS Routing Algorithm in Internet

  • Hongbo Huang
  • Yongzhi Wang
Conference paper
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 219)


An efficient routing algorithm for Improving the QoS in Internet has been proposed and presented in this paper. The algorithm is a kind of multi constrained path algorithm. The routing takesplace based on more than one link weight components. To avoid the NP complete problem and to increase the computational efficiency some advancements are added. These include the definition of nonlinear path length, where the subpaths may not be the shortest path, having ‘k’ number of shortest paths in a node instead of having only the shortest path, and then removing the path dominancy for state space reduction. Finally, the concept of look ahead is also included through which a predicted path to destination is mapped. This work only implements the removal of path dominancy where the queue is updated by removing the dominated paths from the queue. The simulation also shows the better performance of the system.


Qos Routing algorithm Internet 


  1. 1.
    Van Mieghem Piet, Kuipers FA (2009) Concept of exact QoS routing algorithms. IEEE/ACM Trans Netw 45(3):56–58Google Scholar
  2. 2.
    Apostolopoulos G, Williams D, Kamart S, Guerin R, Orda A, Przygienda T (2008) QoS routing mechanism and OSPF extensions, RFC 2676, Networking Group 23(3):45–47Google Scholar
  3. 3.
    Chen S, Nahrstedt K (1998) On finding multi-constrained paths. In: Proceedings of IC conference, New York 24(3):2–4Google Scholar
  4. 4.
    Henig MI (2005) The shortest path problem with two objective functions. Eur J Oper Res 25(13):46–49Google Scholar
  5. 5.
    Jaffe JM (2007) Algorithm for finding paths with multiple constraints. Networks 14(9):9–10MathSciNetGoogle Scholar
  6. 6.
    Korkmaz T, Krunz M (2001) A randomized algorithm for finding path subject to multiple QoS routing requirements. Comput Netw 36(3):15–18Google Scholar
  7. 7.
    Liu G, Ramakrishnan KG (2009) An algorithm for finding K shortest paths subject to multiple constraints. In: proceedings of IEEE INFOCOM 2(24):146–149Google Scholar
  8. 8.
    Orda A (2008) Routing with end to end QoS guarantees in broadband networks. IEEE/ACM Trans Netw 7(33):22–24Google Scholar

Copyright information

© Springer-Verlag London 2013

Authors and Affiliations

  1. 1.Information Engineering InstituteYueyang Vocational Technical CollegeYueyangPeople’s Republic of China
  2. 2.Computer Institute Hunan Institute of Science and TechnologyYueyangPeople’s Republic of China

Personalised recommendations