Abstract
We revisit the problem of incentive-compatible interdomain routing, examining the, quite realistic, special case in which the autonomous systems’ (ASes’) utilities are linear functions of the traffic in the incident links, and the traffic leaving each AS. We show that incentive-compatibility towards maximizing total welfare is achievable efficiently, and, in the uncapacitated case, by an algorithm that can be implemented by BGP, the standard protocol for interdomain routing.
The authors were supported through: NSF grant CCF - 0635319, a gift from Yahoo! Research, a MICRO grant, the American Foundation for Bulgaria Fellowship, and a fellowship by the Swiss National Science Foundation PA002 - 113170 / 1.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
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)
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)
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)
Edmonds, J., Karp, R.M.: Theoretical improvements in algorithmic efficiency for network flow problems. J. ACM 19(2), 248–264 (1972)
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)
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)
Fabrikant, A., Papadimitriou, C.H.: The search for equilibria: Sink equilibria, unit recall games, and BGP oscillations. In: submitted manuscript (2007)
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)
Feigenbaum, J., Papadimitriou, C.H., Sami, R., Shenker, S.: A BGP-based mechanism for lowest-cost routing. In: PODC 2002, pp. 173–182 (2002)
Feigenbaum, J., Ramachandran, V., Schapira, M.: Incentive-compatible interdomain routing. In: EC 2006, pp. 130–139. ACM Press, New York (2006)
Feigenbaum, J., Sami, R., Shenker, S.: Mechanism design for policy routing. Distrib. Comput. 18(4), 293–305 (2006)
Ford, L.R., Fulkerson, D.R.: Constructing maximal dynamic flows from static flows. Operations Research 6, 419–433 (1958)
Gao, L.: On inferring autonomous system relationships in the Internet. IEEE/ACM Trans. Networking 9(6), 733–745 (2001)
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)
Griffin, T.G., Wilfong, G.: An analysis of BGP convergence properties. In: SIGCOMM 1999, pp. 277–288. ACM Press, New York (1999)
Mas-Colell, A., Whinston, M.D., Green, J.R.: Microeconomic Theory. Oxford University Press, New York (1995)
Nisan, N., Ronen, A.: Algorithmic mechanism design. In: STOC’99, pp. 129–140. ACM Press, New York (1999)
Papadimitriou, C.H.: Algorithms, games, and the Internet. In: STOC 2001, pp. 749–753 (2001)
Rekhter, Y., Li, T.: A border gateway protocol 4 (bgp-4) (1995)
Stewart, J.W.: BGP4: Inter-Domain Routing in the Internet. Addison-Wesley, London, UK (1998)
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)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hall, A., Nikolova, E., Papadimitriou, C. (2007). Incentive-Compatible Interdomain Routing with Linear Utilities. In: Deng, X., Graham, F.C. (eds) Internet and Network Economics. WINE 2007. Lecture Notes in Computer Science, vol 4858. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77105-0_23
Download citation
DOI: https://doi.org/10.1007/978-3-540-77105-0_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77104-3
Online ISBN: 978-3-540-77105-0
eBook Packages: Computer ScienceComputer Science (R0)