Analysis of shortest-path routing algorithms in a dynamic network environment
ACM SIGCOMM Computer Communication Review
Fair end-to-end window-based congestion control
IEEE/ACM Transactions on Networking (TON)
Optimal flow control and routing in multi-path networks
Performance Evaluation - Special issue: Internet performance and control of network systems
ACM SIGCOMM Computer Communication Review
The Mathematics of Internet Congestion Control (Systems and Control: Foundations and Applications)
The Mathematics of Internet Congestion Control (Systems and Control: Foundations and Applications)
Methodological frameworks for large-scale network analysis and design
ACM SIGCOMM Computer Communication Review
A global stability result for primal-dual congestion control algorithms with routing
ACM SIGCOMM Computer Communication Review
Congestion control for high performance, stability, and fairness in general networks
IEEE/ACM Transactions on Networking (TON)
Stability of end-to-end algorithms for joint routing and rate control
ACM SIGCOMM Computer Communication Review
Stability of multi-path dual congestion control algorithms
valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
Optimal rate allocation for energy-efficient multipath routing in wireless ad hoc networks
IEEE Transactions on Wireless Communications
Rethinking internet traffic management: from multiple decompositions to a practical protocol
CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
Stability and fairness of explicit congestion control with small buffers
ACM SIGCOMM Computer Communication Review
A unified approach to congestion control and node-based multipath routing
IEEE/ACM Transactions on Networking (TON)
Do next generation networks need path diversity?
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
User-centric network fairness through connection-level control
INFOCOM'10 Proceedings of the 29th conference on Information communications
| Hi-index | 0.00 |
This paper investigates fair, scalable, stable congestion controls which achieve high bandwidth utilization over networks operating multi-path routing. It aims to take advantage of path diversity to achieve efficient bandwidth allocation without causing instability. We develop a multi-path extension to the dual algorithm, which takes into consideration path diversity when evaluating fairness. This algorithm is shown to be globally stable in the absence of propagation delays and a sufficient condition for local stability, for the case when heterogeneous propagation delays are present, is found. The sufficient condition we present is decentralized in the following sense: the gain parameter for each dynamic variable is restricted by the average round-trip time of packets passing through the link or source it represents, but not by the round-trip times of any other packets. This leads to a highly scalable parameter choice scheme. Gain parameters are calculated from local information which is independent of the state of the algorithm, and our delay stability condition is satisfied. The models considered apply to networks consisting of arbitrary interconnections of sources and links with arbitrary heterogeneous propagation delays.