Skip to main content
SpringerLink
Log in

TCP is Competitive with Resource Augmentation

  • Published:
Theory of Computing Systems Aims and scope Submit manuscript

Abstract

The well-known Transport Control Protocol (TCP) is a crucial component of the TCP/IP architecture on which the Internet is built, and is a de facto standard for reliable communication on the Internet. At the heart of the TCP protocol is its congestion control algorithm. While most practitioners believe that the TCP congestion control algorithm performs very well, a complete analysis of the congestion control algorithm is yet to be done. A lot of effort has, therefore, gone into the evaluation of different performance metrics like throughput and average latency under TCP. In this paper, we approach the problem from a different perspective and use the competitive analysis framework to provide some answers to the question “how good is the TCP/IP congestion control algorithm?” We describe how the TCP congestion control algorithm can be viewed as an online, distributed scheduling algorithm. We observe that existing lower bounds for non-clairvoyant scheduling algorithms imply that no online, distributed, non-clairvoyant algorithm can be competitive with an optimal offline algorithm if both algorithms were given the same resources. Therefore, in order to evaluate TCP using competitive analysis, we must limit the power of the adversary, or equivalently, allow TCP to have extra resources compared to an optimal, offline algorithm for the same problem. In this paper, we show that TCP is competitive to an optimal, offline algorithm provided the former is given more resources. Specifically, we prove first that for networks with a single bottleneck (or point of congestion), TCP is \({\mathcal{O}}(1)\)-competitive to an optimal centralized (global) algorithm in minimizing the user-perceived latency or flow time of the sessions, provided we allow TCP \({\mathcal{O}}(1)\) times as much bandwidth and \({\mathcal{O}}(1)\) extra time per session. Second, we show that TCP is fair by proving that the bandwidths allocated to sessions quickly converge to fair sharing of network bandwidth.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Edmonds, J., Datta, S., Dymond, P.: TCP is competitive against a limited adversary. In: Proceedings of the Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 174–183 (2003)

  2. Thompson, K., Miller, G., Wilder, R.: Wide-area Internet traffic patterns and characteristics. IEEE Netw. 11(6), 10–23 (1997)

    Article  Google Scholar 

  3. Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)

    MATH  Google Scholar 

  4. Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)

    MATH  Google Scholar 

  5. Edmonds, J.: Scheduling in the dark. In: ACM Symposium on Theory of Computing, pp. 179–188 (1999)

  6. Kalyanasundaram, B., Pruhs, K.: Speed is as powerful as Clairvoyance. J. ACM 47(4), 617–643 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  7. Edmonds, J., Pruhs, K.: Broadcast scheduling: when fairness is fine. In: Proceedings of the Thirteenth ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 421–430 (2002)

  8. Jacobson, V.: Congestion avoidance and control. Comput. Commun. Rev. 18(4), 314–329 (1988)

    Article  Google Scholar 

  9. Stevens, W.: TCP Illustrated, vol. I. Addison-Wesley, Reading (1994)

    MATH  Google Scholar 

  10. Kurose, J., Ross, K.: Computer Networking: A Top-Down Approach Featuring the Internet. Addison-Wesley, Reading (2000)

    Google Scholar 

  11. Kelly, F., Maulloo, A., Tan, D.: Rate control in communication networks: shadow prices, proportional fairness and stability. J. Oper. Res. Soc. 49, 237–252 (1998)

    MATH  Google Scholar 

  12. Kelly, F.: Mathematical modelling of the Internet. In: Engquist, B., Schmid, W. (eds.) Mathematics Unlimited—2001 and Beyond, pp. 685–702. Springer, Berlin (2001)

    Google Scholar 

  13. Chiu, D.M., Jain, R.: Analysis of the increase and decrease algorithms for congestion avoidance in computer networks. Comput. Netw. ISDN Syst. 17(1), 1–14 (1989)

    Article  MATH  Google Scholar 

  14. Motwani, R., Phillips, S., Torng, E.: Non-clairvoyant scheduling. Theor. Comput. Sci. 130, 17–47 (1994). (Special issue on dynamic and on-line algorithms)

    Article  MATH  MathSciNet  Google Scholar 

  15. Edmonds, J.: On the competitiveness of TCP within a general network. In: Proceedings of Latin American Theoretical Informatics (LATIN), pp. 567–576 (2004)

  16. Mathis, M., Semke, J., Mahdavi, J., Ott, T.: The macroscopic behavior of the TCP congestion avoidance algorithm. Comput. Commun. Rev. 27(3), 67–82 (1997)

    Article  Google Scholar 

  17. Lakshman, T.V., Madhow, U.: The performance of networks with high bandwidth-delay products and random loss. IEEE/ACM Trans. Netw. 5(3), 336–350 (1997)

    Article  Google Scholar 

  18. Ott, T., Kemperman, J., Mathis, M.: The stationary behavior of ideal TCP congestion avoidance. ftp://ftp.bellcore.com/pub/tjo/TCPwindow.ps, August 1996

  19. Padhye, J., Firoiu, V., Towsley, D., Kurose, J.: Modeling TCP throughput: a simple model and its empirical validation. In: Proceedings of SIGCOMM, pp. 303–314 (1988)

  20. Misra, A., Ott, T.: The window distribution of idealized TCP congestion avoidance with variable packet loss. In: Proceedings of INFOCOM, pp. 1564–1572, March 1999

  21. Johari, R., Tan, D.: End-to-end congestion control for the Internet: delays and stability. IEEE/ACM Trans. Netw. 9, 818–832 (2001)

    Article  Google Scholar 

  22. Massoulie, L.: Stability of distributed congestion control with heterogeneous feedback delays. IEEE Trans. Automat. Contr. 47, 895–902 (2002)

    Article  MathSciNet  Google Scholar 

  23. Floyd, S., Jacobson, V.: Random early detection gateways for congestion avoidance. IEEE/ACM Trans. Netw. 1(4), 397–413 (1993)

    Article  Google Scholar 

  24. Dooly, D., Goldman, S., Scott, S.: On-line analysis of the TCP acknowledgment delay problem. J. ACM 48(2), 243–273 (2001)

    MathSciNet  Google Scholar 

  25. Karp, R., Koutsoupias, E., Papadimitriou, C., Shenker, S.: Optimization problems in congestion control. In: IEEE Symposium on Foundations of Computer Science, pp. 66–74 (2000)

  26. Arora, S., Brinkman, W.: An optimal online algorithm for a bandwidth utilization problem. In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 535–539 (2002)

  27. Floyd, S.: Connections with multiple congested gateways in packet-switched networks, part I: one-way traffic. Comput. Commun. Rev. 21(5), 30–47 (1991)

    Article  Google Scholar 

  28. Henderson, T., Sahouria, E., McCanne, S., Katz, R.: On improving the fairness of TCP congestion avoidance. In: Proceedings of IEEE Globecom ’98, vol. 1, pp. 539–544 (1998)

  29. Edmonds, J.: Scheduling in the dark—improved results. Manuscript, available at the author’s homepage in York University, Toronto, http://www.cse.yorku.ca/~jeff/research/schedule/arrPostJournal.pdf (2007)

  30. Parekh, A., Gallagher, R.: A generalized processor sharing approach to flow control in integrated services networks: the multiple node case. IEEE/ACM Trans. Netw. 2(2), 137–150 (1994)

    Article  Google Scholar 

  31. Phillips, C., Stein, C., Torng, E., Wein, J.: Optimal time-critical scheduling via resource augmentation. In: Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pp. 140–149, May 1997

Download references

Author information

Authors and Affiliations

  1. Computer Science and Engineering Department, York University, 4700 Keele Street, Toronto, ON, M3J 1P3, Canada

    Jeff Edmonds, Suprakash Datta & Patrick Dymond

Authors
  1. Jeff Edmonds
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Suprakash Datta
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Patrick Dymond
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Suprakash Datta.

Additional information

An extended abstract of this paper appeared in SPAA 2003 [1].

Rights and permissions

Reprints and permissions

About this article

Cite this article

Edmonds, J., Datta, S. & Dymond, P. TCP is Competitive with Resource Augmentation. Theory Comput Syst 47, 137–161 (2010). https://doi.org/10.1007/s00224-010-9249-8

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00224-010-9249-8

Keywords

Search

Navigation