skip to main content
article

End-to-end congestion control for TCP-friendly flows with variable packet size

Authors Info & Claims
Published:01 April 2004Publication History
Skip Abstract Section

Abstract

Current TCP-friendly congestion control mechanisms adjust the packet rate in order to adapt to network conditions and obtain a throughput not exceeding that of a TCP connection operating under the same conditions. In an environment where the bottleneck resource is packet processing, this is the correct behavior. However, if the bottleneck resource is bandwidth, and flows may use packets of different size, resource sharing depends on packet size and is no longer fair. For some applications, such as Internet telephony, it is more natural to adjust the packet size, while keeping the packet rate as constant as possible. In this paper we study the impact of variations in packet size on equation-based congestion control and propose methods to remove the resulting throughput bias. We investigate the design space in detail and propose a number of possible designs. We evaluate these designs through simulation and conclude with some concrete proposals. Our findings can be used to design a TCP-friendly congestion control mechanism for applications that adjust packet size rather than packet rate, or applications that are forced to use a small packet size.

References

  1. S. Floyd, M. Handley, J. Padhye, and J. Widmer, "Equation-based congestion control for unicast applications," in Proc. ACM SIGCOMM, Stockholm, Sweden, Aug. 2000, pp. 43--56.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Sandeep Sikka and George Varghese, "Memory-efficient state lookups with fast updates," in Proc. ACM SIGCOMM, Stockholm, Sweden, Aug. 2000.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Pankaj Gupta, Algorithms for Routing Lookups and Packet Classification, Ph.D. thesis, Stanford University, Dec. 2000.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. K. Papagiannaki, S. Moon, C. Fraleigh, P. Thiran, F. Tobagi, and C. Diot, "Analysis of measured single-hop delay from an operational backbone network," in Proc. IEEE Infocom, New York, June 2002.]]Google ScholarGoogle ScholarCross RefCross Ref
  5. J-C. Bolot, S. Fosse Parisis, and D. Towsley, "Adaptive FEC-based error control for internet telephony," in Proc. IEEE Infocom, Mar. 1999.]]Google ScholarGoogle ScholarCross RefCross Ref
  6. J-C. Bolot and A. Vega Garcia, "Control mechanisms for packet audio in the internet," in Proc. IEEE Infocom, Mar. 1996.]]Google ScholarGoogle Scholar
  7. Sally Floyd and Kevin Fall, "Promoting the use of end-to-end congestion control in the Internet," IEEE/ACM Transactions on Networking, vol. 7, no. 4, pp. 458--472, Aug. 1999.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. S. Floyd and V. Jacobson, "Random early detection gateways for congestion avoidance," IEEE/ACM Transactions on Networking, vol. 1, no. 4, pp. 397--413, Aug. 1993.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. J. C. Mogul and S. E. Deering, "Path MTU discovery," RFC 1191, Internet Engineering Task Force, Nov. 1990.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Colleen Shannon, David Moore, and K. Claffy, "Characteristics of fragmented IP traffic on internet links," in Proc. First ACM SIGCOMM Workshop on Internet Measurement, San Francisco, CA, Nov. 2001.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Mark Handley, Jitendra Padhye, Sally Floyd, and Jörg Widmer, "TCP friendly rate control (TFRC): Protocol specification," RFC 3448, Jan. 2003.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. J. Widmer and M. Handley, "Extending equation-based congestion control to multicast applications," in Proc. ACM SIGCOMM, San Diego, CA, Aug. 2001, pp. 275--286.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Jitendra Padhye, Victor Firoiu, Donald F. Towsley, and James F. Kurose, "Modeling TCP Reno performance: a simple model and its empirical validation," IEEE/ACM Transactions on Networking, vol. 8, no. 2, pp. 133--145, Apr. 2000.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. S. Ramesh and I. Rhee, "Issues in TCP model-based flow control," Tech. Rep. TR-99-15, Department of Computer Science, NCSU, 1999.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. J. Widmer, C. Boutremans, and J. Y. Le Boudec, "End-to-end congestion control for flows with variable packet size," Tech. Rep. EPFL-DI-ICA SSC/2002/82, EPFL, Switzerland, December 2002.]]Google ScholarGoogle Scholar
  16. M. Vojnovic and J. Y. Le Boudec, "On the long-run behavior of equation-based rate control," in Proc. ACM SIGCOMM, Pittsburgh, Aug. 2002.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Lee Breslau, Deborah Estrin, Kevin Fall, Sally Floyd, John Heidemann, Ahmed Helmy, Polly Huang, Steven McCanne, Kannan Varadhan, Ya Xu, and Haobo Yu, "Advances in network simulation," IEEE Computer, vol. 33, no. 5, pp. 59--67, May 2000.]] Google ScholarGoogle ScholarDigital LibraryDigital Library

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 34, Issue 2
    April 2004
    151 pages
    ISSN:0146-4833
    DOI:10.1145/997150
    Issue’s Table of Contents

    Copyright © 2004 Authors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    • Published: 1 April 2004

    Check for updates

    Qualifiers

    • article

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader