Thomas Voice
ABSTRACT
This paper investigates fair, scalable, stable congestion controls which achieve high bandwidth utilisation over networks of operating multi-path routing. The aim is to take advantage of path diversity to achieve efficient bandwidth allocation without causing instability. Two multi-path extensions to the class of dual algorithms are considered. The first is a natural extension previously proposed in the literature, which we show to be similar to a continuous time sub-gradient method for solving a network-wide optimisation problem. We establish that the continuous time fluid model possesses a weak stability property. This analysis assumes the absence of propagation delays. We then show that when propagation delays are present, even the weak stability property disappearsWe develop an alternative multi-path extension of the dual algorithm, which considers 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, when heterogeneous propagation delays are present, is found. The sufficient condition we present is decentralised 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. The delay stability analysis is an extension of results for single-path congestion control. It is obtained by treating possible routes that belong to a given origin-destination pair as behaving as separate sources which pass through a virtual link located at the origin.The models considered apply to networks consisting of arbitrary interconnections of sources and links, with arbitrary, heterogeneous propagation delays.
- K. Arrow, L. Hurwicz, and U. Hirofumi. Studies in Linear and Non-Linear Programming. Stanford University Press, Stanford, California, 1958.Google Scholar
- F. Baccelli, D. McDonald, and J. Reynier. A mean-field model for multiple TCP connections through a buffer implementing RED. In Proceedings of IFIP Performance 2002, Rome, Italy, 2002.Google ScholarDigital Library
- F. Ceragioli. Discontinuous Ordinary Differential Equations and Stabilization. Ph.D. thesis, University di Firenze, 2000.Google Scholar
- L. Chen, S. Low, M. Chiang, and J. Doyle. Optimal cross-layer congestion control, routing and scheduling design in ad hoc wireless networks, 2006. In preparation for journal submission. Available online at: http://www.princeton.edu/~chiangm/tcprouteschedule.pdf.Google Scholar
- J. Crowcroft, R. Gibbens, F. Kelly, and S. Ostring. Modelling incentives for collaboration in mobile ad hoc networks. In Proceedings of WiOpt'03, 2003.Google Scholar
- J. C. G. Lee. A survey of multipath routing for traffic engineering, 2002. Available online at: http://vega.icu.ac.kr/~gmlee/research/.Google Scholar
- H. Han, S. Shakkottai, C. Hollot, R. Srikant, and D. Towsley. Overlay TCP for multi-path routing and congestion control. In Proceedings of ENS-INRIA ARC-TCP Workshop, Paris, France, 2003.Google Scholar
- D. B. Johnson and D. A. Maltz. Dynamic source routing in ad hoc wireless networks. In Mobile Computing, pages 153--181. Kluwer, 1996.Google ScholarCross Ref
- K. Kar, S. Sarkar, and L. Tassiulas. 'optimization based rate control for multipath sessions. Technical report no. 2001-1, Institute for Systems Research, University of Maryland, 2001.Google Scholar
- F. Kelly, A. Maulloo, and D. 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
- F. P. Kelly. Fairness and stability of end-to-end congestion control. European Journal of Control, 9:159--176, 2003.Google ScholarCross Ref
- F. P. Kelly and T. Voice. Stability of end-to-end algorithms for joint routing and rate control. Computer Communication Review, 35(2):5--12, 2004. Google ScholarDigital Library
- X. Lin and N. B. Shroff. Utility maximization for communication networks with multi-path routing. To be published in IEEE/ACM Transactions on Automatic Control, 2004. Available online at: http://min.ecn.purdue.edu/~linx/paper/tac04.pdf.Google Scholar
- S. H. Low. Optimization flow control with on-line measurement or multiple paths. In Proceedings of 16th International Teletraffic Congress, 1999.Google Scholar
- J. Mo and J. Walrand. Fair end-to-end window-based congestion control. IEEE/ACM Transactions on Networking, 8(5):556--567, 2000. Google ScholarDigital Library
- F. Paganini, J. Doyle, and S. Low. Scalable laws for stable network congestion control. In Proceedings of IEEE Conference on Decision and Control, 2001. Available online at: http://www.ee.ucla.edu/~paganini.Google ScholarCross Ref
- 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, 13(1):43--56, 2005. Google ScholarDigital Library
- A. Papachristodoulou, L. Li, and J. Doyle. Methodological frameworks for largescale network analysis and design. Computer Communication Review, 34(3):7--20, 2004. Google ScholarDigital Library
- G. Raina, D. Wischik, and D. Towsley. Control theory for buffer sizing. Computer Communication Review, 35(3):79--82, 2005. Google ScholarDigital Library
- S. Shakkottai and R. Srikant. Mean FDE models for internet congestion control under a many-flows regime. IEEE Transactions on Information Theory, 50(6):1050--1072, 2004. Google ScholarDigital Library
- R. Srikant. The Mathematics of Internet Congestion Control. Birkhauser, 2004. Google ScholarDigital Library
- V. Srinivasan, C. Chiasserini, P. Nuggehalli, and R. Rao. Optimal rate allocation for energy-efficient multipath routing in wireless ad hoc networks. IEEE Transactions on Wireless Communications, 3(3):891--899, 2005. Google ScholarDigital Library
- P. Tinnakornsrisuphap and A. Makowaki. Limit behaviours of ECN/RED gateways under a large number of TCP flows. In Proceedings of IEEE INFOCOM, pages 873--883, 2003.Google Scholar
- G. Vinnicombe. On the stability of end-to-end congestion control for the internet. Tech. rep. cued/f-infeng/tr.398, Cambridge University, 2000.Google Scholar
- G. Vinnicombe. On the stability of networks operating TCP-like congestion control. In Proceedings of IFAC, 2002.Google ScholarCross Ref
- T. Voice. Delay stability results for congestion control algorithms with multi-path routing, 2004. Available online at: http://www.statslab.cam.ac.uk/~tdv20.Google Scholar
- T. Voice. A global stability result for primal-dual congestion control algorithms with routing. Computer Communication Review, 34(3):35--41, 2004. Google ScholarDigital Library
- T. Voice. Convex function sub-gradients as discontinuous controls, 2005. Available online at: http://www.statslab.cam.ac.uk/~tdv20.Google Scholar
- T. Voice. Stability of multi-path dual congestion control algorithms, 2006. Available online at: http://www.statslab.cam.ac.uk/~tdv20.Google Scholar
- J. Wang, L. Li, S. H. Low, and J. C. Doyle. Cross-layer optimization in TCP/IP networks. IEEE/ACM Transactions on Networking, 13(3):582--568, 2005. Google ScholarDigital Library
- W. H. Wang, M. Palaniswami, and S. H. Low. Optimal flow control and routing in multi-path networks. Performance Evaluation, 52:119--132, 2003. Google ScholarDigital Library
- 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
- 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 multi-path dual congestion control algorithms
Recommendations
Stability of multi-path dual congestion control algorithms
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 ...
Comparative performance analysis of TCP-based congestion control algorithms
Congestion control is a challenging problem for us. We tried to analyse the end-to-end congestion control algorithms, i.e., TCP Tahoe, TCP Reno, TCP Newreno, TCP Veno, etc. In the literature, TCP implements a window-based flow control mechanism which ...
Modeling Multi-path TCP Throughput with Coupled Congestion Control and Flow Control
MSWiM '15: Proceedings of the 18th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile SystemsMulti-Path Transmission Control Protocol (MPTCP) is emerging as a dominant paradigm that enables users to utilize multiple Network Interface Controllers (NICs) simultaneously. Due to the complexity of its protocol design, the steady-state performance of ...
Comments