Advertisement

Identifier-Based Discovery in Large-Scale Networks An Economic Perspective

  • Joud Khoury
  • Chaouki T. Abdallah
Part of the Intelligent Systems, Control, and Automation: Science and Engineering book series (ISCA, volume 39)

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.

Keywords

Nash Equilibrium Solution Concept Distribute Hash Table Service Node Direct Neighbor 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    GENI: Global environment for network innovations. http://www.geni.org/
  2. 2.
    G. Huston, BGP in 2008, http://www.potaroo.net/ispcol/2009-03/bgp2008.html, March 2008.
  3. 3.
    NSF Nets FIND initiative. http://www.nets-find.net/
  4. 4.
    Akamai Technologies. http://www.akamai.com, 2008.
  5. 5.
    I. Abraham, C. Gavoille, D. Malkhi, N. Nisan and M. Thorup, Compact name-independent routing with minimum stretch, in Proceedings of ACM SPAA '04, ACM Press, New York, pp. 20–24, 2004.CrossRefGoogle Scholar
  6. 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. 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. 8.
    A.L. Barabasi, Linked, Perseus Publishing, 2002.Google Scholar
  9. 9.
    L. Bent and G.M. Voelker, Whole page performance, Workshop on Web Content Caching and Distribution, Boulder CO, 2002.Google Scholar
  10. 10.
    L. Blume, D. Easley, J. Kleinberg and E. Tardos, Trading networks with price-setting agents, in EC '07, Proceedings of the 8th ACM Conference on Electronic Commerce, ACM, New York, pp. 143–151, 2007.CrossRefGoogle Scholar
  11. 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
  12. 12.
    M. Caesar, T. Condie, J. Kannan, K. Lakshminarayanan and I. Stoica, Rofl: routing on flat labels, in Proceedings of SIGCOMM 2006, ACM Press, New York, pp. 363–374, 2006.CrossRefGoogle Scholar
  13. 13.
    M. Caesar and J. Rexford, Bgp routing policies in isp networks, IEEE Network 19(6), 5–11, 2005.CrossRefGoogle Scholar
  14. 14.
    J. Feigenbaum, C. Papadimitriou, R. Sami and S. Shenker, A bgp-based mechanism for lowest-cost routing, Distrib. Comput. 18(1), 61–72, 2005.CrossRefGoogle Scholar
  15. 15.
    J. Feigenbaum, V. Ramachandran and M. Schapira, Incentive-compatible interdomain routing, in EC '06: Proceedings of the 7th ACM conference on Electronic Commerce, ACM, New York, pp. 130–139, 2006.CrossRefGoogle Scholar
  16. 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. 17.
    D. Fudenberg and J. Tirole, Game Theory, MIT Press, 1991.Google Scholar
  18. 18.
    V. Fuller, D. Meyer and D. Farinacci, Lisp alternative topology (lisp+alt), http://tools.ietf.org/html/draft-fuller-lisp-alt-03.txt.
  19. 19.
    L. Gao, On inferring autonomous system relationships in the internet, IEEE/ACM Trans. Netw. 9(6), 733–745, 2001.CrossRefGoogle Scholar
  20. 20.
    T.G. Griffin, F.B. Shepherd and G. Wilfong, Policy disputes in path-vector protocols, in ICNP '99: Proceedings of the Seventh Annual International Conference on Network Protocols, IEEE Computer Society, Washington, DC, p. 21, 1999.CrossRefGoogle Scholar
  21. 21.
    T.G. Griffin, F.B. Shepherd and G. Wilfong, The stable paths problem and interdomain routing, IEEE/ACM Trans. Netw. 10(2), 232–243, 2002.CrossRefGoogle Scholar
  22. 22.
    W. Herrin, What does a bgp route cost?, http://bill.herrin.us/network/bgpcost.html, 2008.
  23. 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. 24.
    J. Khoury, Discovery in large-scale networks, Ph.D. Thesis, University of New Mexico, 2009 (to appear).Google Scholar
  25. 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
  26. 26.
    J. Kleinberg, The convergence of social and technological networks, Commun. ACM 51(11), 66–72, 2008.CrossRefGoogle Scholar
  27. 27.
    J. Kleinberg and P. Raghavan, Query incentive networks, in FOCS '05: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Washington, DC, pp. 132–141, 2005.CrossRefGoogle Scholar
  28. 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
  29. 29.
    D. Krioukov, k.c. claffy, K. Fall and A. Brady, On compact routing for the internet, SIGCOMM Comput. Commun. Rev. 37(3), 41–52, 2007.CrossRefGoogle Scholar
  30. 30.
    H. Levin, M. Schapira and A. Zohar, Interdomain routing and games, in STOC '08: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, ACM, New York, NY, pp. 57–66, 2008.CrossRefGoogle Scholar
  31. 31.
    C. Li, B. Yu and K. Sycara, An incentive mechanism for message relaying in unstructured peer-to-peer systems, in AAMAS '07: Proceedings of the 6th International Joint Conference on Autonomous Agents and Multiagent Systems, ACM, New York, pp. 1–8, 2007.CrossRefGoogle Scholar
  32. 32.
    A. Mas-Colell, M.D. Whinston and J.R. Green, Microeconomic Theory, Oxford University Press, 1995.Google Scholar
  33. 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. 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. 35.
    R. Moskowitz, P. Nikander and P. Jokela, Host identity protocol architecture, RFC 4423, 2006.Google Scholar
  36. 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
  37. 37.
    N. Nisan, T. Roughgarden, E. Tardos and V.V. Vazirani, Algorithmic Game Theory, Cambridge University Press, New York, 2007.zbMATHGoogle Scholar
  38. 38.
    Papadimitriou, C.: Algorithms, games, and the internet, in STOC '01: Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing, ACM, New York, pp. 749– 753, 2001.CrossRefGoogle Scholar
  39. 39.
    Y. Rekhter, T. Li and S. Hares, RFC 4271: A border gateway protocol 4 (bgp-4), 2006.Google Scholar
  40. 40.
    J. Shneidman, D.C. Parkes and M. Seltzer, Overcoming rational manipulation in distributed mechanism implementations, Tech. Rep., Harvard University, 2003.Google Scholar
  41. 41.
    I. Stoica, R. Morris, D. Liben-Nowell, D.R. Karger, M.F. Kaashoek, F. Dabek and H. Balakrishnan, Chord: A scalable peer-to-peer lookup protocol for internet applications, IEEE/ACM Trans. Netw. 11(1), 17–32, 2003.CrossRefGoogle Scholar
  42. 42.
    S. Yuen and B. Li, Strategyproof mechanisms towards dynamic topology formation in autonomous networks, Mob. Netw. Appl. 10(6), 961–970, 2005.CrossRefGoogle Scholar

Copyright information

© Springer Science + Business Media B.V. 2009

Authors and Affiliations

  • Joud Khoury
    • 1
  • Chaouki T. Abdallah
    • 1
  1. 1.Department of Electrical & Computer EngineeringUniversity of New MexicoAlbuquerqueUSA

Personalised recommendations