Multi-constrained optimal path selection
Top Cited Papers
- 13 November 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2, 834-843
- https://doi.org/10.1109/infcom.2001.916274
Abstract
No abstract availableThis publication has 31 references indexed in Scilit:
- A randomized algorithm for finding a path subject to multiple QoS constraintsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- A delay-constrained least-cost path routing protocol and the synthesis methodPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A distributed algorithm for delay-constrained unicast routingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- QoS routing with performance-dependent costsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- An efficient algorithm for finding a path subject to two additive constraintsPublished by Association for Computing Machinery (ACM) ,2000
- Routing with end-to-end QoS guarantees in broadband networksIEEE/ACM Transactions on Networking, 1999
- An overview of quality of service routing for next-generation high-speed networks: problems and solutionsIEEE Network, 1998
- The network inhibition problemPublished by Association for Computing Machinery (ACM) ,1993
- Solvingk-shortest and constrained shortest path problems efficientlyAnnals of Operations Research, 1989
- Shortest chain subject to side constraintsNetworks, 1983