Game-theoretic analysis of Internet switching with selfish users

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3828 LNCS, Issue , 2005, Pages 236-245

  Kesselman, Alex ^a   Leonardi, Stefane ^b   Bonifaci, Vincenzo ^b  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

BUFFER CIRCUITS; CONGESTION CONTROL (COMMUNICATION); GAME THEORY; MATHEMATICAL MODELS; PACKET NETWORKS; ROUTERS; SWITCHING; TELECOMMUNICATION TRAFFIC;

FIRST-IN-FIRST-OUT (FIFO) BUFFERS; NASH EQUILIBRIA; RANDOM EARLY DETECTION (RED); TRANSMISSION RATES;

INTERNET;

EID: 33744910585     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11600930_23     Document Type: Conference Paper

References (29)

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," Proceedings of ACM SIGCOMM'02.
2. E. Altman, T. Basar, T. Jimenez and N. Shimkin, "Routing into two parallel links: Game-Theoretic Distributed Algorithms," Special Issue of Journal of Parallel and Distributed Computing on "Routing in Computer and Communication Networks", pp. 1367-1381, vol. 61, no. 9, September 2001.
3. D. Bertsekas and R. Gallager, "Data Networks," Prentice-Hall, 1987.
4. T. Boulogne, E. Altman and O. Pourtallier, "On the convergence to Nash equilibrium in problems of distributed computing," Annals of Operation research, 2002.
5. G. Christodoulou, E. Koutsoupias and A. Nanavati, "Coordination Mechanisms," Proceedings of ICALP'04.
6. A. Czumaj, P. Krysta and B. Vocking, "Selfish traffic allocation for server farms," Proceedings of STOC'02.
7. A. Czumaj and B. Vocking, 'Tight bounds on worst case equilibria," Proceedings of SODA'02.
8. C. Douligeris and R. Mazumdar, "On Pareto optimal flow control in an integrated environment," Proceedings of the 25th Allerton Conference on Communication, Control and Computing, 1987.
9. D. Dutta, A. Goel and J. Heidemann, "Oblivious AQM and Nash Equilibria," Proceedings of INFOCOM'03.
10. E. Even-Dar, A. Kesselman and Y. Mansour, "Convergence Time to Nash Equilibria," Proceedings of ICALP'03.
11. R. Feldmann, M. Gairing, T. Lcking, B. Monien and M. Rode, "Nashification and the Coordination Ratio for a Selfish Routing Game, " Proceedings of ICALP'03.
12. M. Florian and D. Hearn, "Network Equilibrium Models and Algorithms", Network Routing. Handbooks in RO and MS, M.O. Ball et al. Editors, Elsevier, pp. 485-550. 1995.
13. S. Floyd and V. Jacobson, "Random Early Detection for Congestion Avoidance," IEEE/ACM Transactions on Networking, August 1993.
14. D. Fotakis, S. Kontogiannis, E. Koutsoupias, M. Mavronicolas, and P. Spirakis, "The Structure and Complexity of Nash Equilibria for a Selfish Routing Game," Proceedings of ICALP'02.
15. D. Fudenberg and D. Levine, "The theory of learning in games," MIT Press, 1998.
16. X. Gao, K. Jain, and L. J. Schulman, "Fair and efficient router congestion control," Proceedings of SODA '04, pp. 1050-1059.
17. R. Garg, A. Kamra and Varun Khurana, "A Game-Theoretic Approach Towards Congestion Control in Communication Networks," ACM SIGCOMM Computer Communications Review, vol. 32, no. 3, pp. 47-61, July 2002.
18. R. Gibbens and F. Kelly, "Resource pricing and the evolution of congestion control," Automatica, vol. 35, pp. 1969-1985, 1999.
19. V. Jacobson, "Congestion Avoidance and Control," Proceedings of ACM SIGCOMM'88.
20. F. Kelly, A. Maulloo and D. Tan, "Rate control in communication networks: shadow prices, proportional fairness and stability," Journal of the Operational Research Society, vol. 49, pp. 237-252, 1998.
21. Y. A. Korilis and A. A. Lazar, "On the Existence of Equilibria in Noncooperative Optimal Flow Control," Journal of the ACM, vol. 42, pp. 584-613, 1995.
22. E. Koutsoupias, C. H. Papadimitriou, "Worst-case equilibria," Proceedings of STACS'99.
23. R. J. La and V. Anantharam, "Optimal Routing Control: Game Theoretic Approach," Proceedings of the 36rd IEEE Conference on Decision and Control, pp. 2910-2915, 1997.
24. J. F. Nash, "Non-cooperative games," Annals of Mathematics, vol. 54, pp. 286-295, 1951.
25. A. Orda, N. Rom and N. Shimkin, "Competitive routing in multi-user communication networks," IEEE/ACM Transaction on Networking, vol 1, pp. 614-627, 1993.
26. R. Pan, B. Prabhakar and K. Psounis, "CHOKe - a stateless active queue management scheme for approximating fair bandwidth allocation," Proceedings of INFOCOM00, pp. 942-951.
27. L. Qiu, Y. R. Yang, Y. Zhang, and S. Shenker, "On Selfish Routing in Internet-Like Environments," Proceedings of ACM SIGCOMM'03.
28. T. Roughgarden and E. Tardos, "How Bad is Selfish Routing?," Journal of the ACM, vol. 49, no. 2, pp. 236-259, 2002.
29. S. Shenker, "Making greed work in networks a game-theoretic analysis of switch service disciplines," IEEE/ACM Transactions on Networking, vol. 3, pp. 819-831, 1995.