分布式系统英文教案chap-04_zy.pptVIP

Naming Chapter 4 Table of Contents Concepts Locate mobile entities Garbage collection 4.1 Naming Entities What’s the most important requirement for a name? Can you image the longest English name in the world? 4.1 Naming Entities Definition A name in a distributed system is a string of bits or characters that is used to refer to an entity. An access point is yet special kind of entity to be used to access some entity, i.e. phone #. The name of an access point is called an address. 4.1 Naming Entities Identifier: uniquely identify an entity. An identifier refers to at most one entity Each entity is referred to by at most one identifier An identifier always refers to the same entity (i.e., it is never reused) phone #, passport # 4.1 Naming Entities Addresses and identifiers are normally represented in machine-readable form, bit strings. A human-friendly name is generally represented as a character sting. 4.1 Naming Entities Name spaces Labeled (acyclic) directed graph Leaf node: 0 outgoing edges Directory node: n outgoing edges Root node Path name Form: N:label-1, label-2, …, label-n Absolute path name Relative path name Name Spaces (1) A general naming graph with a single root node. Name Spaces (2) The general organization of the UNIX file system implementation on a logical disk of contiguous disk blocks. 4.1 Naming Entities Name resolution The process of looking up a name. N:label-1, label-2, …, label-n Closure Mechanism Knowing how and where to start name resolution. 4340880245810362 /home/yangzhao/movie $HOME 4.1 Naming Entities Name resolution Linking An alias is another name for the same entity, for example, an environment variable. Alias implementation Hard links: multiple absolute paths names to the same node Symbolic link: storing an absolute path name in the leaf node Why aliasing? Linking and Mounting (1) The concept of a symbolic link explained in a naming graph. 4.1 Naming Entities Name resolution Mounting Let a directory node store the identi