loading...
QoS routing algorithms for pre-computed paths
Las Vegas, NV September 22-September 25
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICCCN.1997.623320Sixth International Conference on Com ...
 This Article 
 
Buy PURCHASE ARTICLE: $19
PDF
HTML
Buy IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ASCII Text
x 
 
C. Pornavalai, G. Chakraborty, N. Shiratori, "QoS routing algorithms for pre-computed paths," Computer Communications and Networks, International Conference on, pp. 248, Sixth International Conference on Computer Communications and Networks (ICCCN '97), 1997.
 
 
BibTex
x
 
@article{ 10.1109/ICCCN.1997.623320,
author = {C. Pornavalai and G. Chakraborty and N. Shiratori},
title = {QoS routing algorithms for pre-computed paths},
journal ={Computer Communications and Networks, International Conference on},
volume = {0},
year = {1997},
issn = {1095-2055},
pages = {248},
doi = {http://doi.ieeecomputersociety.org/10.1109/ICCCN.1997.623320},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Computer Communications and Networks, International Conference on
TI - QoS routing algorithms for pre-computed paths
SN - 1095-2055
SP
EP
A1 - C. Pornavalai,
A1 - G. Chakraborty,
A1 - N. Shiratori,
PY - 1997
KW - telecommunication network routing; pre-computed paths; QoS routing algorithms; multiple QoS constraints; NP-complete problem; QoSR/sub BF/ on-demand algorithm; flow specification parameters; bandwidth; routing table size reduction
VL - 0
JA - Computer Communications and Networks, International Conference on
ER -
 
Routing with multiple QoS constraints is known to be a NP-complete problem. In our previous work (QoSR/sub BF/ 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. QoSR/sub BF/ 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.
Index Terms:
telecommunication network routing; pre-computed paths; QoS routing algorithms; multiple QoS constraints; NP-complete problem; QoSR/sub BF/ on-demand algorithm; flow specification parameters; bandwidth; routing table size reduction
Citation:
C. Pornavalai, G. Chakraborty, N. Shiratori, "QoS routing algorithms for pre-computed paths," icccn, pp.248, Sixth International Conference on Computer Communications and Networks (ICCCN '97), 1997
Usage of this product signifies your acceptance of the Terms of Use.