A randomized algorithm for finding a path subject to multiple QoS constraints
- 22 January 2003
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 3, 1694-1698
- https://doi.org/10.1109/glocom.1999.832452
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- QoS based routing in networks with inaccurate information: theory and algorithmsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- QoS based routing algorithm in integrated services packet networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Bandwidth-delay based routing algorithmsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- An overview of quality of service routing for next-generation high-speed networks: problems and solutionsIEEE Network, 1998
- Quality-of-Service Routing for Traffic with Performance GuaranteesPublished by Springer Nature ,1997
- Quality-of-service routing for supporting multimedia applicationsIEEE Journal on Selected Areas in Communications, 1996
- QoS-based routing of multimedia streams in computer networksIEEE Journal on Selected Areas in Communications, 1996
- Randomized AlgorithmsPublished by Cambridge University Press (CUP) ,1995
- Randomized algorithms in combinatorial optimizationPublished by American Mathematical Society (AMS) ,1995
- Routing subject to quality of service constraints in integrated communication networksIEEE Network, 1995