QoS based routing algorithm in integrated services packet networks

  • Authors:

  • Chotipat Pornavalai;Goutam Chakraborty;Norio Shiratori

  • Affiliations:

  • -;-;-

  • Venue:
  • Journal of High Speed Networks - Special issue on quality of service routing and signaling
  • Year:
  • 1998

Quantified Score

Hi-index 0.01

Visualization

Abstract

In this paper we study QoS based routing algorithm forsupporting resource reservation in high-speed Integrated ServicesPacket Network (ISPN). Recently, this problem was proved to beNP-complete. However, when the considered QoS constraints arebandwidth, delay, delay jitter, and loss-free, we have shown thatby employing Weighted Fair Queueing (WFQ) service discipline, thecomplexity of the problem could be reduced to that of shortest pathrouting without any QoS constraints. Then such a multiple QoSconstrained route could be searched in polynomial time. We alsopresent that routing algorithm (called "QoSRBF"), whichis a modified version of Bellman-Ford shortest path algorithm.Simulation results show that QoSRBF has betterperformance compared to the existing QoS routing algorithms.