Skip to main content
SpringerLink
Log in
Book cover

Internet Naming and Discovery pp 91–103Cite as

On the Economics of Identifier-Based Discovery

  • Chapter

  • 511 Accesses

Part of the book series: Signals and Communication Technology ((SCT))

Abstract

We present a broad treatment of the main economic issues that arise in the context of name-based discovery. Providing a discovery service while accounting for the cost and making sure that the incentives of the players are aligned is the general theme. We motivate the subject, and we present a taxonomy of discovery schemes and proposals based on their business model.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Notes

  1. 1.

    Service nodes implement the discovery service. Players are customers of the discovery service or agents that wish to be discoverable.

  2. 2.

    This VCG pricing scheme is referred to as the Clark Pivot rule [123].

References

  1. Abraham, I., Gavoille, C., Malkhi, D., Nisan, N., Thorup, M.: Compact name-independent routing with minimum stretch. In: ACM SPAA ’04, pp. 20–24. ACM, New York (2004)

    Chapter  Google Scholar 

  2. Afergan, M.: Using repeated games to design incentive-based routing systems. In: INFOCOM 2006, pp. 1–13 (2006)

    Google Scholar 

  3. Awerbuch, B., Bar-Noy, A., Linial, N., Peleg, D.: Compact distributed data structures for adaptive routing. In: ACM STOC ’89, pp. 479–489. ACM, New York (1989)

    Google Scholar 

  4. Blume, L., Easley, D., Kleinberg, J., Tardos, E.: Trading networks with price-setting agents. In: EC ’07, pp. 143–151. ACM, New York (2007)

    Chapter  Google Scholar 

  5. Caesar, M., Condie, T., Kannan, J., Lakshminarayanan, K., Stoica, I.: Rofl: routing on flat labels. In: Proceedings of SIGCOMM 2006, pp. 363–374. ACM, New York (2006)

    Chapter  Google Scholar 

  6. Caesar, M., Rexford, J.: Bgp routing policies in isp networks. IEEE Netw. 19(6), 5–11 (2005)

    Article  Google Scholar 

  7. Feigenbaum, J., Papadimitriou, C., Sami, R., Shenker, S.: A BGP-based mechanism for lowest-cost routing. Distrib. Comput. 18(1), 61–72 (2005)

    Article  Google Scholar 

  8. Feigenbaum, J., Ramachandran, V., Schapira, M.: Incentive-compatible interdomain routing. In: EC ’06, pp. 130–139. ACM, New York (2006)

    Chapter  Google Scholar 

  9. Feigenbaum, J., Shenker, S.: Distributed algorithmic mechanism design: Recent results and future directions. In: In Proceedings of the 6th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, pp. 1–13. ACM, New York (2002)

    Google Scholar 

  10. Fudenberg, D., Tirole, J.: Game Theory. MIT Press, Cambridge (1991)

    Google Scholar 

  11. Fuller, V., Meyer, D., Farinacci, D.: LISP alternative topology (LISP+ALT). http://tools.ietf.org/html/draft-fuller-lisp-alt-03.txt

  12. Griffin, T.G., Shepherd, F.B., Wilfong, G.: The stable paths problem and interdomain routing. IEEE/ACM Trans. Netw. 10(2), 232–243 (2002)

    Article  Google Scholar 

  13. Kleinberg, J.: The convergence of social and technological networks. Commun. ACM 51(11), 66–72 (2008)

    Article  Google Scholar 

  14. Kleinberg, J., Raghavan, P.: Query incentive networks. In: FOCS ’05, pp. 132–141. IEEE Computer Society, Washington (2005)

    Google Scholar 

  15. Koponen, T., Chawla, M., Chun, B.-G., Ermolinskiy, A., Kim, K.H., Shenker, S., Stoica, I.: A data-oriented network architecture. In: Proceedings of SIGCOMM’07. ACM, Kyoto (2007)

    Google Scholar 

  16. Levin, H., Schapira, M., Zohar, A.: Interdomain routing and games. In: STOC ’08, pp. 57–66. ACM, New York (2008)

    Chapter  Google Scholar 

  17. Li, C., Yu, B., Sycara, K.: An incentive mechanism for message relaying in unstructured peer-to-peer systems. In: AAMAS ’07, pp. 1–8. ACM, New York (2007)

    Chapter  Google Scholar 

  18. Mas-Colell, A., Whinston, M.D., Green, J.R.: Microeconomic Theory. Oxford University Press, Oxford (1995)

    Google Scholar 

  19. Massey, D., Wang, L., Zhang, B., Zhang, L.: A scalable routing system design for future internet. In: ACM SIGCOMM Workshop on IPv6 and the Future of the Internet. ACM, New York (2007)

    Google Scholar 

  20. Mockapetris, P.: RFC 1035: domain names implementation and specification (1987)

    Google Scholar 

  21. Moskowitz, R., Nikander, P., Jokela, P.: Host identity protocol architecture. RFC 4423 (2006)

    Google Scholar 

  22. Nisan, N., Ronen, A.: Algorithmic mechanism design. In: Proceedings of the 31st ACM Symposium on Theory of Computing, Atlanta, GA (1999)

    Google Scholar 

  23. Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.V.: Algorithmic Game Theory. Cambridge University Press, New York (2007). 0521872820

    Book  MATH  Google Scholar 

  24. Papadimitriou, C.: Algorithms, games, and the internet. In: STOC ’01: Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing, pp. 749–753. ACM, New York (2001)

    Chapter  Google Scholar 

  25. Rekhter, Y., Li, T., Hares, S.: RFC 4271: a border gateway protocol 4 (BGP-4) (2006)

    Google Scholar 

  26. Stoica, I., Morris, R., Liben-Nowell, D., Karger, D.R., Kaashoek, M.F., Dabek, F., Balakrishnan, H.: Chord: a scalable peer-to-peer lookup protocol for internet applications. IEEE/ACM Trans. Netw. 11(1), 17–32 (2003)

    Article  Google Scholar 

  27. Yuen, S., Li, B.: Strategyproof mechanisms towards dynamic topology formation in autonomous networks. Mob. Netw. Appl. 10(6), 961–970 (2005)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Internetwork Research Department, Raytheon BBN Technologies, Boston, MA, USA

    Joud S. Khoury

  2. Electrical and Computer Engineering Department, University of New Mexico, Albuquerque, NM, USA

    Chaouki T. Abdallah

Authors
  1. Joud S. Khoury
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chaouki T. Abdallah
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag London

About this chapter

Cite this chapter

Khoury, J.S., Abdallah, C.T. (2013). On the Economics of Identifier-Based Discovery. In: Internet Naming and Discovery. Signals and Communication Technology. Springer, London. https://doi.org/10.1007/978-1-4471-4552-3_7

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-4552-3_7

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-4471-4551-6

  • Online ISBN: 978-1-4471-4552-3

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation