Skip to main content

A Novel TCP-Friendly Congestion Control with Virtual Reno and Slack Term

  • Conference paper
  • 391 Accesses

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

Abstract

In this paper, a novel TCP-friendly congestion control with Virtual Reno and Slack Term, VRST for short, was proposed. The design objective of VRST is to maintain a smoother sending rate and to be friendly to TCP. VRST maintains a virtual Reno to mimic the TCP Reno behavior. To avoid sawtooth-like rate variation in TCP Reno, a limit on window adaptation is imposed on VRST to prevent drastically reducing or increasing congestion window. Owing to the discrepancy in window adaptation between VRST and virtual Reno, the window compensation is provided. This mechanism first keep track of the difference in window between VRST and virtual Reno, then this difference should be compensated or paid back at some future time, so the aim of TCP-friendliness can be achieved. From the simulation results, in most situations, VRST dose get the almost same throughput with TCP and have a smaller variation in throughput.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Jacobson, V.: Congestion avoidance and control. In: Proceedings of ACM SIGCOMM 1988 (August 1988)

    Google Scholar 

  2. Tan, W.-T., Zakhor, A.: Real-time Internet video using error resilient scalable compression and TCP-friendly transport protocol. IEEE Trans. on Multimedia 1 (June 1999)

    Google Scholar 

  3. Floyd, S., Fall, K.: Promoting the Use of End-to-end Congestion Control in the Internet. IEEE/ACM Trans. Net. 7(4), 458–472 (1999)

    Article  Google Scholar 

  4. Floyd, S.: Congestion Control Principles, RFC 2914 (September 2000)

    Google Scholar 

  5. Braden, B., et al.: Recommendations on Queue Management and Congestion Avoidance in the Internet, RFC 2309 (April 1998)

    Google Scholar 

  6. Padhye, J., et al.: Modeling TCP Reno Performance: A Simple Model and Its Empirical Validation. IEEE/ACM Trans. Net. 8(2), 133–145 (2000)

    Article  Google Scholar 

  7. Yang, Y.R., Lam, S.S.: General AIMD Congestion Control. In: Proceedings of ICNP 2000, Osaka, Japan (Novomber 2000)

    Google Scholar 

  8. Bansal, D., Balakrishnan, H.: Binomial Congestion Control Algorithms. In: Proceedings of IEEE INFOCOM (April 2001)

    Google Scholar 

  9. Rhee, I., Ozdemir, V., Yi, Y.: TEAR: TCP emulation at receivers - flow control for Multimedia streaming. Tech. report, Dept. of Comp. Sci., NCSU (April 2000)

    Google Scholar 

  10. Floyd, S., et al.: Equation-based Congestion Control for Unicast Applications. In: Proceedings of ACM SIGCOMM (August 2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lai, YC., Chen, IF. (2004). A Novel TCP-Friendly Congestion Control with Virtual Reno and Slack Term. In: Kahng, HK., Goto, S. (eds) Information Networking. Networking Technologies for Broadband and Mobile Networks. ICOIN 2004. Lecture Notes in Computer Science, vol 3090. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25978-7_82

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-25978-7_82

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23034-2

  • Online ISBN: 978-3-540-25978-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics