Incentive-compatible interdomain routing with linear utilities

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

Volumn 4858 LNCS, Issue , 2007, Pages 232-244

  Hall, Alexander ^a   Nikolova, Evdokia ^b   Papadimitriou, Christos ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; NETWORK PROTOCOLS; NETWORK ROUTING;

AUTONOMOUS SYSTEMS; INTERDOMAIN ROUTING; LINEAR FUNCTIONS; LINEAR UTILITIES;

UTILITY PROGRAMS;

EID: 38449090932     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-77105-0_23     Document Type: Conference Paper

References (22)

1. Achlioptas, D., Clauset, A., Kempe, D., Moore, C.: On the bias of traceroute sampling; or, power-law degree distributions in regular graphs. In: STOC 2005, pp. 694-703 (2005)
2. Anshelevich, E., Shepherd, B., Wilfong, G.: Strategic network formation through peering and service agreements. In: FOCS 2006, Washington, DC, USA, pp. 77-86. IEEE Computer Society Press, Los Alamitos (2006)
3. Barford, P., Bestavros, A., Byers, J., Crovella, M.: On the marginal utility of deploying measurement infrastructure. In: ACM SIGCOMM Internet Measurement Workshop, November 2001, ACM Press, New York (2001)
4. Di Battista, G., Erlebach, T., Hall, A., Patrignani, M., Pizzonia, M., Schank, T.: Computing the types of the relationships between autonomous systems. IEEE/ACM Transactions on Networking 15, 267-280 (2007)
5. Edmonds, J., Karp, R.M.: Theoretical improvements in algorithmic efficiency for network flow problems. J. ACM 19(2), 248-264 (1972)
6. Erlebach, T., Hall, A., Panconesi, A., Vukadinovic, D.: Cuts and disjoint paths in the valley-free path model of Internet BGP routing. In: CAAN, pp. 49-62 (2004)
7. Fabrikant, A., Luthra, A., Maneva, E., Papadimitriou, C.H., Shenker, S.: On a network creation game. In: PODC 2003, pp. 347-351. ACM Press, New York (2003)
8. Fabrikant, A., Papadimitriou, C.H.: The search for equilibria: Sink equilibria, unit recall games, and BGP oscillations. In: submitted manuscript (2007)
9. Feamster, N., Winick, J., Rexford, J.: A model of BGP routing for network engineering. In: SIGMETRICS 2004/Performance 2004, pp. 331-342. ACM Press, New York (2004)
10. Feigenbaum, J., Papadimitriou, C.H., Sami, R., Shenker, S.: A BGP-based mechanism for lowest-cost routing. In: PODC 2002, pp. 173-182 (2002)
11. Feigenbaum, J., Ramachandran, V., Schapira, M.: Incentive-compatible interdomain routing. In: EC 2006, pp. 130-139. ACM Press, New York (2006)
12. Feigenbaum, J., Sami, R., Shenker, S.: Mechanism design for policy routing. Distrib. Comput. 18(4), 293-305 (2006)
13. Ford, L.R., Fulkerson, D.R.: Constructing maximal dynamic flows from static flows. Operations Research 6, 419-433 (1958)
14. Gao, L.: On inferring autonomous system relationships in the Internet. IEEE/ACM Trans. Networking 9(6), 733-745 (2001)
15. Govindan, R., Reddy, A.: An analysis of Internet inter-domain topology and route stability. In: IEEE INFOCOM 1997, April 1997, pp. 850-857. IEEE Computer Society Press, Los Alamitos (1997)
16. Griffin, T.G., Wilfong, G.: An analysis of BGP convergence properties. In: SIGCOMM 1999, pp. 277-288. ACM Press, New York (1999)
17. Mas-Colell, A., Whinston, M.D., Green, J.R.: Microeconomic Theory. Oxford University Press, New York (1995)
18. Nisan, N., Ronen, A.: Algorithmic mechanism design. In: STOC'99, pp. 129-140. ACM Press, New York (1999)
19. Papadimitriou, C.H.: Algorithms, games, and the Internet. In: STOC 2001, pp. 749-753 (2001)
20. Rekhter, Y., Li, T.: A border gateway protocol 4 (bgp-4) (1995)
21. Stewart, J.W.: BGP4: Inter-Domain Routing in the Internet. Addison-Wesley, London, UK (1998)
22. Subramanian, L., Agarwal, S., Rexford, J., Katz, R.: Characterizing the Internet hierarchy from multiple vantage points. In: IEEE INFOCOM 2002, IEEE Computer Society Press, Los Alamitos (2002)