Frank Kelly
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.
- M. Beckmann, C.B. McGuire and C.B. Winsten. Studies in the Economics of Transportation. Cowles Commission Monograph, Yale University Press, 1956.Google Scholar
- D. Bertsekas and R. Gallager. Data Networks, 2nd edition. Prentice-Hall, New Jersey, 1992. Google ScholarDigital Library
- M. Chiang. Balancing transport and physical layers in wireless multihop networks: jointly optimal congestion control and power control. IEEE J. Sel. Areas Comm., 23:104--116, 2005. Google ScholarDigital Library
- J. Crowcroft, R. Gibbens, F. Kelly, and S. Östring. Modelling incentives for collaboration in mobile ad hoc networks. Performance Evaluation, 57:427--439, 2004. Google ScholarDigital Library
- C.A. Desoer and Y.T. Yang. On the generalized Nyquist stability criterion. IEEE Transactions on Automatic Control, 25:187--196, 1980.Google ScholarCross Ref
- S.J. Golestani. A Unified Theory of Flow Control and Routing in Data Communication Networks. PhD thesis, MIT, Dept. of Electrical Engineering and Computer Science, Cambridge, MA, 1980.Google Scholar
- H. Han, S. Shakkottai, C. Hollot, R. Srikant, and D. Towsley. Overlay TCP for multi-path routing and congestion control. In ENS-INRIA ARC-TCP Workshop, Paris, France, 2003.Google Scholar
- O.L.R. Jacobs. Introduction to Control Theory. Oxford University Press, Oxford, 1993.Google Scholar
- V. Jacobson. Congestion avoidance and control. Computer Communication Review 18(4): 314--329, 1988. Google ScholarDigital Library
- R. Johari and D.K.H. Tan. End-to-end congestion control for the Internet: delays and stability. IEEE/ACM Transactions on Networking, 9:818--832, 2001. Google ScholarDigital Library
- D.B. Johnson and D.A. Maltz. Dynamic source routing in ad hoc wireless networks. In T. Imielinski and H. Korth, editors, Mobile Computing, 153--181. Kluwer, 1996.Google Scholar
- F. Kelly. Fairness and stability of end-to-end congestion control. European Journal of Control, 9:159--176, 2003.Google ScholarCross Ref
- F.P. Kelly, A.K. Maulloo, and D.K.H. Tan. Rate control in communication networks: shadow prices, proportional fairness and stability. Journal of the Operational Research Society, 49:237--252, 1998.Google ScholarCross Ref
- T. Kelly. Scalable TCP: improving performance in highspeed wide area networks. Computer Communication Review, 32(2):83--91, 2003. Google ScholarDigital Library
- T. Kelly. Engineering Flow Controls for the Internet. PhD thesis, Department of Engineering, University of Cambridge, 2004. http://www-lce.eng.cam.ac.uk/~ctk21/papers/Google Scholar
- L. Massoulié. Stability of distributed congestion control with heterogeneous feedback delays. IEEE Transactions on Automatic Control, 47:895--902, 2002.Google ScholarCross Ref
- M. Mathis, J. Semke, J. Mahdavi, and T. Ott. The macroscopic behaviour of the TCP congestion avoidance algorithm. Computer Communication Review, 27:67--82, 1997. Google ScholarDigital Library
- J. Mo and J. Walrand. Fair end-to-end window-based congestion control. IEEE/ACM Transactions on Networking, 8:556--567, 2000. Google ScholarDigital Library
- F. Paganini, Z. Wang, J.C. Doyle, and S.H. Low. Congestion control for high performance, stability and fairness in general networks. IEEE/ACM Transactions on Networking, 2005. Google ScholarDigital Library
- A. Papachristodoulou, L. Li, and J.C. Doyle. Methodological frameworks for largescale network analysis and design. Computer Communication Review, 34(3):7--20, 2004. Google ScholarDigital Library
- A. Sridharan, R. Guérin, and C. Diot. Achieving near-optimal traffic engineering solutions for current OSPF/IS-IS networks. IEEE/ACM Transactions on Networking, 2005. Google ScholarDigital Library
- R. Srikant. The Mathematics of Internet Congestion Control. Birkhauser, 2004. Google ScholarDigital Library
- G. Vinnicombe. On the stability of networks operating TCP-like congestion control. Proc. IFAC World Congress, Barcelona, Spain 2002.Google ScholarCross Ref
- G. Vinnicombe. Robust congestion control for the Internet. 2002.Google Scholar
- T. Voice. Delay stability results for congestion control algorithms with multi-path routing. 2004. http://www.statslab.cam.ac.uk/~tdv20Google Scholar
- Z. Wang and J. Crowcroft. Analysis of shortest-path routing algorithms in a dynamic network environment. Computer Communication Review, 22(2):63--71, 1992. Google ScholarDigital Library
- J.G. Wardrop. Some theoretical aspects of road traffic research. Proceedings of the Institution of Civil Engineers, 1:325--378, 1952.Google ScholarCross Ref
- S. Yilmaz and I. Matta. On the scalability-performance tradeoffs in MPLS and IP routing. In Proceedings of SPIE ITCOM'2002: Scalability and Traffic Control in IP Networks, Boston, MA, 2002.Google Scholar
- D. Zhu, M. Gritter, and D.R. Cheriton. Feedback based routing. Computer Communication Review, 33(1):71--76, 2003. Google ScholarDigital Library
Index Terms
- Stability of end-to-end algorithms for joint routing and rate control
Recommendations
A Rate-Based End-to-End Multicast Congestion Control Protocol
ISCC '00: Proceedings of the Fifth IEEE Symposium on Computers and Communications (ISCC 2000)Current reliable multicast protocols do not have scalable congestion control mechanisms and this deficiency leads to concerns that multicast deployment may endanger stability of the network. In this paper, we present a sender-based approach for ...
TCP-Friendly CBR-Like Rate Control
ICNP '08: Proceedings of the 2008 IEEE International Conference on Network ProtocolsWhile the current definition of TCP friendliness has enabled a wide variety of traffic control protocols other than TCP, it still considerably restricts the design space of TCP-friendly traffic control protocols. For example, some multimedia streaming ...
Comments