Journal ArticleDOI
Stability of end-to-end algorithms for joint routing and rate control
Frank Kelly,Thomas Voice +1 more
- Vol. 35, Iss: 2, pp 5-12
TLDR
Stable, scalable load-sharing across paths, based on end-to-end measurements, can be achieved on the same rapid time- scale as rate control, namely the time-scale of round-trip times.Abstract:
Dynamic multi-path routing has the potential to improve the reliability and performance of a communication network, but carries a risk. Routing needs to respond quickly to achieve the potential benefits, but not so quickly that the network is destabilized. This paper studies how rapidly routing can respond, without compromising stability.We present a sufficient condition for the local stability of end-to-end algorithms for joint routing and rate control. The network model considered allows an arbitrary interconnection of sources and resources, and heterogeneous propagation delays. The sufficient condition we present is decentralized: the responsiveness of each route is restricted by the round-trip time of that route alone, and not by the round-trip times of other routes. Our results suggest that stable, scalable load-sharing across paths, based on end-to-end measurements, can be achieved on the same rapid time-scale as rate control, namely the time-scale of round-trip times.read more
Citations
More filters
Journal ArticleDOI
Layering as Optimization Decomposition: A Mathematical Theory of Network Architectures
TL;DR: A survey of the recent efforts towards a systematic understanding of layering as optimization decomposition can be found in this paper, where the overall communication network is modeled by a generalized network utility maximization problem, each layer corresponds to a decomposed subproblem, and the interfaces among layers are quantified as functions of the optimization variables coordinating the subproblems.
Layering as optimization decomposition: A mathematical theory of network architectures : There are various ways that network functionalities can be allocated to different layers and to different network elements, some being more desirable than others. The intellectual goal of the research surveyed by this article is to provide a theoretical foundation for these architectural decisions in networking
TL;DR: A survey of the recent efforts towards a systematic understanding of layering as optimization decomposition, where the overall communication network is modeled by a generalized network utility maximization problem, each layer corresponds to a decomposed subproblem, and the interfaces among layers are quantified as functions of the optimization variables coordinating the subproblems.
Proceedings ArticleDOI
Design, implementation and evaluation of congestion control for multipath TCP
TL;DR: It is shown that some 'obvious' solutions for multipath congestion control can be harmful, but that the proposed algorithm improves throughput and fairness compared to single-path TCP.
Journal ArticleDOI
ACM SIGCOMM computer communication review
TL;DR: The Internet is going mobile and wireless, perhaps quite soon, with a number of diverse technologies leading the charge, including, 3G cellular networks based on CDMA technology, a wide variety of what is deemed 2.5G cellular technologies (e.g., EDGE, GPRS and HDR), and IEEE 802.11 wireless local area networks (WLANs).
Coupled Congestion Control for Multipath Transport Protocols
TL;DR: A congestion control algorithm which couples the congestion control algorithms running on different subflows by linking their increase functions, and dynamically controls the overall aggresiveness of the multipath flow is presented, which is a practical algorithm that is fair to TCP at bottlenecks while moving traffic away from congested links.
References
More filters
Dynamic Source Routing in Ad Hoc Wireless Networks.
David B. Johnson,David A. Maltz +1 more
TL;DR: In this article, the authors present a protocol for routing in ad hoc networks that uses dynamic source routing, which adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods in which hosts move less frequently.
Book ChapterDOI
Dynamic Source Routing in Ad Hoc Wireless Networks
David B. Johnson,David A. Maltz +1 more
TL;DR: This paper presents a protocol for routing in ad hoc networks that uses dynamic source routing that adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods in which hosts move less frequently.
Journal ArticleDOI
Congestion avoidance and control
TL;DR: The measurements and the reports of beta testers suggest that the final product is fairly good at dealing with congested conditions on the Internet, and an algorithm recently developed by Phil Karn of Bell Communications Research is described in a soon-to-be-published RFC.
Journal ArticleDOI
Rate control for communication networks: shadow prices, proportional fairness and stability
TL;DR: This paper analyses the stability and fairness of two classes of rate control algorithm for communication networks, which provide natural generalisations to large-scale networks of simple additive increase/multiplicative decrease schemes, and are shown to be stable about a system optimum characterised by a proportional fairness criterion.