Abstract
A named object/player (such as a node or service) demands to be discoverable by the rest of the network. A discovery scheme provides such a service to the players. The discovery level is a measure of “how discoverable” a player is by the rest of the network. This is “how easy” it is for the network to discover the player not the opposite. The performance of discovery, or the discovery level, could significantly affect the player’s business model especially in time-sensitive application contexts. This chapter is an exercise in the design of differentiated discovery services, which provide different service levels to different sets of players. We formally define and motivate differentiated discovery and we present a proof-of-concept architecture.
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
Notes
- 1.
When the set of discovery levels is discrete, a level becomes a “class” of service.
- 2.
This information is used for optimal stretch-1 routing based on locators (topological labels).
References
Akamai technologies. http://www.akamai.com (2008)
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)
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)
Bent, L., Voelker, G.M.: Whole page performance. In: Workshop on Web Content Caching and Distribution, Boulder CO (2002)
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)
Castineyra, I., Chiappa, N., Steenstrup, M.: RFC 1992: the nimrod routing architecture (1996)
Fuller, V., Meyer, D., Farinacci, D.: LISP alternative topology (LISP+ALT). http://tools.ietf.org/html/draft-fuller-lisp-alt-03.txt
Huitema, C., Weerahandi, S.: 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, USA (2000)
Jacobson, V., Smetters, D.K., Thornton, J.D., Plass, M.F., Briggs, N.H., Braynard, R.L.: Networking named content. In: CoNEXT ’09: Proceedings of the 5th International Conference on Emerging Networking Experiments and Technologies, pp. 1–12. ACM, New York (2009)
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)
Laing, K.A.: Name-independent compact routing in trees. Technical Report, Tufts University [online]. http://www.cs.tufts.edu/tech_reports/reports/2003-2/report.pdf
Laing, K.A.: Name-independent compact routing in trees. Inf. Process. Lett. 103(2), 57–60 (2007)
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)
Mockapetris, P.: RFC 1035: domain names implementation and specification (1987)
Moskowitz, R., Nikander, P., Jokela, P.: Host identity protocol architecture. RFC 4423 (2006)
Thorup, M., Zwick, U.: Compact routing schemes. In: ACM SPAA ’01, pp. 1–10. ACM, New York (2001)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag London
About this chapter
Cite this chapter
Khoury, J.S., Abdallah, C.T. (2013). Discovery Service Differentiation. In: Internet Naming and Discovery. Signals and Communication Technology. Springer, London. https://doi.org/10.1007/978-1-4471-4552-3_6
Download citation
DOI: https://doi.org/10.1007/978-1-4471-4552-3_6
Publisher Name: Springer, London
Print ISBN: 978-1-4471-4551-6
Online ISBN: 978-1-4471-4552-3
eBook Packages: EngineeringEngineering (R0)