Skip to main content
Log in

A Family of Stable Multipath Dual Congestion Control Algorithms

  • Regular Paper
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

We consider the problem of multipath congestion control in the Internet. The aim is to take advantage of multiple paths diversity to achieve efficient bandwidth allocation and improve network efficiency. But there exist some potential difficulties when one directly uses the well-known network utility maximization model to design stable multipath congestion control algorithms for the alternative paths. In this paper, we propose a generalized multipath utility maximization model to consider the problem of joint routing and rate control, which can be reduced to specific models with different parameter settings. And then we develop a family of multipath dual congestion control algorithms which are stable in the absence of delays. We also derive decentralized and scalable sufficient conditions for a particular scheme when propagation delays exist in networks. The simulation results show that the proposed multipath dual congestion control algorithms with appropriate parameter settings can achieve stable resource shares while maintaining fairness among the involved users.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. He J, Rexford J. Toward internet-wide multipath routing. IEEE Network Magazine, 2008, 22(2): 16–21.

    Article  Google Scholar 

  2. Wang Z, Crowcroft J. Analysis of shortest-path routing algorithms in a dynamic network environment. Comput. Commun. Rev., 1992, 22(2): 63–71.

    Article  Google Scholar 

  3. Han H, Shakkottai S, Hollot C V, Srikant R, Towsley D. Multipath TCP: A joint congestion control and routing scheme to exploit path diversity in the Internet. IEEE/ACM Trans. Networking, 2006, 14(6): 1260–1271.

    Article  Google Scholar 

  4. Xu W, Rexford J. MIRO: Multipath interdomain routing. In Proc. the 2006 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, Sept. 2006.

  5. Wang J, Li L, Low S H, Doyle J C. Cross-layer optimization in TCP/IP networks. IEEE/ACM Trans. Networking, 2005, 13(3): 582–595.

    Article  Google Scholar 

  6. Kelly F P, Maulloo A K, Tan D K H. Rate control for communication networks: Shadow prices, proportional fairness and stability. J. Oper. Res. Soc., 1998, 49(3): 237–252.

    Article  MATH  Google Scholar 

  7. Voice T. Stability of multipath dual congestion control algorithms. IEEE/ACM Trans. Networking, 2007, 15(6): 1231–1239.

    Article  Google Scholar 

  8. Kelly F P, Voice T. Stability of end-to-end algorithms for joint routing and rate control. Comput. Commun. Rev., 2005, 35(2): 5–12.

    Article  Google Scholar 

  9. Srikant R. The Mathematics of Internet Congestion Control. Birkh¨auser, 2004.

  10. Vinnicombe G. On the stability of networks operating TCPlike congestion control. In Proc. the 15th IFAC World Congress, July 2002, pp.368:1–368:6.

  11. Low S H, Lapsley D E. Optimization flow control, I: Basic algorithm and convergence. IEEE/ACM Trans. Networking, 1999, 7(6): 861–874.

    Article  Google Scholar 

  12. Paganini F. A global stability result in network flow control. Systems and Control Letters, 2002, 46(3): 165–172.

    Article  MathSciNet  MATH  Google Scholar 

  13. Paganini F, Wang Z, Doyle J C, Low S H. Congestion control for high performance, stability and fairness in general networks. IEEE/ACM Trans. Networking, 2005, 13(1): 43–56.

    Article  Google Scholar 

  14. Kelly F P. Fairness and stability of end-to-end congestion control. Eur. J. Contr., 2003, 9(2/3): 159–176.

    Article  MATH  Google Scholar 

  15. Paganini F, Doyle J, Low S. Scalable laws for stable network congestion control. In Proc. IEEE Conf. Decision and Control, Dec. 2001.

  16. Lin X, Shroff N B. Utility maximization for communication networks with multipath routing. IEEE/ACM Trans. Networking, 2006, 51(5): 766–781.

    MathSciNet  Google Scholar 

  17. Bertsekas D P. Nonlinear Programming (2nd edition). Belmont, Massachusetts: Athena Scientific Press, 1999.

  18. Kar K, Sarkar S, Tassiulas L. Optimization based rate control for multipath sessions. Technical Report, TR 2001–1, Institute Systems Research, Univ. Maryland, 2001.

  19. Paganini F, Mallada E. A unified approach to congestion control and node-based multipath routing. IEEE/ACM Trans. Networking, 2009, 17(5): 1413–1426.

    Article  Google Scholar 

  20. Xu, D, Chiang M, Rexford J. Link-state routing with hopby-hop forwarding can achieve optimal traffic engineering. IEEE/ACM Trans. Networking, 2011, 19(6): 1717–1730.

    Article  Google Scholar 

  21. Michael N, Tang A, Xu D. Optimal link-state hop-by-hop routing. In Proc. the 21st IEEE International Conference on Network Protocols (ICNP), Oct. 2013.

  22. Mo J, Walrand J. Fair end-to-end window-based congestion control. IEEE/ACM Trans. Networking, 2000, 8(5): 556–567.

    Article  Google Scholar 

  23. Luenberger D L. Optimization by Vector Space Methods. New York: John Wiley & Sons, 1969.

  24. Khalil H K. Nonlinear Systems (2nd edition). Englewood CliBs in New Jersey: Prentice-Hall, 1996.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hong-Ying Liu.

Additional information

This work was supported by the National Natural Science Foundation of China under Grant Nos. 61402257 and 61172060, and the National Basic Research 973 Program of China under Grant No. 2012CB315803.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Liu, Y., Liu, HY., Xu, K. et al. A Family of Stable Multipath Dual Congestion Control Algorithms. J. Comput. Sci. Technol. 30, 1274–1289 (2015). https://doi.org/10.1007/s11390-015-1598-y

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11390-015-1598-y

Keywords

Navigation