Incentive-compatible interdomain routing

Proceedings of the ACM Conference on Electronic Commerce

Volumn 2006, Issue , 2006, Pages 130-139

  Feigenbaum, Joan ^a   Ramachandran, Vijay ^b   Sehapira, Michael ^a,c  

^a YALE UNIVERSITY   (United States)

^b INTERNATIONAL COMPUTER SCIENCE INSTITUTE   (United States)

^c HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

Border Gateway Protocol (BGP); Distributed algorithmic mechanism design; Interdomain routing

Indexed keywords

ALGORITHMS; NETWORK PROTOCOLS; PROBLEM SOLVING; PUBLIC POLICY;

AUTONOMOUS SYSTEMS; BORDER GATEWAY PROTOCOL (BGP); DISTRIBUTED ALGORITHMIC MECHANISM DESIGN; LOWEST-COST-PATH (LCP);

INTERNET;

EID: 33748713255     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1134707.1134722     Document Type: Conference Paper

References (20)

1. M. Caesar and J. Rexford. BOP Policies in ISP Networks. IEEE Network Magazine 19(6):5-11, Nov. 2005.
2. J. Feigenbaum, D. Karger, V. Mirrokni, and R. Sami, Subjective-Cost Policy Routing. In Proc. Wshp. Internet and Network Economics (WINE), pp. 174-183, LNCS vol. 3828. Springer-Verlag, Dec. 2005.
3. J. Feigenbaum, C. Papadimitriou, R. Sami, and S. Shenker. A BGP-based Mechanism for Lowest-Cost Routing. Distributed Computing 18(1):61-72, Jul. 2005.
4. J. Feigenbaum, V. Ramachandran, and M. Schapira. Incentive-Compatible Interdomain Routing (full version). Yale Univ. Tech. Report 1342. ftp://ftp.cs.yale.edu/pub/TR/tr1342.pdf.
5. rd Symp. Principles of Distributed Computing (PODC'04), pp. 11-20, ACM Press, Jul. 2004.
6. L. Gao, T. G. Griffin, and J. Rexford. Inherently Safe Backup Routing with BGP. In Proc. IEEE INFOCOM'01, pp. 547-556. IEEE Computer Society, Apr. 2001.
7. L. Gao and J. Rexford. Stable Internet Routing without Global Coordination IEEE/ACM Trans. Networking 9(6):681-692, Dec. 2001.
8. T. G. Griffin, A. D. Jaggard, and V. Ramachandran. Design Principles of Policy Languages for Path Vector Protocols. In Proc. ACM SIGCOMM'03, pp. 61-72. ACM Press, Aug. 2003.
9. th Int'l Conf. Network Protocols (ICNP), pp. 21-30. IEEE Computer Society, Nov. 1999.
10. T. G. Griffin, F. B. Shepherd, and G. Wilfong. The Stable Paths Problem and Interdomain Routing. IEEE/ACM Trans. Networking 10(2):232-243, Apr. 2002.
11. J. Green and J. Laffont. Incentives in Public Decision Making. In Studies in Public Economics, vol. 1, pp. 65-78. North Holland, Amsterdam, 1979.
12. nd Symp. Foundations of Computer Science (FOCS), pp. 129-140. IEEE Computer Society, 2001.
13. G. Huston. Interconnection, Peering, and Settlements. In Proc. Internet Global Summit (INET). The Internet Society, Jun. 1999.
14. th Symp. Theoretical Aspects of Computer Science (STACS), pp. 387-396, LNCS vol. 1563 (G. Meinel and S. Tison, eds.). Springer-Verlag, Mar. 1999.
15. J. Moy. Open Shortest Pouting First (OSPF) version 2. RFC 2328. Internet Engineering Task Force (IETF), Apr. 1998.
16. N. Nisan and A. Ronen. Algorithmic Mechanism Design. Games and Economic Behavior 35(1,2):166-196, 2001.
17. Y. Rekhter and T. Li. A Border Gateway Protocol (BGP-4). RFC 1771. Internet Engineering Task Force (IETF), Mar. 1995.
18. rd ACM Symp. Principles of Distributed Computing (PODC'04), pp. 88-97, ACM Press, Jul. 2004.
19. J. L. Sobrinho. An Algebraic Theory of Dynamic Network Routing. IEEE/ACM Trans. Networking 13(5):1160-1173, Oct. 2005.
20. K. Varadhan, R. Govindan, and D. Estrin. Persistent Route Oscillations in Interdomain Routing. Computer Networks 32(1):1-16, Jan. 2000.