Skip to main content

Bandwidth Estimates in the TCP Congestion Control Scheme

  • Conference paper
  • First Online:
Evolutionary Trends of the Internet (IWDC 2001)

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

Included in the following conference series:

Abstract

Many bandwidth estimation techniques, somehow related to the TCP world, have been proposed in the literature and adopted to solve several problems. In this paper we discuss their impact on the congestion control of TCP and we propose an algorithm which performs an explicit and effective estimate of the used bandwidth. We show by simulation that it efficiently copes with the packet clustering and ACK compression effects without leading to the biased estimate problem of existing algorithms.We present numerical results proving that TCP sources implementing the proposed scheme with an unbiased used-bandwidth estimate fairly share the bottleneck bandwidth with classical TCP Reno sources. Finally, we point out the benefits of using the proposed scheme compared to TCP Reno in networks with wireless links.

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 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. V. Paxson. End-to-End Internet Packet Dynamics. IEEE/ACM Transactions on Networking, 7(3):272–292, 1997.

    Google Scholar 

  2. M. Allman and V. Paxson. On Estimating End-to-End Network Path Properties. In Proceedings of ACM SIGCOMM’99, 1999.

    Google Scholar 

  3. S. Floyd, M. Mathis, J. Mahdavi, and A. Romanow. TCP Selective Acknowledgement Option. RFC 2018, April 1996.

    Google Scholar 

  4. S. Floyd and T.R. Henderson. The NewReno Modifications to TCP’s Fast Recovery Algorithm. IETF RFC 2582, 26(4), April 1999.

    Google Scholar 

  5. D. Chiu and R. Jain. Analysis of the Increase and Decrease Algorithms for Congestion Avoidance In Computer Networks. Computer Networks and ISDN Systems, 17:1–14, 1989.

    Article  MATH  Google Scholar 

  6. I. Stoica, S. Shenker, and H. Zhang. Core-Stateless Fair Queueing: Achieving Approximately Fair Bandwidth Allocations in High Speed Networks. In Proceedings of ACM SIGCOMM’98, Vancouver, Canada, September 1998.

    Google Scholar 

  7. J.C. Hoe. Improving the Start-up Behavior of a Congestion Control Scheme for TCP. ACM SIGCOMM Computer Communications Review, 26(4):270–280, October 1996.

    Article  Google Scholar 

  8. S. Keshav. A control-theoretic approach to flow control. In Proceedings of ACM SIGCOMM’91, pages 3–15, September 1991.

    Google Scholar 

  9. L.S. Brakmo and L.L. Peterson. TCP Vegas: End-to-End Congestion Avoidance on a Global Internet. IEEE Journal on Selected Areas in Communications, 13(8):1465–1480, October 1995.

    Article  Google Scholar 

  10. C. Casetti, M. Gerla, S.S. Lee, S. Mascolo, and M. Sanadidi. TCP with Faster Recovery. In Proceedings of Milcom 2000.

    Google Scholar 

  11. S. Mascolo, C. Casetti, M. Gerla, S.S. Lee, and M. Sanadidi. TCP Westwood: congestion control with faster recovery. Technical report, UCLA CS Technical Report #200017, 2000.

    Google Scholar 

  12. Sally Floyd and Kevin Fall. Promoting the Use of End-to-End Congestion Control in the Internet. IEEE/ACM Transactions on Networking, 7(4):458–472, Aug.1999.

    Article  Google Scholar 

  13. L. Zhang, S. Shenker, and D. Clark. Observations on the Dynamics of a Congestion Control Algorithm: The Effects of Two-Way Traffic. In Proceedings of SIGCOMM’91 Symposium on Communications Architectures and Protocols, pages pages 133–147, Zurich,September,1991.

    Google Scholar 

  14. J. Mo, V. Anantharam, R.J. La, and J. Walrand. Analysis and Comparison of TCP Reno and Vegas. In Proceedings of ACM GLOBECOMM’99, 1999.

    Google Scholar 

  15. S. Floyd and V. Jacobson. Random early detection gateways for congestion avoidance. IEEE/ACM Transactions on Networking, 1(4):397–413, August 1993.

    Article  Google Scholar 

  16. Go Hasegawa, M. Murata, and H. Miyahara. Fairness and Stability of Congestion Control Mechanisms of TCP. In Proceedings of INFOCOM’99, 1999.

    Google Scholar 

  17. J.C. Mogul. Observing TCP Dynamics in Real Networks. In Proceedings of ACM SIGCOMM’92Symp osium on Communications Architectures and Protocols, pages 305–317.

    Google Scholar 

  18. S. Floyd and V. Jacobson. On Traffic Phase Effects in Packet-Switched Gateways. Internetworking:Research and Experience, 3(3):115–156, September 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Capone, A., Martignon, F. (2001). Bandwidth Estimates in the TCP Congestion Control Scheme. In: Palazzo, S. (eds) Evolutionary Trends of the Internet. IWDC 2001. Lecture Notes in Computer Science, vol 2170. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45400-4_39

Download citation

  • DOI: https://doi.org/10.1007/3-540-45400-4_39

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics