Identifier-Based Discovery in Large-Scale Networks An Economic Perspective
The design of any network mechanism that requires collaboration among selfish agents could only benefit from accounting for the complex social and economic interactions and incentives of the agents using the design. This chapter presents a broad treatment of the main economic issues that arise in the context of identifier-based discovery on large scale networks, particularly on the Internet. An “identified” object (such as a node or service), referred to as a player, demands to be discoverable by the rest of the network on its “identifier”. A discovery scheme provides such a service to the players and incurs a cost for doing so. Providing such a service while accounting for the cost and making sure that the incentives of the players are aligned is the general economic problem that we address in this work. After introducing the identifier-based discovery problem, we present a taxonomy of discovery schemes and proposals based on their business model and we pose several questions that are becoming increasingly important as we proceed to design the inter-network of the future. An incentive model for distributed discovery in the context of the Border Gateway Protocol (BGP) and path-vector protocols in general is then presented. We model BGP route distribution and computation using a game in which a BGP speaker advertises its prefix to its direct neighbors promising them a reward for further distributing the route deeper into the network. The neighbors do the same thing with their direct neighbors, and so on. The result of the this cascaded route distribution is a globally advertised prefix and hence discoverability. We present initial results on the existence of equilibria in the game and we motivate our ongoing work.
KeywordsNash Equilibrium Solution Concept Distribute Hash Table Service Node Direct Neighbor
Unable to display preview. Download preview PDF.
- 1.GENI: Global environment for network innovations. http://www.geni.org/
- 2.G. Huston, BGP in 2008, http://www.potaroo.net/ispcol/2009-03/bgp2008.html, March 2008.
- 3.NSF Nets FIND initiative. http://www.nets-find.net/
- 4.Akamai Technologies. http://www.akamai.com, 2008.
- 6.M. Afergan, Using repeated games to design incentive-based routing systems, in Proceedings of 25th IEEE International Conference on Computer Communications, INFOCOM 2006, pp. 1–13, 2006.Google Scholar
- 7.B. Awerbuch, A. Bar-Noy, N. Linial and D. Peleg, Compact distributed data structures for adaptive routing, in Proceedings of ACM STOC '89, ACM, New York, pp. 479–489, 1989.Google Scholar
- 8.A.L. Barabasi, Linked, Perseus Publishing, 2002.Google Scholar
- 9.L. Bent and G.M. Voelker, Whole page performance, Workshop on Web Content Caching and Distribution, Boulder CO, 2002.Google Scholar
- 11.K. Butler, T. Farley, P. McDaniel and J. Rexford, A survey of bgp security issues and solutions, Tech. Report, AT&T Labs, 2004.Google Scholar
- 16.J. Feigenbaum and S. Shenker, Distributed algorithmic mechanism design: Recent results and future directions, in Proceedings of the 6th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, ACM Press, pp. 1–13, 2002.Google Scholar
- 17.D. Fudenberg and J. Tirole, Game Theory, MIT Press, 1991.Google Scholar
- 18.V. Fuller, D. Meyer and D. Farinacci, Lisp alternative topology (lisp+alt), http://tools.ietf.org/html/draft-fuller-lisp-alt-03.txt.
- 22.W. Herrin, What does a bgp route cost?, http://bill.herrin.us/network/bgpcost.html, 2008.
- 23.C. Huitema and S. Weerahandi, Internet measurements: The rising tide and the dns snag, in Proceedings of the 13th ITC Specialist Seminar on IP Traffic Measurement Modeling and Management, IPseminar, ITC, Monterrey, CA, 2000.Google Scholar
- 24.J. Khoury, Discovery in large-scale networks, Ph.D. Thesis, University of New Mexico, 2009 (to appear).Google Scholar
- 25.J. Khoury and C.T. Abdallah, Identifier-based discovery mechanism design in large-scale networks, in Future-Net'09: Proceedings of the International Workshop on the Network of the Future, with IEEE ICC'09, Dresden, Germany, 2009.Google Scholar
- 28.T. Koponen, M. Chawla, B.G. Chun, A. Ermolinskiy, K.H. Kim, S. Shenker and I. Stoica, A data-oriented network architecture, in Proceedings of SIGCOMM'07, ACM, Kyoto, Japan, 2007.Google Scholar
- 32.A. Mas-Colell, M.D. Whinston and J.R. Green, Microeconomic Theory, Oxford University Press, 1995.Google Scholar
- 33.D. Massey, L. Wang, B. Zhang and L. Zhang, A scalable routing system design for future internet, in ACM SIGCOMM Workshop on IPv6 and the Future of the Internet, ACM Press, New York, 2007.Google Scholar
- 34.D. Meyer, L. Zhang and K. Fall, Report from the IAB Workshop on Routing and Addressing, Internet RFC 4984, Septenber 2007.Google Scholar
- 35.R. Moskowitz, P. Nikander and P. Jokela, Host identity protocol architecture, RFC 4423, 2006.Google Scholar
- 36.N. Nisan and A. Ronen, Algorithmic mechanism design, in Proceedings of the 31st ACM Symposium on Theory of Computing, Atlanta, GA, 1999.Google Scholar
- 39.Y. Rekhter, T. Li and S. Hares, RFC 4271: A border gateway protocol 4 (bgp-4), 2006.Google Scholar
- 40.J. Shneidman, D.C. Parkes and M. Seltzer, Overcoming rational manipulation in distributed mechanism implementations, Tech. Rep., Harvard University, 2003.Google Scholar