Distributed Constructions of Dual-Failure Fault-Tolerant Distance Preservers
Merav Parter

TL;DR
This paper introduces distributed algorithms for constructing fault-tolerant distance preservers and +2 additive spanners resilient to two edge failures, advancing the understanding of fault tolerance in distributed network structures.
Contribution
It presents the first distributed algorithms for building two-fault resilient distance preservers and spanners, extending previous single-fault solutions to more robust fault tolerance.
Findings
Distributed algorithms for two-fault resilient distance preservers.
Balanced approach between edge congestion and sparsity.
No prior sublinear-round algorithms for such structures.
Abstract
Fault tolerant distance preservers (spanners) are sparse subgraphs that preserve (approximate) distances between given pairs of vertices under edge or vertex failures. So-far, these structures have been studied mainly from a centralized viewpoint. Despite the fact fault tolerant preservers are mainly motivated by the error-prone nature of distributed networks, not much is known on the distributed computational aspects of these structures. In this paper, we present distributed algorithms for constructing fault tolerant distance preservers and additive spanners that are resilient to at most \emph{two edge} faults. Prior to our work, the only non-trivial constructions known were for the \emph{single} fault and \emph{single source} setting by [Ghaffari and Parter SPAA'16]. Our key technical contribution is a distributed algorithm for computing distance preservers w.r.t. a subset…
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.
