Distance-dependent distributed directories

DOI10.1006/INCO.1993.1020MaRDI QIDQ2365761zbMATH OpenOpenAlexFDO

Authors David Peleg

Publication date 29 June 1993

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/inco.1993.1020

zbMATH Keywords

accessibilitydirectory serversdistributed systemsgraph- coveringnetwork

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• Distributed object location in a dynamic network
• Low complexity variants of the arrow distributed directory
• An analysis framework for distributed hierarchical directories
• Distributed Paging for General Networks
• scientific article; zbMATH DE number 873153

Cited in

(8)

• 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)