Can shortest-path routing and TCP maximize utility
- 1 March 2004
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- A duality model of TCP and queue management algorithmsIEEE/ACM Transactions on Networking, 2003
- Congestion control for fair resource allocation in networks with multicast flowsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Stability of a class of dynamic routing protocols (IGRP)Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Optimization based rate control for multirate multicast sessionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Understanding TCP VegasJournal of the ACM, 2002
- Fair end-to-end window-based congestion controlIEEE/ACM Transactions on Networking, 2000
- Optimization flow control. I. Basic algorithm and convergenceIEEE/ACM Transactions on Networking, 1999
- Bandwidth sharing: objectives and algorithmsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1999
- Routing of multipoint connectionsIEEE Journal on Selected Areas in Communications, 1988
- Dynamic behavior of shortest path routing algorithms for communication networksIEEE Transactions on Automatic Control, 1982