Selfish behavior and stability of the internet: A game-theoretic analysis of TCP

Computer Communication Review

Volumn 32, Issue 4, 2002, Pages 117-130

  Akella, Aditya ^a   Seshan, Srinivasan ^a   Karp, Richard ^b   Shenker, Scott ^b   Papadimitriou, Christos ^b  

^a CMU ^*

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Design; Performance

Indexed keywords

GAME-THEORETIC ANALYSIS; NASH EQUILIBRIUM; PACKET SCHEDULING TECHNIQUES;

CONGESTION CONTROL (COMMUNICATION); GAME THEORY; LOGIC DESIGN; PACKET NETWORKS; PERFORMANCE; QUEUEING NETWORKS; USER INTERFACES; VIRTUAL REALITY;

INTERNET;

EID: 18144409187     PISSN: 01464833     EISSN: 01464833     Source Type: Conference Proceeding    
DOI: 10.1145/964725.633037     Document Type: Conference Paper

References (24)

1. The network simulator - ns-2. http://isi.edu/nsnam/ns/.
2. A. Akella, S. Seshan, S. Shenker, and I. Stoica. Exploring congestion control. Technical Report CMU-CS-02-139, CMU, Pittsburgh, Pennsylvania, May 2002.
3. M. Allman, V. Paxson, and W. Stevens. TCP congestion control. Internet Draft, Internet Engineering Task Force, Feb. 1999. Work in progress.
4. Z. Bar-Yossef. Private Communication, May 2002.
5. Z. Bar-Yossef. The complexity of massive data set computations. PhD Dissertation, U. C. Berkeley, May 2002.
6. D. Chiu and R. Jain. Analysis of the increase/decrease algorithms for congestion avoidance in computer networks. Computer Networks and ISDN Systems, 17(1):1-14, June 1989.
7. A. Demers, S. Keshav, and S. Shenker. Analysis and simulation of a fair queueing algorithm. In SIGCOMM Symposium on Communications Architectures and Protocols, pages 1-12, Austin, Texas, Sept. 1989. ACM.
8. also in Computer Communications Review, 19 (4), Sept. 1989.
9. C. Douligeris and R. mazumdar. On pareto optimal flow control in a multicalss environment. In The 25th Allerton Conference of Communication, Control and Computing, University of Illinois at Urbana-Champaign, Oct. 1987.
10. C. Douligeris and R. Mazumdar. A game-theoretic approach to flow conrtol in an integrated environment. Journal of the Franklin Institute, 329(3):383-402, Mar. 1992.
11. K. Fall and S. Floyd. Simulation-based comparisons of tahoe, reno, and SACK TCP. ACM Computer Communication Review, 26(3):5-21, July 1996.
12. D. Ferguson, C. Nikolaou, and Y. Yemini. An economy for flow control in computer networks. In Proceedings of the Conference on Computer Communications (IEEE Infocom), 1989.
13. S. Floyd. Questions about sack deployment. http://www.icir.org/floyd/sack-questions.html.
14. S. Floyd and V. Jacobson. Random early detection gateways for congestion avoidance. IEEE/ACM Transactions on Networking, 1(4):397-413, Aug. 1993.
15. M.-T. Hsiao and A. Lazar. A game-theoretic approach to decentralized flow control of markovian queue networks. In Performance, Holland, 1987.
16. V. Jacobson. Congestion avoidance and control. ACM Computer Communication Review, 18(4):314-329, Aug. 1988. Proceedings of the Sigcomm '88 Symposium in Stanford, CA, August, 1988.
17. R. Karp, E. Koutsoupias, C. Papadimitriou, and S. Shenker. Combinatorial optimization in congestion control. In Proceedings of the 41th Annual Symposium on Foundations of Computer Science, pages 66-74, Redondo Beach, CA, 12-14 Nov. 2000.
18. D. Lin and R. Morris. Dynamics of random early dectection. ACM Computer Communication Review, 27(4): 127-136, Oct. 1997. ACM SIGCOMM'97, Sept. 1997.
19. R. Mahajan and S. Floyd. Controlling high-bandwidth flows at the congested router. In Proc. of ICNP'01, Riverside, California, USA, Nov. 2001.
20. J. Padhye, V. Firoiu, D. F. Towsley, and J. F. Kurose. Modeling TCP reno performance: a simple model and its empirical validation. IEEE/ACM Transactions on Networking, 8(2):133-145, Apr. 2000.
21. R. Pan, L. Breslau, B. Prabhakar, and S. Shenker. Approximate fairness through differential dropping (one page summary). ACM Computer Communication Review, Jan. 2002.
22. R. Pan, B. Prabhakar, and K. Psounis. CHOKE, a stateless active queue management scheme for approximating fair bandwidth allocation. In Proceedings of the Conference on Computer Communications (IEEE Infocom), Mar. 2000.
23. S. Shenker. Making greed work in networks: A game-theoretic analysis of switch service disciplines. IEEE/ACM Transactions on Networking, 3, 1995.
24. Y. R. Yang and S. S. Lam. General AIMD congestion control. Technical Report UTCS TR-2000-09, University of Texas, Austin, Texas, May 2000.