Distributed Computing

, Volume 3, Issue 2, pp 51–60 | Cite as

Understanding naming in distributed systems

  • Douglas E. Comer
  • Larry L. Peterson


Naming in distributed systems is modelled as a string translation problem. Viewing names as strings and name resolution mechanisms as syntax directed translators provides a formal handle on the loosely understood concepts associated with naming: we give precise definitions for such informal terminology as name spaces, addresses, routes, source-routing, and implicit-routing; we identify the properties of naming systems, including under what conditions they support unique names, relative names, absolute names, and synonyms; and we discuss how the basic elements of the model can be implemented by name servers.

Key words

Context Name space Name server 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Allman E (1983) SENDMAIL — an internetwork mail router. UNIX Programmer's Manual. 4.2 Berkeley Software Distribution, vol 2, August 1983Google Scholar
  2. Birrell A, Levin R, Needham R, Schroeder M (1982) Grapevine: an exercise in distributed computing. Commun ACM 25:250–273Google Scholar
  3. Cheriton D, Mann T (1984) Uniform access to distributed name interpretation. The 4th Int Conf on Distributed Computing Systems, May 1984Google Scholar
  4. Fowler R (1985) Decentralized object finding using forwarding addresses. Ph. D. dissertation, University of Washington, December 1985Google Scholar
  5. Lantz K, Edighoffer J, Hitson B (1985) Towards a universal directory service. Principles of Distributed Computing, August 1985, pp 250–260Google Scholar
  6. Mockapetris P (1987) Domain names — concepts and facilities. Request for comments 1034, November 1987Google Scholar
  7. Oppen D, Dalal Y (1981) The clearinghouse: a decentralized agent for locating named objects in a distributed environment. Office Products Division, XEROX, October 1981Google Scholar
  8. Peterson L (1988) The profile naming service. ACM Trans Comput Syst 6, 4 November 1988, pp 341–364Google Scholar
  9. Postel J, Sunshine C, Cohen D (1981) The ARPA internet protocol. Computer NetworksGoogle Scholar
  10. Ritchie D, Thompson K (1974) The UNIX time-sharing system. Commun ACM 17:365–375Google Scholar
  11. Schwartz M, Zahorjan J, Notkin D (1987) A name service for evolving heterogeneous systems. Proc 11 th Symp on Operating System Principles, November 1987, pp 52–62Google Scholar
  12. Saltzer J (1978) Naming and binding of objects. In: Lect Notes Comput Sci, vol 60. Springer, New York Berlin Heidelberg, pp 99–208Google Scholar
  13. Saltzer J (1982) On the naming and binding of network destinations. Int Symp on Local Computer Networks, IFIP/T.C.6, April 1982, pp 311–317Google Scholar
  14. Shoch J (1978) Inter-network naming, addressing, and routing. 17th IEEE Comput Soc Int Conf (COMPCON), September 1978, pp 72–79Google Scholar
  15. Tanenbaum A (1981) Computer Networks. Prentice Hall, Englewood Cliffs, NJGoogle Scholar
  16. Terry D (1986) Structure-free name management for evolving distributed environments. 6th Int Conf on Distributed Computing Systems (May 1986) pp 502–508Google Scholar
  17. Tichy W, Ruan Z (1984) Towards a distributed file system. 1984 Summer USENIX Conf Proc, June 1984, pp 87–97Google Scholar
  18. Watson R (1981) Identifiers (naming) in distributed systems. In: Lampson B, Paul M, Siegert H (eds) Distributed system — architecture and implementation. (Lect Notes Comput Sci, pp 191–210) Springer, New York Berlin HeidelbergGoogle Scholar

Copyright information

© Springer-Verlag 1989

Authors and Affiliations

  • Douglas E. Comer
    • 1
  • Larry L. Peterson
    • 2
  1. 1.Department of Computer SciencePurdue UniversityWest LafayetteUSA
  2. 2.Department of Computer ScienceUniversity of ArizonaTucsonUSA

Personalised recommendations