Congestion-oriented shortest multipath routing
- 23 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 3, 1028-1036
- https://doi.org/10.1109/infcom.1996.493045
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Reliable and efficient hop-by-hop flow controlACM SIGCOMM Computer Communication Review, 1994
- A generalized processor sharing approach to flow control in integrated services networks: the multiple node caseIEEE/ACM Transactions on Networking, 1994
- Credit-based flow control for ATM networksPublished by Association for Computing Machinery (ACM) ,1994
- A generalized processor sharing approach to flow control in integrated services networks: the single-node caseIEEE/ACM Transactions on Networking, 1993
- Loop-free routing using diffusing computationsIEEE/ACM Transactions on Networking, 1993
- A calculus for network delay. II. Network analysisIEEE Transactions on Information Theory, 1991
- Analysis and simulation of a fair queueing algorithmPublished by Association for Computing Machinery (ACM) ,1989
- Dynamic behavior of shortest path routing algorithms for communication networksIEEE Transactions on Automatic Control, 1982