Principle: Addresses
Flat address space
- Easy to understand
- But in large distributed environments
- difficult to assign uniquely
- name length becomes a problem for users
Tree (hierarchical) address space
- Easy to assign uniquely (full addresses are paths)
- Maintenance is efficient and effective
- Addresses can be relative to a local environment
- But each resource must have a single name (path)
Directed Acyclic Graph address space
- Solves the single address problem -- multiple paths
- Algorithms/maintenance are much more complex
Hybrid Hierarchical: Tree with Soft Links
- Flexibility of DAG
- Simplicity of tree