Skip to main content

Improving the Fairness and the Response Time of TCP-Vegas

  • Conference paper
  • First Online:
Information Networking: Wired Communications and Management (ICOIN 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2343))

Included in the following conference series:

Abstract

Unfairness of the Internet has galvanized numerous studies toward fair allocation of bandwidth. Study of TCP-Vegas is one of them. TCP-Vegas, although not perfect, at least enables bandwidth allocation independent of propagation delay, which is radically different behavior from that of current Internet. In the current Internet, a long-delay connection usually receives less throughput than short-delay connections. Until now, two necessary conditions have been identified to make TCP-Vegas achieve fair allocation of bandwidth: correct estimation of propagation delay and finer control of window by adopting single threshold rather than two.

In this paper, we propose three more fixes to achieve fair bandwidth allocation. First, we provide a fix for packet size independence. Second, we provide a fix regarding the reference value in the control. Third, we provide a fix for reducing both the oscillation and the convergence delay. We argue that fixes of ours and those of previous researchers constitute the necessary and sufficient condition for fair allocation of bandwidth.

This work was supported by Korea Science and Engineering Foundation under the contract number 20005-303-02-2. It was also supported by the Brain Korea 21 Project and National Research Laboratory Project of Korea.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. V. Jacobson, Congestion Avoidance and Control, Proceedings of ACM SIGCOMM’88, August 1988.

    Google Scholar 

  2. S. Keshav, A Control-Theoretic Approach to Flow Control, Proceedings of the SIGCOMM’ 91, pp. 3–15, September 1991.

    Google Scholar 

  3. Lawrence S. Brakmo and Larry L. Peterson, TCP Vegas: End to End Congestion Avoidance on a Global Internet, IEEE J. of Selected Areas in Communication, pp. 1465–1480, October 1995.

    Google Scholar 

  4. J. S. Ahn, P. B. Danzig, Z. Liu, and L. Yan, Evaluation of TCP Vegas: Emulation and Experiment, ACM SIGCOMM’ 95, Cambridge, MA, August 1995.

    Google Scholar 

  5. J. S. Ahn and P. B. Danzig, Packet Network Simulation: Speedup and Accuracy Versus Timing Granularity, IEEE Transactions on Networking, 4(5):743–757, October 1996.

    Google Scholar 

  6. J.C. Hoe, Improving the Start-up Behavior of a Congestion Control Scheme for TCP, Proceedings of ACM SIGCOMM’96, August 1996.

    Google Scholar 

  7. Y. Zhang, E. Yan, and S.K. Dao, A Measurement of TCP over Long-Delay Network, Proceedings of 6th Intl. Conf. on Telecommunication Systems, pages 498–504, March 1998.

    Google Scholar 

  8. T. Bonald, Comparison of TCP Reno and TCP Vegas via Fluid Approximation, Workshop on TCP, 1998.

    Google Scholar 

  9. Jeonghoon Mo, Richard J. La, Venkat Anantharam, and Jean Walrand, Analysis and Comparison of TCP Reno and Vegas, IEEE INFOCOM’99, pp. 1556–1563, 1999.

    Google Scholar 

  10. S. McCanne and S. Floyd, Ns(network simulator), http://www-mash.cs.berkeley.edu/ns

  11. G. Hasegawa, M. Murata, and H. Miyahara, Fairness and Stability of Congestion Control Mechanisms of TCP, IEEE Infocom 1999.

    Google Scholar 

  12. A. Aggarwal, S. Savage, and T. Anderson, Understanding the Performance of TCP Pacing, IEEE INFOCOM 2000, 2000.

    Google Scholar 

  13. C. Boutremans and J. Le Bourdec, A Note on the Fairness of TCP Vegas, International Zurich Seminar on Broadband Communications, 2000.

    Google Scholar 

  14. Jin-Ru Chen and Yaw-Chung Chen, Vegas Plus: Improving the Service Fairness, IEEE Communication Letters, Vol. 4, No. 5, May 2000.

    Google Scholar 

  15. U. Hengartner, J. Boliger, and T. Gross, TCP Vegas Revisited, IEEE INFOCOM 2000.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lee, Sh., Kim, B.G., Choi, Y. (2002). Improving the Fairness and the Response Time of TCP-Vegas. In: Chong, I. (eds) Information Networking: Wired Communications and Management. ICOIN 2002. Lecture Notes in Computer Science, vol 2343. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45803-4_40

Download citation

  • DOI: https://doi.org/10.1007/3-540-45803-4_40

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44256-1

  • Online ISBN: 978-3-540-45803-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics