Interdomain routing and games

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2008, Pages 57-66

  Levin, Hagay ^a   Schapira, Michael ^a   Zohar, Aviv ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

BGP; Distributed algorithmic mechanism design; Selfish routing

Indexed keywords

BORDER GATEWAY PROTOCOL; COMPLEX NETWORKS; COMPUTATION THEORY; GAME THEORY; MACHINE DESIGN; ROUTING PROTOCOLS;

DESTINATION NODES; DISTRIBUTED ALGORITHMIC MECHANISM DESIGN; GAME-THEORETIC MODEL; INCENTIVE COMPATIBLE; INTERDOMAIN ROUTING; MECHANISM DESIGN; PARTIAL INFORMATION; SELFISH ROUTING;

GATEWAYS (COMPUTER NETWORKS);

EID: 57049085866     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1374376.1374388     Document Type: Conference Paper

References (24)

1. Noga Alon, Yossi Matias, and Mario Szegedy. The space complexity of approximating the frequency moments. Journal of Computer and System Sciences, 58(1):137-147, 1999.
2. Kevin Butler, Toni Farley, Patrick Mcdaniel, and Jennifer Rexford. A survey of BGP security issues and solutions. Technical Report TD-5UGJ33, AT&T Labs, 2004.
3. R.onny R.. Dakdouk. Semih Salihoglu, Hao Wang, Haiyong Xie, and Yang Richard Yang, interdomain routing as social choice, In Proceedings the of Second International Workshop on Incentive-Based Computing, Lisboa, Portugal, 2006.
4. Alex Fabrikant and Christos Papadimitriou. The complexity of game dynamics: BGP oscillations, sink equilibria, and beyond. In Proceedings of ACM-SIAM Symposium, on Discrete Algorithms, 2008.
5. Nick Feamster, Ramesh Johari, and Hari Balakrishnan. Implications of autonomy for the expressiveness of policy routing. SIGCOMM Computer Communication Review, 35(4):25-36, 2005.
6. Joan Feigenbaum, David R. Karger, Vahab S. Mirrokni, and Rahul Sami. Subjective-cost policy routing. Theoretical Computer Science, 378(2):175-189, 2007.
7. Joan Feigenbaum, Christos H. Papadimitriou, Rahul Sami, and Scott Shenker. A BGP-based mechanism for lowest-cost routing. Distributed Computing. 18(l):61-72, 2005.
8. Joan Feigenbaum, Vijay R,amachandran, and Michael Schapira. incentive-compatible interdomain routing, in Proceedings of the 7th ACM conference on Electronic commerce, pages 130-139, 2006.
9. Joan Feigenbaum, R.ahul Sami, and Scott Shenker. Mechanism design for policy routing. Distributed Computing, 18(4):293-305, 2006.
10. Joan Feigenbaum, Michael Schapira, and Scott Shenker. Algorithmic Game Theory, chapter 14, pages 363-383. Cambridge University Press, 2007.
11. Lixin Gao, Timothy G. Griffin, and Jennifer Rexford. inherently safe backup routing with BGP. In Proceedings of the Twentieth Annual Joint Conference of the. IEEE Computer and Communications Societies (INFOCOM 2001), pages 547-556, 2001.
12. Lixin Gao and Jennifer Rexford. Stable Internet routing without global coordination. IEEE/ACM Transactions on Networking, 9(6):681-692, 2001.
13. Timothy G. Griffin, Aaron D. Jaggard, and Vijay Ranrachandran. Design principles of policy languages for path vector protocols. In Proceedings of the 2003 conference, on Applications, technologies, architectures, and protocols for computer communications, pages 61-72. ACM, 2003.
14. Timothy G. Griffin, F. Bruce Shepherd, and Gordon Wilfong. Policy disputes in path-vector protocols. In Proceedings of the Seventh Annual International Conference on Network Protocols, pages 21-30. IEEE Computer Society, 1999.
15. Timothy G. Griffin and Gordon Wilfong. An analysis of BGP convergence properties. SIGCOMM Computer Communication Review, 29(4):277-288, 1999.
16. Alex Hall, Evdokia Nikolova, and Christos Papadimitriou. Incentive-compatible interdomain routing with linear utilities. In Proceedings of the 3rd International Workshop on Internet and Network Economics, WINE 2007, volume 4858 of Lecture Notes in Computer Science, pages 232-244. Springer, 2007.
17. Sergiu Hart and Yishay Mansour. The communication complexity of uncoupled nash equilibrium procedures. In Proceedings of the thirty-ninth annual ACM Symposium on Theory of Computing (STOC 2007), pages 345-353. ACM, 2007.
18. Johan Hastad. Some optimal inapproximability results. Journal of the ACM, 48(4):798-859, 2001.
19. Geoff Huston, fnterconnection, peering, and settlements. In Internet Global Summit (INET). The internet Society, 1999.
20. Hagay Levin, Michael Schapira, and Aviv Zohar. The strategic justification for BGP. Technical report, The Leibniz Center,The Hebrew University of Jerusalem, 2006.
21. Ahuva Mu'alem and Michael Schapira. Setting lower bounds on truthfulness, in Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms (SODA 2007), pages 1143-1152. Society for fndustrial and Applied Mathematics, 2007.
22. Jeffrey Shneidman and David C. Parkes. Specification faithfulness in networks with rational nodes, in Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing (PODC 2004), Pages 88-97. ACM, 2004.
23. João L. Sobrinho. An algebraic theory of dynamic network routing. IEEE/ACM Transactions on Networking, 13(5):1160-1173, 2005.
24. Kannan Varadhan, Ramesh Govindan, and Deborah Estrin. Persistent route oscillations in inter-domain routing. Computer Networks, 32(1):1-16, 2000.