A randomized algorithm for finding a path subject to multiple QoS requirements
Authors:
- Turgay KorkmazTKTurgay Korkmaz
- Marwan KrunzMKMarwan Krunz
- 1 July 2001
- journal article
- Published by Elsevier in Computer Networks
- Vol. 36 (2-3) , 251-268
Abstract
No abstract availableThis publication has 32 references indexed in Scilit:
- Finding the k shortest paths2002
- A multiple quality of service routing algorithm for PNNI2002
- QoS routing with performance-dependent costs2002
- Internet traffic engineering by optimizing OSPF weights2002
- QoS routing in networks with inaccurate information: theory and algorithmsIEEE/ACM Transactions on Networking, 1999
- Quality of service based routing1998
- A Framework for QoS-based Routing in the Internet1998
- An overview of quality of service routing for next-generation high-speed networks: problems and solutionsIEEE Network, 1998
- Modeling Internet topologyIEEE Communications Magazine, 1997
- Shortest chain subject to side constraintsNetworks, 1983