Fault-Tolerant Distributed Directories
Judith Beesterm\"oller, Costas Busch, Roger Wattenhofer

TL;DR
This paper studies the design of fault-tolerant distributed directories built on hierarchical graph partitions, analyzing their robustness and performance degradation under edge failures, and proposing mechanisms for recovery and maintenance.
Contribution
It introduces a fault-tolerant hierarchical directory structure that maintains functionality and bounds performance degradation despite edge failures in the underlying graph.
Findings
Directory path dilation increases by factor f under failures
Publish and lookup message complexity increases by factor f
Hierarchy depth increases with number of failures
Abstract
A distributed directory is an overlay data structure on a graph that helps to access a shared token . The directory supports three operations: publish, to announce the token, lookup, to read the contents of the token, and move, to get exclusive update access to the token. The directory is built upon a hierarchical partition of the graph using either weak or strong clusters. The main mechanism is the maintenance of a directory path that starts at the root node in the hierarchy and points to the current owner of the token. In the literature, there are known directory algorithms based on hierarchical graph structures, but none of them have considered failures. Given a hierarchical partition, we consider the impact of edge failures on the functionality and performance of the distributed directory. The edge failures may result in the splitting of clusters into up to …
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
