Distributed Constructions of Dual-Failure Fault-Tolerant Distance Preservers

10/04/2020
by   Merav Parter, et al.
0

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 +2 additive spanners that are resilient to at most two edge faults. Prior to our work, the only non-trivial constructions known were for the single fault and 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 S of source vertices, resilient to two edge faults. The output structure contains a BFS tree BFS(s,G ∖{e_1,e_2}) for every s ∈ S and every e_1,e_2 ∈ G. The distributed construction of this structure is based on a delicate balance between the edge congestion (formed by running multiple BFS trees simultaneously) and the sparsity of the output subgraph. No sublinear-round algorithms for constructing these structures have been known before.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/22/2021

Pairwise Reachability Oracles and Preservers under Failures

In this paper, we consider reachability oracles and reachability preserv...
research
04/27/2020

New Extremal bounds for Reachability and Strong-Connectivity Preservers under failures

In this paper, we consider the question of computing sparse subgraphs fo...
research
09/13/2023

Fault-Tolerant Spanners against Bounded-Degree Edge Failures: Linearly More Faults, Almost For Free

We study a new and stronger notion of fault-tolerant graph structures wh...
research
12/14/2018

A Trivial Yet Optimal Solution to Vertex Fault Tolerant Spanners

We give a short and easy upper bound on the worst-case size of fault tol...
research
09/07/2022

Õptimal Vertex Fault-Tolerant Spanners in Õptimal Time: Sequential, Distributed and Parallel

We (nearly) settle the time complexity for computing vertex fault-tolera...
research
07/20/2022

Fault-Tolerant Distributed Directories

A distributed directory is an overlay data structure on a graph G that h...
research
09/17/2023

An Auto-Parallelizer for Distributed Computing in Haskell

One of the main challenges in distributed computing is building interfac...

Please sign up or login with your details

Forgot password? Click here to reset