Distance-dependent distributed directories
Distributed systems often make use of directory servers enabling the storage and retrieval of global information in the network. In many practical situations, the data is directly related to particular sites of the network, and therefore the desired retrieval characteristics are dependent on the network topology; for example, priority is given to having high accessibility to data generated in nearby locations. The paper defines the concept of distance-dependent directories, and then proposes appropriate accessibility measures and presents strategies for constructing such directories. The construction methods are based on efficient solutions to a new type of graph-covering problem. As an application, it is shown how to use a distance-dependent directory for implementing a name-server component for a routing scheme.
- Low complexity variants of the arrow distributed directory
- Sparse covers for planar graphs and graphs that exclude a fixed minor
- An analysis framework for distributed hierarchical directories
- A tale of two directories: Implementing distributed shared objects in Java
- WDCS: a weight-based distributed coordinate system
- Space-efficient path-reporting approximate distance oracles
- Compact roundtrip routing with topology-independent node names
- On sparse covers of minor free graphs, low dimensional metric embeddings, and other applications
This page was built for publication: Distance-dependent distributed directories
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2365761)
