Games networks play a game theoretic approach to networks

Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN

Volumn , Issue , 2004, Pages 451-456

  Rextin, Aimal Tariq ^a   Irfan, Zahid ^a   Uzmi, Zartash Afzal ^a  

^a LAHORE UNIVERSITY OF MANAGEMENT SCIENCES   (Pakistan)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED ALGORITHEMIC MECHANISM DESIGN (DAMD); EXPLICIT CONGESTION NOTIFICATION (ECN); RANDOM EARLY DETECTION (RED); TRANSMISSION CONTROL PROTOCOL (TCP)/INTERNET PROTOCOL (IP);

ALGORITHMS; COMPUTER NETWORKS; INTERNET; NETWORK PROTOCOLS; PACKET NETWORKS; RESOURCE ALLOCATION; ROUTERS;

GAME THEORY;

EID: 3543105615     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISPAN.2004.1300521     Document Type: Conference Paper

References (20)

1. D. Dutta, A. Goel and J. Heidermann, "Oblivious AQM and Nash Equilibria", ACM SIGCOMM Computer Communications Review, Volume 32, No.3: July 2002.
2. J. Nagle, "Congestion Control in IP/TCP Networks", Computer Communications Review Volume 14, No 4, 1984.
3. V. Jacobson, "Congestion Avoidance and Control", ACM SIGCOMM, 1988.
4. S. Floyd and V. Jacobson, "Random Early Detection Gateways for congestion avoidance", IEEE /ACM Transactions on Networking, Volume 1, No 4, 1993.
5. K. Ramakrishnan and S. Floyd, "A Proposal to add Explicit Congestion Notification (ECN) to IP", RFC 2481 Experimental, January 1999.
6. J. Feigenbaum, "Games, Complexity Classes and Approximation Algorithms", Proceedings of the International Congress of Mathematicians, Volume III, Documenta Mathematica, Journal der Deutschen Mathematiker- Vereinigung, 1998.
7. J. Feigenbaum and S. Shenker, "Distributed Algorithmic Mechanism Design: Recent Results and Future Directions", ACM SIGCOMM 2002.
8. Akella, S. Seshan, R. Karp, S Shenker and C Papadimitriou, "Selfish Behavior and Stability of the Internet: A Game-Theoretic Analysis of TCP", ACM SIGCOMM 2002.
9. R. Pan, B. Prabhakar and K. Psounis," CHOKE, a stateless active queue management scheme for approximating fair bandwidth allocation", Proceedings of the conference on computer communications (IEEE Infocom), March 2000.
10. S. Shenker, "Making Greed Work in Networks: A Game-Theoretic Analysis of Switch Service Disciplines," in SIGCOMM Symposium on Communications Architectures and Protocols, (London, UK), pp. 47-57, Sept. 1994.
11. N. Nisan, "Algorithms for Selfish Agents", In Proc. 16th Annual Symposium on Theoretical Aspects of Computer Science (STACS'99), pp.1-15, 1999.
12. D. C. Parkes, "Mechanism Design. Chapter 2 in PhD dissertation, Iterative Combinatorial Auctions: Achieving Economic and Computational Efficiency", May 2001 Department of Computer and Information Science, University of Pennsylvania
13. R. Garg "A Game Theoretic Approach Towards Congestion Control in Communication Networks", July 2002, ACM SIGCOMM.
14. Y.A Korillas, A.A Lazar, A. Orda, "Acheiving Network Optima Using Stackelberg Routing" IEEE/ACM Transactions on Networking, Vol 5,No 1, February 1997
15. T. Roughgarden and E. Tardos, "How bad is selfish routing ?", Journal of the ACM, 49 (2): 236-259, 2002.
16. A. Lazar and N. Semret, "The Progressive Second Price Auction Mechanism for Network Resource Sharing", 8th International Symposium on Dynamic Games and Applications, Maastricht, The Netherlands, July 1998.
17. E. J. Friedman and S. Shenker, "Learning and Implementation on the Internet", 1998
18. Odlyzko, "A Modest Proposal for Preventing Internet Congestion", DIMACS Technical Report 97-68, Ocotober 1997
19. E. W.Fulp and D. S. Reeves, "Network Flow Control Based on Dynamic Competitive Markets", Proceedings International Conference on Network Protocol (ICNP'98), Austin Texas, Oct. 13-16, 1998.
20. C. H. Papadimitriou, "Algorithms, Games, and the Internet", STOC 2001 (extended abstract in ICALP 2001).