Oblivious AQM and Nash equilibria

Proceedings - IEEE INFOCOM

Volumn 1, Issue , 2003, Pages 106-113

  Dutta, Debojyoti ^a   Goel, Ashish ^b   Heidemann, John ^a  

^a UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

^b Univ of Southern California ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INTERNET; PACKET NETWORKS; PROBABILITY; PUBLIC POLICY; TELECOMMUNICATION TRAFFIC; BEHAVIORAL RESEARCH; CONGESTION CONTROL (COMMUNICATION); DROPS; GAME THEORY; NETWORK PERFORMANCE; QUEUEING NETWORKS;

ACTIVE QUEUE MANAGEMENT (AQM);

CONGESTION CONTROL (COMMUNICATION); TELECOMMUNICATION NETWORKS;

ACTIVE QUEUE MANAGEMENT SCHEMES; AVERAGE RATE; DROP PROBABILITY; GOOD PUT; HIGHLY SENSITIVE; NASH EQUILIBRIA; NASH EQUILIBRIUM; NASH EQUILIBRIUM STATE; NON-COOPERATIVE; SELFISH AGENTS; SELFISH USERS; TRAFFIC SOURCES; USER BEHAVIORS;

EID: 0042475220     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (27)

1. A. Akella, R. Karp, C. Papadimitrou, S. Seshan, and S. Shenker, "Selfish behavior and stability of the Internet: A game-theoretic analysis of TCP," ACM SIGCOMM, 2002.
2. A. Demers, S. Keshav, and S.J. Shenker, "Analysis and simulation of a fair queueing algorithm," ACM SIGCOMM, 1989.
3. C. Douligeris and R. Mazumdar, "On Pareto optimal flow control in an integrated environment," Proc. of the 25th Allerton Conference on Communication, Control and Computing, Oct 1987.
4. D. Dutta, A. Goel, and J. Heidemann, "Faster network simulation with scenario pre-filtering," Tech. Rep., USC/ISI Tech Report 550, November 2001.
5. J. Feigenbaum, C. H. Papadimitriou, and S. Shenker, "Sharing the cost of multicast transmissions," Journal of Computer and System Sciences, vol. 63, no. 1, pp. 21-41, 2001.
6. D. Ferguson, C. Nikolaou, J. Sairamesh, and Y. Yemini, "Economic models for allocating resources in computer systems," In Scott Clearwater, editor, Market-Based Control: A Paradigm for Distributed Resource Allocation, Scott Clearwater. World Scientific, Hong Kong, 1996., 1996.
7. S. Floyd and K. 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, 1999.
8. S. Floyd and V. Jacobson, "Random early detection gateways for congestion avoidance.," IEEE/ACM Transactions on Networking, V.I N.4, 1993.
9. R. Gibbens and F. Kelly, "Resource pricing and the evolution of congestion control," 1998. Automatica, vol. 35, 12, pp. 1969-1985, 1999.
10. R.J. Gibbens, S.K. Sargood, C. Van Eijl, F.P. Kelly, H. Azmoodeh, R.N. Macfadyen, and N.W. Macfadyen, "Fixed-point models for the end-to-end performance analysis of IP networks," in Proceedings of the 13th ITC Specialist Seminar: IP Traffic Measurement, Modeling and Management, Sept 2000, Monterey, California, 2000.
11. V. Jacobson, "Congestion avoidance and control," ACM Computer Communication Review; Proceedings of the Sigcomm '88 Symposium in Stanford, CA, August, 1988, vol. 18, 4, pp. 314-329, 1988.
12. K. Jain and V. V. Vazirani, "Applications of approximation algorithms to cooperative games," in ACM Symposium on Theory of Computing, 2001, pp. 364-372.
13. F. Kelly, A. Maulloo, and D. Tan, "Rate control in communication networks: shadow prices, proportional fairness and stability," in Journal of the Operational Research Society, 1998, vol. 49.
14. L. Kleinrock, Queueing Theory Volume 1, Wiley, 1967.
15. Y. A. Korilis and A. A. Lazar, "On the existence of equilibria in noncooperative optimal flow control," Journal of the ACM, vol. 42, no. 3, pp. 584-613, 1995.
16. Y. A. Korilis, A. A. Lazar, and A. Orda, "Architecting noncooperative networks," IEEE Journal of Selected Areas in Communications, vol. 13, no. 7, pp. 1241-1251, 1995.
17. E. Koutsoupias and C. Papadimitriou, "Worst-case equilibria," Lecture Notes in Computer Science, vol. 1563, pp. 404-413, 1999.
18. M. J. Osborne and A. Rubenstein, A Course in Came Theory, The MIT Press, Cambridge, Massachusetts, 1994.
19. J. Padhye, V. Firoiu, D. Towsley, and J. Krusoe, "Modeling TCP throughput: A simple model and its empirical validation," in ACM SIGCOMM '98, Vancouver, CA, 1998, pp. 303-314.
20. R. Pan, B. Prabhakar, and K. Psounis, ""CHOKe - A stateless queue management scheme for approximating fair bandwidth allocation", " in INFOCOM, 2000.
21. C. H. Papadimitrou, "Algorithms, games, and the Internet," in ACM Symposium on Theory of Computing, 2001.
22. K. Park, M. Sitharam, and S. Chen, "Quality of Service provision in noncooperative networks: heterogeneous preferences, multi-dimensional qos vectors, and burstiness," Proc. 1st International Conference on Information and Computation Economies, 1998., 1998.
23. V. Paxson, "End-to-end Internet packet dynamics," IEEE/ACM Transactions on Networking, vol. 7, no. 3, pp. 277-292, 1999.
24. J. Postel, "Transmission Control Protocol," Internet Request for Comments RFC 793, September 1981.
25. T. Roughgarden, "Designing networks for selfish users is hard, " in IEEE Symposium on Foundations of Computer Science, 2001, pp. 472-481.
26. T. Roughgarden and E. Tardos, "How bad is selfish routing?," in IEEE Symposium on Foundations of Computer Science, 2000, pp. 93-102.
27. S. Shenker, "Making greed work in networks: A game-theoretic analysis of switch service disciplines," IEEE/ACM Transactions on Networking, vol. 3, 1995.