A Name Resolution Model for Distributed Systems
Douglas E. Comer, Larry J. Peterson · Purdue e-Pubs (Purdue University System) · 1984
Naming is an important issue in any programming system, especially when the system spans multiple computers. We present a model that describes names and Dame resolution in distributed systems, in which we view names to be purely syntactic entities, and name resolution to be a syntaxdriven operation. We use the model to formally define familiar concepts and terminology involved in naming. We also describe the role of name servers in name resolution. Examples from computer mail, a distributed application that uses many forms of names, illustrate our model. Tbis project is supported in part by grants from Lbe National Science Foundalion (MC5-821917B) and SUN Microsystems Incorporated.