Advertisement

Naming

  • Joud S. Khoury
  • Chaouki T. Abdallah
Part of the Signals and Communication Technology book series (SCT)

Abstract

Names make it easier to identify and refer to people and things around us. Restaurants in a city, postal mailboxes on a street, digital files on a computer, and physical interfaces on a router are examples of things we assign contextual names to. Computer networks are no different. We use names so we can identify, share, and locate objects on a network. Networks host objects, including for example nodes, endpoints, services, content, and users. A computer network is essentially intended for delivering and sharing information. The basic primitive needed for successful delivery of information is the ability to discover routes to objects. So in essence, the two most basic abstractions in a computer network are objects and routes. This in a sense defines the purpose of naming in the context of computer networks: to make it easier to discover routes to objects. Almost every networking application relies on naming services, the latter being an integral part of a network architecture. Revisiting the definitions of Shoch, Hauzeur, Saltzer and Karsten, we start by disambiguating the plethora of terms used in the naming literature—name, address, identifier, locator, binding, routing, discovery, mapping, and resolution. We present the definitions and we provide a formalism based on simple relational algebra. The model adds clarity to the discussion by formally representing the main abstractions, their relationships, and the main constraints on them. Such a formalism may be directly fed into symbolic model checkers to explore and check a variety of system level properties. We then examine the properties of names, bindings, and discovery, and we give two illustrative case studies of name services.

Keywords

Internet Protocol Session Initiation Protocol Attachment Point Distribute Hash Table Domain Name System 
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.

References

  1. 2.
    The alloy analyzer. http://alloy.mit.edu/
  2. 5.
    Delay tolerant networking research group. http://www.dtnrg.org/
  3. 8.
    The handle system. http://www.handle.net
  4. 29.
    Balakrishnan, H., Lakshminarayanan, K., Ratnasamy, S., Shenker, S., Stoica, I., Walfish, M.: A layered naming architecture for the internet. In: Proceedings of ACM SIGCOMM 2004, pp. 343–352. ACM, Portland (2004) Google Scholar
  5. 30.
    Ballintijn, G., van Steen, M., Tanenbaum, A.S.: Scalable human-friendly resource names. Internet Comput. 5(5), 20–27 (2001) CrossRefGoogle Scholar
  6. 40.
    Braden, R., Faber, T., Handley, M.: From protocol stack to protocol heap: role-based architecture. SIGCOMM Comput. Commun. Rev. 33(1), 17–22 (2003) CrossRefGoogle Scholar
  7. 45.
    Castineyra, I., Chiappa, N., Steenstrup, M.: RFC 1992: the nimrod routing architecture (1996) Google Scholar
  8. 47.
    Chiappa, J.N.: Endpoints and endpoint names: a proposed enhancement to the internet architecture. http://www.chiappa.net/tech/endpoints.txt (1999)
  9. 81.
    Hauzeur, B.M.: A model for naming, addressing and routing. ACM Trans. Inf. Syst. 4(4), 293–311 (1986) CrossRefGoogle Scholar
  10. 89.
    Jackson, D.: Software Abstractions: Logic, Language, and Analysis. MIT Press, Cambridge (2006). 0262101149 Google Scholar
  11. 92.
    Karsten, M., Keshav, S., Prasad, S., Beg, M.: An axiomatic basis for communication. In: Proceedings of SIGCOMM 2007, pp. 217–228. ACM, New York (2007) Google Scholar
  12. 99.
    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
  13. 107.
    Lakshminarayanan, K., Adkins, D., Perrig, A., Stoica, I.: Securing user-controlled routing infrastructures. IEEE/ACM Trans. Netw. 16(3), 549–561 (2008) CrossRefGoogle Scholar
  14. 113.
    Maymounkov, P., Mazières, D.: Kademlia: A peer-to-peer information system based on the xor metric. In: Revised Papers from the First International Workshop on Peer-to-Peer Systems, IPTPS ’01, pp. 53–65. Springer, London (2002) Google Scholar
  15. 117.
    Mockapetris, P.: RFC 1035: domain names implementation and specification (1987) Google Scholar
  16. 118.
    Moskowitz, R., Nikander, P., Jokela, P.: Host identity protocol architecture. RFC 4423 (2006) Google Scholar
  17. 121.
    Nikander, P., Arkko, J., Ohlman, B.: Host identity indirection infrastructure (hi3). In: The Second Swedish National Computer Networking Workshop (2004) Google Scholar
  18. 126.
    Papadopoulos, F., Krioukov, D., Bogua, M., Vahdat, A.: Greedy forwarding in dynamic scale-free networks embedded in hyperbolic metric spaces. In: INFOCOM, 2010 Proceedings IEEE, pp. 1–9 (2010) CrossRefGoogle Scholar
  19. 131.
    Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content-addressable network. In: SIGCOMM’01: Proceedings ACM Interest Group on Data Communication SIGCOMM 2001, ACM, San Diego (2001) Google Scholar
  20. 134.
    Rhea, S., Godfrey, B., Karp, B., Kubiatowicz, J., Ratnasamy, S., Shenker, S., Stoica, I., Yu, H.: Opendht: a public dht service and its uses. In: Proceedings of SIGCOMM ’05, pp. 73–84. ACM, New York (2005) CrossRefGoogle Scholar
  21. 135.
    Rosenberg, J., Schulzrinne, H., et al.: RFC 3261: session initiation protocol (2002) Google Scholar
  22. 136.
    Rowstron, A., Druschel, P.: Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In: Proceedings of IFIP/ACM Middleware 2001. ACM, Heidelberg (2001) Google Scholar
  23. 137.
    Saltzer, J.: On the naming and binding of network destinations. RFC 1498 Google Scholar
  24. 146.
    Shoch, J.: Inter-network naming, addressing, and routing. In: IEEE COMPCON, pp. 72–79. IEEE, New York (1978) Google Scholar
  25. 149.
    Stoica, I., Adkins, D., Zhuang, S., Shenker, S., Surana, S.: Internet indirection infrastructure. IEEE/ACM Trans. Netw. 12(2), 205–218 (2004) CrossRefGoogle Scholar
  26. 150.
    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) CrossRefGoogle Scholar
  27. 153.
    Sun, S.: Establishing persistent identity using the handle system. In: Tenth International World Wide Web Conference (2001) Google Scholar
  28. 159.
    Vahdat, A., Dahlin, M., Anderson, T., Aggarwal, A.: Active names: flexible location and transport of wide-area resources. In: USITS’99: Proceedings of the 2nd Conference on USENIX Symposium on Internet Technologies and Systems, vol. 2, p. 14. USENIX Association, Berkeley (1999) Google Scholar
  29. 168.
    Zhao, B.Y., Huang, L., Stribling, J., Rhea, S.C., Joseph, A.D., Kubiatowicz, J.D.: Tapestry: a resilient global-scale overlay for service deployment. IEEE J. Sel. Areas Commun. 22(1), 41–53 (2004) CrossRefGoogle Scholar

Copyright information

© Springer-Verlag London 2013

Authors and Affiliations

  • Joud S. Khoury
    • 1
  • Chaouki T. Abdallah
    • 2
  1. 1.Internetwork Research DepartmentRaytheon BBN TechnologiesBostonUSA
  2. 2.Electrical and Computer Engineering DepartmentUniversity of New MexicoAlbuquerqueUSA

Personalised recommendations