Cart (Loading....) | Create Account
Close category search window
 

QoS routing algorithms for pre-computed paths

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.

Routing with multiple QoS constraints is known to be a NP-complete problem. In our previous work (QoSRBF algorithm), we have shown that, for a number of specific QoS constraints, this problem can be solved in polynomial time, when a weighted fair queueing (WFQ) service discipline is employed. QoSRBF is an on-demand algorithm. We propose a number of QoS routing algorithms for pre-computed paths, when all or some of the flow specification parameters and the amount of bandwidth that has to be reserved are not known a priori. We also show that the size of the routing table could be reduced, as paths satisfying some conditions could be neglected

Published in:

Computer Communications and Networks, 1997. Proceedings., Sixth International Conference on

Date of Conference:

22-25 Sep 1997

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.