Understanding naming in distributed systems

Douglas E. Comer, Larry L. Peterson

Research output: Contribution to journalArticlepeer-review

13 Scopus citations


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.

Original languageEnglish (US)
Pages (from-to)51-60
Number of pages10
JournalDistributed Computing
Issue number2
StatePublished - Jun 1989
Externally publishedYes


  • Context
  • Name server
  • Name space

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Hardware and Architecture
  • Computer Networks and Communications
  • Computational Theory and Mathematics


Dive into the research topics of 'Understanding naming in distributed systems'. Together they form a unique fingerprint.

Cite this