skip to main content
article

A new methodology for representation of TCP performance in multiconnection environments

Published:01 January 2005Publication History
Skip Abstract Section

Abstract

This paper presents a new methodology for graphical representation of TCP performance, either in simulation or real tests, for scenarios where many connections carrying different amounts of data coexist simultaneously. The methodology is based on statistical evaluation of the connections' goodput and graphical representation of the results using three plotting styles, each optimized for a different analysis. The suitability of this methodology has been proven by analysing the performance of different TCP versions and configurations in a web-browsing simulated scenario.

References

  1. K. Fall and S. Floyd, "Simulation-based comparisons of Tahoe, Reno and SACK TCP," ACM Computer Communication Review, vol. 26, no. 3, pp. 5--21, 1996.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. J. C. Hoe, "Improving the start-up behavior of a congestion control scheme for TCP," in Proceedings of the ACM SIGCOMM'96, vol. 26, no. 4, 1996, pp. 270--280.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. M. Mathis and J. Mahdavi, "Forward acknowledgement: Refining TCP congestion control," in Proceedings of the ACM SIGCOMM'96, vol. 26, no. 4, 1996, pp. 281--291.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. R. Morris, "TCP behavior with many flows," in Proceedings of IEEE International Conference on Network Protocols, 1997, pp. 205--211.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. K. Poduri and K. Nichols, "Simulation studies of increased initial TCP window size," IETF, RFC 2415, September 1998.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. E. Blanton and M. Allman, "On making tcp more robust to packet reordering," ACM Computer Communication Review, vol. 32, no. 1, January 2002.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. S. Floyd and E. Kohler, "Internet research needs better models," ACM Computer Communication Review, vol. 33, no. 1, pp. 29--34, January 2003.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. W. Willinger, V. Paxon, and M. S. Taqqu, "Self-similarity and heavy tails: Structural modeling of network traffic," in A Practical Guide to Heavy Tails: Statistical Techniques and Applications, R. Adler, R. Feldman, and M. S. Taqqu, Eds. Birkhauser, 1998, pp. 27--53.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. P. Barford, A. Bestavros, A. Bradley, and M. Crovella, "Changes in web client access patterns. characteristics and caching implications," World Wide Web. Special issue on characterization and performance evaluation, vol. 2, no. 1, pp. 15--28, January 1999.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. H. Choi and J. Limb, "A behavioral model of Web traffic," in Proceedings of 7th IEEE International Conference on Networ Protocol (ICNP'99), september, 1999.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. J. Cao, W. S. Cleveland, Y. Gao, K. Jeffay, F. D. Smith, and M. Wei, "Stochastic models for generating synthetic http source traffic," Proceedings of INFOCOM 2004, 2004.]]Google ScholarGoogle Scholar
  12. K. Farkas, P. Huang, B. Krishnamurthy, Y. Zhang, and J. Padhye, "Impact of TCP variants on http performance," in proceedings of International Workshop in High Speed Networking, may 2002.]]Google ScholarGoogle Scholar
  13. L. A. Grieco and S. Mascolo, "Performance evaluation and comparison of westwood+, new reno and vegas TCP congestion control," ACM Computer communication Review, vol. 34, no. 2, pp. 25--38, April 2004.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. A. Gurtov and S. Floyd, "Modeling wireless links for transport protocols," ACM Computer communication Review, vol. 34, no. 2, pp. 85--96, April 2004.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. M. Allman and A. Falk; "On the effective evaluation of TCP," ACM Computer Communication Review, vol. 29, no. 5, pp. 59--70, 1999.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. "MAWI working group traffic archive, wide project," 2003. {Online}. Available: http://tracer.csl.sony.co.jp/mawi/]]Google ScholarGoogle Scholar
  17. L. Guo and I. Matta, "The war between mice and elephants," in Proceedings of 9th IEEE International Conference on Network Protocols (ICNP'01), November 2001.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. A. Reyes-Lecuona, E. González-Parada, E. Casilari, J. Casasola, and A. Diaz-Estrella, "A page-oriented WWW trafic model for wireless systems simulations," in Proceedings of 16th ITC, July 1999, pp. 1271--1280.]]Google ScholarGoogle Scholar
  19. A. Feldmann, A. C. Gilbert, P. Huang, and W. willinger, "Dynamics of IP traffic: A study of the role of variability and the impact of control," Proceedings of ACM SIGCOMM'99, August 1999.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. W. Willinger and V. Paxon, "Where mathematics meets the Internet," Notices of the American Mathematical Society, vol. 45, no. 8, pp. 961--970, September 1998.]]Google ScholarGoogle Scholar
  21. B. A. Mah, "An empirical model of HTTP network traffic," in Proceedings of IEEE INFOCOM'97, April 1997, pp. 592--600.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. S. Floyd and T. Henderson, "The NewReno modification to TCP's fast recovery algorithm," IETF, RFC 2582, April 1999.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. M. Allman and S. Floyd, "Enhancing TCP loss recovery using limited transmit," IETF, RFC 3042, January 2001.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. S. Floyd, "Validation experiences with the ns simulator," in In Proceedings of the DARPA/NIST Network Simulation Validation Workshop, may 1999.]]Google ScholarGoogle Scholar
  25. V. Jacobson, "Congestion avoidance and control," ACM Computer Communication Review, vol. 18, no. 4, pp. 314--329, 1988.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. M. Allman, V. Paxson, and W. Stevens, "TCP congestion control," IETF, RFC 2581, April 1999.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. M. Mathis, J. Mahdavi, S. Floyd, and A. Romanow, "TCP selective acknowledgment options," IETF, RFC 2018, October 1996.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. M. Allman, S. Floyd, and C. Partridge, "Increasing TCP initial window," IETF, RFC 2414, September 1998.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. M. Allman, "Increasing TCP initial window," IETF, RFC 3390, October 2002.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. J. Postel, "The TCP Maximum Segment Size and related topics," IETF, RFC 879, November 1983.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  31. M. Allman, C. Hayes, and S. Ostermann, "An evaluation of tcp with larger initial windows," ACM Computer Communication Review, vol. 3, no. 28, july 1998.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  32. U. Ayesta and K. Avrachenkov, "The effect of the initial window size and limited transmit algorithm on the transient behaviour of tcp transfers," in Proceedings of The 15th ITC Specialist Seminar on Internet Traffic Engineering and Traffic Management, july 2002.]]Google ScholarGoogle Scholar
  33. J. Padhye and S. Floyd, "On inferring TCP behavior," in Proceedings of the ACM SIGCOMM'01, August 2001.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  34. V. Jacobson, C. Leres, and S. McCanne, "tcpdump, lawrence berkeley national labs, ftp://ftp.ee.lbl.gov/, 1989," 1989.]]Google ScholarGoogle Scholar
  35. S. Ostermann, "tcptrace: a tcpdump file analysis tool," 1996. {Online}. Available: http://jarok.cs.ohiou.edu/software/tcptrace/tcptrace.html]]Google ScholarGoogle Scholar

Recommendations

Comments

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Sign in

Full Access

  • Published in

    cover image ACM SIGCOMM Computer Communication Review
    ACM SIGCOMM Computer Communication Review  Volume 35, Issue 1
    January 2005
    108 pages
    ISSN:0146-4833
    DOI:10.1145/1052812
    Issue’s Table of Contents

    Copyright © 2005 Authors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    • Published: 1 January 2005

    Check for updates

    Qualifiers

    • article
  • Article Metrics

    • Downloads (Last 12 months)0
    • Downloads (Last 6 weeks)0

    Other Metrics

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader