| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
Name Spaces and Name Architectures (Flat and Hierarchical) (Page 1 of 3) The main idea of a name system is to provide a way to identify devices using symbolic names. Like any identification mechanism, before we can use the system we must define the way that identification will be performed. Numeric addressing schemes (like IP addresses) have rules for how addresses are created, and assign addresses to each device from their address space. In a similar way, devices in a name system are given names from the system's name space. Of the three main functional components of a name system, the name space is the most abstract. It is also the most fundamental part of the system, since it actually describes how the names are created. There are several aspects to what the name space defines in a name system:
The concepts of name size and name syntax are relatively straight-forward. The last item, name architecture, is probably the most important differentiating characteristic of name systems. For this reason, name spaces are sometimes even called name architectures. The architecture of the name space determines whether names are assigned and used as a simple unstructured set of symbols, or whether they have a more complex internal structure. In the latter case, the name space also must define how elements of a particular name are related to each other. Theoretically, many different name architectures are possible. In practice, most fall into one of two categories: flat and hierarchical architectures. Names are assigned as a sequence of symbols that are interpreted as a single, whole label without any internal structure. There is no clear relationship between any name and any other name. An example of this sort of architecture would be a name system where computers are given unstructured names like Engineering Workstation 1 or Joanne's PC, as shown in the example in Figure 232.
Home - Table Of Contents - Contact Us The TCP/IP Guide (http://www.TCPIPGuide.com) Version 3.0 - Version Date: September 20, 2005 © Copyright 2001-2005 Charles M. Kozierok. All Rights Reserved. Not responsible for any loss resulting from the use of this site. |