Skip to main content

An Analytical Comparison of the Slow-but-Steady and Impatient Variants of TCP New Reno

  • Conference paper
Book cover Wired/Wireless Internet Communications (WWIC 2007)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 4517))

Included in the following conference series:

Abstract

Current standard defines two variants of TCP NewReno: the Slow-but-Steady and Impatient. While the behavior of various TCP implementations has been extensively studied over the last years, little attention has been paid to performance analysis of different variants of TCP NewReno. In this paper, we first develop an analytical model of the Impatient variant, which being combined with the earlier proposed model of the Slow-but-Steady variant gives a comprehensive analytical model of TCP NewReno throughput. We then make an analytical comparison of the Impatient and Slow-but-Steady throughputs in the presence of correlated losses. We show that, although neither of the two variants is optimal, the Impatient variant provides the same throughput as the Slow-but-Steady one in a wide range of network conditions and significantly outperforms it in case of large windows and multiple packet drops. This could be of special interest for networks with large bandwidth and long delay.

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. Medina, A., Allman, M., Floyd, S.: Measuring the Evolution of Transport Protocol in the Internet. In: ACM SIGCOMM, pp. 336–341 (2004)

    Google Scholar 

  2. Stevens, W.: TCP Slow Start, Congestion Avoidance, Fast Retransmit, and Fast Recovery Algorithms. RFC 2001 (1997)

    Google Scholar 

  3. Allman, M., Paxson, V., Stevens, W.: TCP Congestion Control. RFC 2581 (1999)

    Google Scholar 

  4. Floyd, S., Henderson, T., Gurtov, A.: The NewReno Modification to TCP’s Fast Recovery Algorithm. RFC 3782 (2004)

    Google Scholar 

  5. Khalifa, I., Trajkocic, L.: An Overview and Comparison of Analytical TCP Models. In: IEEE ISCAS, vol. 5, pp. 469–472 (2004)

    Google Scholar 

  6. Olsen, J.: Stochastic Modeling and Simulation of the TCP Protocol. Ph.D. Thesis, Uppsala University, Sweden (2003)

    Google Scholar 

  7. Parvez, N., Mahanti, A., Williamson, C.: TCP NewReno: Slow-but-Steady or Impatient? In: IEEE ICC (2006)

    Google Scholar 

  8. Dunaytsev, R., Koucheryavy, Y., Harju, J.: TCP NewReno Throughput in the Presence of Correlated Losses: The Slow-but-Steady Variant. In: IEEE INFOCOM Global Internet Workshop, pp. 115–120 (2006)

    Google Scholar 

  9. Loguinov, D.: Adaptive Scalable Internet Streaming. Ph.D. Thesis, The City University of New York, USA (2002)

    Google Scholar 

  10. Brandauer, C., Iannaccone, G., Diot, C., Ziegler, T., Fdida, S., May, M.: Comparison of Tail Drop and Active Queue Management Performance for Bulk-Data and Web-Like Internet Traffic. In: ISCC, pp. 1–22 (2001)

    Google Scholar 

  11. Padhye, J., Firoiu, V., Towsley, D., Kurose, J.: Modeling TCP Reno Performance: A Simple Model and Its Empirical Validation. IEEE/ACM Transactions on Networking 8(2), 133–145 (2000)

    Article  Google Scholar 

  12. Braden, R. (ed.): Requirements for Internet Hosts. RFC 1122 (1989)

    Google Scholar 

  13. Postel, J. (ed.): Transmission Control Protocol. RFC 793 (1981)

    Google Scholar 

  14. Jacobson, V., Braden, R., Borman, D.: TCP Extensions for High Performance. RFC 1323 (1992)

    Google Scholar 

  15. Weigle, E., Feng, W.-C.: A Comparison of TCP Automatic Tuning Techniques for Distributed Computing. In: IEEE HPDC, pp. 265–272 (2002)

    Google Scholar 

  16. Online article: TCP Window Scaling and Broken Routers, http://lwn.net/Articles/92727/

  17. Grossman, R., Gu, Y., Hanley, D., Hong, X., Krishnaswamy, P.: Experimental Studies of Data Transport and Data Access of Earth Science Data over Networks with High Bandwidth Delay Products. Computer Networks 46, 411–421 (2004)

    Article  Google Scholar 

  18. Handley, M., Floyd, S., Padhye, J., Widmer, J.: TCP Friendly Rate Control (TFRC): Protocol Specification. RFC 3448 (2003)

    Google Scholar 

  19. MacDonald, D., Barkley, W.: Microsoft Windows 2000 TCP/IP Implementation Details. Microsoft white paper (2000)

    Google Scholar 

  20. Paxson, V., Allman, M.: Computing TCP’s Retransmission Timer. RFC 2988 (2000)

    Google Scholar 

  21. Sarolahti, P., Kuznetsov, A.: Congestion Control in Linux TCP. In: USENIX/FREENIX Track, pp. 49–62 (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Fernando Boavida Edmundo Monteiro Saverio Mascolo Yevgeni Koucheryavy

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this paper

Cite this paper

Dunaytsev, R., Avrachenkov, K., Koucheryavy, Y., Harju, J. (2007). An Analytical Comparison of the Slow-but-Steady and Impatient Variants of TCP New Reno. In: Boavida, F., Monteiro, E., Mascolo, S., Koucheryavy, Y. (eds) Wired/Wireless Internet Communications. WWIC 2007. Lecture Notes in Computer Science, vol 4517. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72697-5_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-72697-5_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-72694-4

  • Online ISBN: 978-3-540-72697-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics