skip to main content
article

Stability of end-to-end algorithms for joint routing and rate control

Published: 01 April 2005 Publication History
  • Get Citation Alerts
  • 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.

    References

    [1]
    M. Beckmann, C.B. McGuire and C.B. Winsten. Studies in the Economics of Transportation. Cowles Commission Monograph, Yale University Press, 1956.
    [2]
    D. Bertsekas and R. Gallager. Data Networks, 2nd edition. Prentice-Hall, New Jersey, 1992.
    [3]
    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.
    [4]
    J. Crowcroft, R. Gibbens, F. Kelly, and S. Östring. Modelling incentives for collaboration in mobile ad hoc networks. Performance Evaluation, 57:427--439, 2004.
    [5]
    C.A. Desoer and Y.T. Yang. On the generalized Nyquist stability criterion. IEEE Transactions on Automatic Control, 25:187--196, 1980.
    [6]
    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.
    [7]
    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.
    [8]
    O.L.R. Jacobs. Introduction to Control Theory. Oxford University Press, Oxford, 1993.
    [9]
    V. Jacobson. Congestion avoidance and control. Computer Communication Review 18(4): 314--329, 1988.
    [10]
    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.
    [11]
    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.
    [12]
    F. Kelly. Fairness and stability of end-to-end congestion control. European Journal of Control, 9:159--176, 2003.
    [13]
    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.
    [14]
    T. Kelly. Scalable TCP: improving performance in highspeed wide area networks. Computer Communication Review, 32(2):83--91, 2003.
    [15]
    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/
    [16]
    L. Massoulié. Stability of distributed congestion control with heterogeneous feedback delays. IEEE Transactions on Automatic Control, 47:895--902, 2002.
    [17]
    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.
    [18]
    J. Mo and J. Walrand. Fair end-to-end window-based congestion control. IEEE/ACM Transactions on Networking, 8:556--567, 2000.
    [19]
    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.
    [20]
    A. Papachristodoulou, L. Li, and J.C. Doyle. Methodological frameworks for largescale network analysis and design. Computer Communication Review, 34(3):7--20, 2004.
    [21]
    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.
    [22]
    R. Srikant. The Mathematics of Internet Congestion Control. Birkhauser, 2004.
    [23]
    G. Vinnicombe. On the stability of networks operating TCP-like congestion control. Proc. IFAC World Congress, Barcelona, Spain 2002.
    [24]
    G. Vinnicombe. Robust congestion control for the Internet. 2002.
    [25]
    T. Voice. Delay stability results for congestion control algorithms with multi-path routing. 2004. http://www.statslab.cam.ac.uk/~tdv20
    [26]
    Z. Wang and J. Crowcroft. Analysis of shortest-path routing algorithms in a dynamic network environment. Computer Communication Review, 22(2):63--71, 1992.
    [27]
    J.G. Wardrop. Some theoretical aspects of road traffic research. Proceedings of the Institution of Civil Engineers, 1:325--378, 1952.
    [28]
    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.
    [29]
    D. Zhu, M. Gritter, and D.R. Cheriton. Feedback based routing. Computer Communication Review, 33(1):71--76, 2003.

    Cited By

    View all
    • (2023)A Transmission Rate Control Method for Active Congestion Reduction Based on Network Node Bandwidth AllocationFuture Internet10.3390/fi1512038515:12(385)Online publication date: 29-Nov-2023
    • (2023)Semi-coupled Congestion Control for Multi-site Parallel DownloadingProceedings of the 14th Conference on ACM Multimedia Systems10.1145/3587819.3597030(469-473)Online publication date: 7-Jun-2023
    • (2023)Multipath Congestion Control: Measurement, Analysis, and Optimization From the Energy PerspectiveIEEE Transactions on Network Science and Engineering10.1109/TNSE.2023.3257034(1-12)Online publication date: 2023
    • Show More Cited By

    Index Terms

    1. Stability of end-to-end algorithms for joint routing and rate control

      Recommendations

      Comments

      Information & Contributors

      Information

      Published In

      cover image ACM SIGCOMM Computer Communication Review
      ACM SIGCOMM Computer Communication Review  Volume 35, Issue 2
      April 2005
      86 pages
      ISSN:0146-4833
      DOI:10.1145/1064413
      Issue’s Table of Contents

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      Published: 01 April 2005
      Published in SIGCOMM-CCR Volume 35, Issue 2

      Check for updates

      Author Tags

      1. dynamic routing
      2. internet
      3. scalable TCP

      Qualifiers

      • Article

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • Downloads (Last 12 months)40
      • Downloads (Last 6 weeks)6

      Other Metrics

      Citations

      Cited By

      View all
      • (2023)A Transmission Rate Control Method for Active Congestion Reduction Based on Network Node Bandwidth AllocationFuture Internet10.3390/fi1512038515:12(385)Online publication date: 29-Nov-2023
      • (2023)Semi-coupled Congestion Control for Multi-site Parallel DownloadingProceedings of the 14th Conference on ACM Multimedia Systems10.1145/3587819.3597030(469-473)Online publication date: 7-Jun-2023
      • (2023)Multipath Congestion Control: Measurement, Analysis, and Optimization From the Energy PerspectiveIEEE Transactions on Network Science and Engineering10.1109/TNSE.2023.3257034(1-12)Online publication date: 2023
      • (2023)Dependable Virtualized Fabric on Programmable Data PlaneIEEE/ACM Transactions on Networking10.1109/TNET.2022.322461731:4(1748-1764)Online publication date: Aug-2023
      • (2023)Optimal Hub Placement and Deadlock-Free Routing for Payment Channel Network Scalability2023 IEEE 43rd International Conference on Distributed Computing Systems (ICDCS)10.1109/ICDCS57875.2023.00087(692-702)Online publication date: Jul-2023
      • (2022)An Analysis of MPTCP Congestion ControlTelecom10.3390/telecom30400333:4(581-609)Online publication date: 19-Oct-2022
      • (2022)Performance Evaluation of MPTCP on Simultaneous Use of 5G and 4G NetworksSensors10.3390/s2219750922:19(7509)Online publication date: 3-Oct-2022
      • (2022)CMT-SCTP and MPTCP Multipath Transport Protocols: A Comprehensive ReviewElectronics10.3390/electronics1115238411:15(2384)Online publication date: 30-Jul-2022
      • (2022)Learning-Based Off-Chain Transaction Scheduling in Prioritized Payment Channel NetworksIEEE Journal on Selected Areas in Communications10.1109/JSAC.2022.321333340:12(3589-3599)Online publication date: Dec-2022
      • (2022)Multipath Congestion Control in Integrated Intelligent Network2022 7th International Conference on Intelligent Computing and Signal Processing (ICSP)10.1109/ICSP54964.2022.9778532(1116-1121)Online publication date: 15-Apr-2022
      • Show More Cited By

      View Options

      Get Access

      Login options

      View options

      PDF

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      Media

      Figures

      Other

      Tables

      Share

      Share

      Share this Publication link

      Share on social media