By Topic

Routing with QoS constraints in integrated services 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
$31 $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)
Pornavalai, C. ; Res. Inst. of Electr. Commun., Tohoku Univ., Sendai, Japan ; Chakraborty, G. ; Shiratori, N.

Though the complexity for finding QoS guaranteed route in an integrated services network is proved to be NP-complete, the proof has been done without the assumption of any specific service discipline. Because each service discipline has different QoS bound computation expressions, we propose that the QoS routing algorithm should be designed for specific service discipline used. We then present a proof that, when the considered QoS constraints are bandwidth, delay, delay jitter, and loss free, by employing the weight fair queueing (WFQ) service discipline, the complexity of the problem could be reduced to that of shortest path routing without any QoS constraints. Therefore we can search such a multiple QoS constrained route in polynomial time. We also present a routing algorithm (called “QoSRBF” ), which is a modified version of Bellman-Ford. QoSRBF can, not only successfully find the route that can satisfy the required QoS constraints, but also utilize resources wisely to minimize the call blocking probability for future calls

Published in:

Protocols for Multimedia Systems - Multimedia Networking, 1997. Proceedings., IEEE Conference on

Date of Conference:

24-27 Nov 1997