1 / 42

Naming

Naming. Chapter 4. Outline. Naming entities Locating mobile entities Removing unreferenced entities. 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, contiguous disk blocks.

malo
Download Presentation

Naming

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Naming Chapter 4

  2. Outline • Naming entities • Locating mobile entities • Removing unreferenced entities

  3. Name Spaces (1) • A general naming graph with a single root node

  4. Name Spaces (2) • The general organization of the UNIX file system implementation on a logical, contiguous disk blocks

  5. Linking and Mounting (1) • The concept of a symbolic link in a naming graph

  6. Linking and Mounting (2) • Mounting remote name spaces through a specific process protocol

  7. Linking and Mounting (3) • Organization of the DEC Global Name Service

  8. Name Space Distribution (1) • An example partitioning of the DNS name space, including Internet-accessible files, into three layers

  9. Name Space Distribution (2) • A comparison between name servers for implementing nodes from a large-scale name space partitioned into a global layer, as an administrational layer, and a managerial layer

  10. Implementation of Name Resolution (1) • The principle of iterative name resolution

  11. Implementation of Name Resolution (2) • The principle of recursive name resolution

  12. Implementation of Name Resolution (3) • Recursive name resolution of <nl, vu, cs, ftp>. Name servers cache intermediate results for subsequent lookups

  13. Implementation of Name Resolution (4) • The comparison between recursive and iterative name resolution with respect to communication costs

  14. The DNS Name Space • The most important types of resource records forming the contents of nodes in the DNS name space

  15. DNS Implementation (1) • An excerpt from the DNS database for the zone cs.vu.nl

  16. DNS Implementation (2) • Part of the description for the vu.nl domain which contains the cs.vu.nl domain

  17. The X.500 Name Space (1) • A simple example of a X.500 directory entry using X.500 naming conventions

  18. The X.500 Name Space (2) • Part of the directory information tree

  19. The X.500 Name Space (3) • Two directory entries having Host_Name as RDN(Relative Distinguished Name)

  20. Naming versus Locating Entities • Direct, single level mapping between names and addresses • T-level mapping using identities

  21. Forwarding Pointers (1) • The principle of forwarding pointers using (proxy, skeleton) pairs

  22. Forwarding Pointers (2) • Redirecting a forwarding pointer, by storing a shortcut in a proxy

  23. Home-Based Approaches • The principle of Mobile IP

  24. Hierarchical Approaches (1) • Hierarchical organization of a location service into domains, each having an associated directory node

  25. Hierarchical Approaches (2) • An example of storing information of an entity having two addresses in different leaf domains

  26. Hierarchical Approaches (3) • Looking up a location in a hierarchically organized location service

  27. Hierarchical Approaches (4) • An insert request is forwarded to the first node that knows about entity E • A chain of forwarding pointers to the leaf node is created

  28. Pointer Caches (1) • Caching a reference to a directory node of the lowest-level domain in which an entity will reside most of the time

  29. Pointer Caches (2) • A cache entry that needs to be invalidated because it returns a nonlocal address, while such an address is available

  30. Scalability Issues • The scalability issues related to uniformly placing subnodes of a partitioned root node across the network covered by a location service

  31. The Problem of Unreferenced Objects • An example of a graph representing objects containing references to each other

  32. Reference Counting (1) • The problem of maintaining a proper reference count in the presence of unreliable communication

  33. Reference Counting (2) • Copying a reference to another process and incrementing the counter too late • A solution

  34. Advanced Referencing Counting (1) • The initial assignment of weights in weighted reference counting • Weight assignment when creating a new reference

  35. Advanced Referencing Counting (2) • Weight assignment when copying a reference

  36. Advanced Referencing Counting (3) • Creating an indirection when the partial weight of a reference has reached 1

  37. Advanced Referencing Counting (4) • Creating and copying a remote reference in generation reference counting

  38. Steps of Tracing in Groups • Initial marking, in which only skeletons are marked • Intraprocess propagation of marks from skeletons to proxies • Interprocess propagation of marks from proxies to skeletons • Stabilization by repetition of the previous two steps • Garbage reclamation

  39. Tracing in Groups (1) • Initial marking of skeletons

  40. Tracing in Groups (2) • After local propagation in each process

  41. Tracing in Groups (3) • Final marking

  42. Thanks for Your Attention!

More Related