Skip to main content
SpringerLink
Log in

Equilibrium and Fairness of Networks Shared by TCP Reno and Vegas/FAST

  • Published:
Telecommunication Systems Aims and scope Submit manuscript

Abstract

It has been proved theoretically that a network with heterogeneous congestion control algorithms that react to different congestion signals can have multiple equilibrium points. In this paper, we demonstrate this experimentally using TCP Reno and Vegas/FAST. We also show that any desired inter-protocol fairness is in principle achievable by an appropriate choice of Vegas/FAST parameter, and that intra-protocol fairness among flows within each protocol is unaffected by the presence of the other protocol except for a reduction in effective link capacities. Dummynet experiments and ns-2 simulations are presented to verify these results.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. A. Akella, S. Seshan and A. Shaikh, An empirical evaluation of wide-area internet bottlenecks, In Proceedings of ACM SIGMETRICS (2003) pp. 316–317.

  2. C. Casetti, M. Gerla, S. Mascolo, M. Sansadidi and R. Wang, TCP Westwood: end to end congestion control for wired/wireless networks, Wireless Networks Journal 8 (2002) 467–479.

    Google Scholar 

  3. S. Floyd, Highspeed TCP for large congestion windows. RFC 3649, IETF Experimental. (2003) http://www.faqs.org/rfcs/rfc3649.html.

  4. L.A. Grieco and S. Mascolo, Performance evaluation and comparison of westwood+, new reno, and vegas tcp congestion control. SIGCOMM Comput. Commun. Rev. 34(2) (2004) 25–38.

    Article  Google Scholar 

  5. C. Hollot, V. Misra and W. Gong, Analysis and design of controllers for AQM routers supporting TCP flows, IEEE Transactions on Automatic Control 47(6) (2002).

  6. C. Jin, D.X. Wei, and S.H. Low, FAST TCP: motivation, architecture, algorithms, performance. in Proceedings of IEEE Infocom. (2004) http://netlab.caltech.edu.

  7. F.P. Kelly, A. Maulloo and D. Tan, Rate control for communication networks: Shadow prices, proportional fairness and stability, Journal of Operations Research Society 49(3) (1998) 237–252.

    Google Scholar 

  8. T. Kelly, Scalable TCP: Improving performance in highspeed wide area networks, ACM SIGCOMM Computer Communication Review 33(2) (2003) 83–91.

    Google Scholar 

  9. S. Kunniyur and R. Srikant, End-to-end congestion control: Utility functions, random losses and ECN marks. IEEE/ACM Transactions on Networking 11(5) (2003) 689–702.

    Article  Google Scholar 

  10. K. Kurata, G. Hasegawa and M. Murata, Fairness comparisons between TCP Reno and TCP Vegas for future deployment of TCP Vegas. In Proceedings of INET (2000).

  11. S.H. Low, A duality model of TCP and queue management algorithms, IEEE/ACM Transactions on Networking 11(4) (2003) 525–536. http://netlab.caltech.edu.

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

    Article  Google Scholar 

  13. S.H. Low, F. Paganini, J. Wang and J.C. Doyle, Linear stability of TCP/RED and a scalable control. Computer Networks Journal 43(5) (2003) 633–647. http://netlab.caltech.edu.

    Google Scholar 

  14. S.H. Low, L. Peterson and L. Wang, Understanding Vegas: A duality model. Journal of ACM 49(2) (2002) 207–235. http://netlab.caltech.edu.

    Google Scholar 

  15. L. Massoulie and J. Roberts, Bandwidth sharing: Objectives and algorithms. IEEE/ACM Transactions on Networking 10(3) (2002) 320–328.

    Article  Google Scholar 

  16. J. Mo, R. La, V. Anantharam and J. Walrand, Analysis and comparison of TCP Reno and Vegas. In Proceedings of IEEE Infocom (1999).

  17. J. Mo and J. Walrand, Fair end-to-end window-based congestion control. IEEE/ACM Transactions on Networking 8(5) (2000) 556–567.

    Article  Google Scholar 

  18. L. Rizzo, IP dummynet. http://info.iet.unipi.it/~luigi/ip_dummynet/.

  19. A. Shriram and J. Kaur, Identifying bottleneck links using distributed end-to-end available bandwidth measurements. In First ISMA Bandwidth Estimation Workshop (2003).

  20. A. Tang, J. Wang, S.H. Low and M. Chiang, Equilibrium of heterogeneous congestion control protocols. Technical Report CaltechCSTR:2005.005, Caltech (2005a).

  21. A. Tang, J. Wang, S.H. Low and M. Chiang, Network equilibrium of heterogeneous congestion control protocols. In Proceedings of IEEE Infocom Miami, FL (2005b).

  22. D.X. Wei, C. Jin, S.H. Low and S. Hedge, FAST TCP: motivation, architecture, algorithms, performance. To appear in IEEE/ACM Trans. on Networking.

  23. L. Xu, K. Harfoush and I. Rhee, Binary increase congestion control for fast long-distance networks. In Proceedings of IEEE Infocom (2004).

  24. H. Yaiche, R.R. Mazumdar and C. Rosenberg, A game theoretic framework for bandwidth allocation and pricing in broadband networks. IEEE/ACM Transactions on Networking 8(5) (2000) 667–678.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. California Institute of Technology, Pasadena, CA, 91125, USA

    Ao Tang, Jiantao Wang, Sanjay Hegde & Steven H. Low

Authors
  1. Ao Tang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jiantao Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sanjay Hegde
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Steven H. Low
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ao Tang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tang, A., Wang, J., Hegde, S. et al. Equilibrium and Fairness of Networks Shared by TCP Reno and Vegas/FAST. Telecommun Syst 30, 417–439 (2005). https://doi.org/10.1007/s11235-005-5499-1

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11235-005-5499-1

Keywords

Search

Navigation