By Topic

QoS based routing algorithm in integrated services packet networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
C. Pornavalai ; Res. Inst. of Electr. Commun., Tohoku Gakuin Univ., Sendai, Japan ; G. Chakraborty ; N. Shiratori

In this paper we study QoS based routing algorithm for supporting resource reservation in high-speed Integrated Services Packet Network (ISPN). Recently, this problem was proved to be NP-complete. However, when the considered QoS constraints are bandwidth, delay, delay jitter, and loss free, we have shown that by employing Weighted Fair Queueing (WFQ) service discipline, the complexity of the problem could be reduced to that of shortest path routing without any QoS constraints. Then such a multiple QoS constrained route could be searched in polynomial time. We also present the routing algorithm (called “QoSRBF”), which is a modified version of Bellman-Ford shortest path algorithm. Simulation results show that QoSR BF has better performance compared to the existing QoS routing algorithms

Published in:

Network Protocols, 1997. Proceedings., 1997 International Conference on

Date of Conference:

28-31 Oct 1997