Restorable Shortest Path Tiebreaking for Edge-Faulty Graphs

02/19/2021
by   Greg Bodwin, et al.
0

The restoration lemma by Afek, Bremler-Barr, Kaplan, Cohen, and Merritt [Dist. Comp. '02] proves that, in an undirected unweighted graph, any replacement shortest path avoiding a failing edge can be expressed as the concatenation of two original shortest paths. However, the lemma is tiebreaking-sensitive: if one selects a particular canonical shortest path for each node pair, it is no longer guaranteed that one can build replacement paths by concatenating two selected shortest paths. They left as an open problem whether a method of shortest path tiebreaking with this desirable property is generally possible. We settle this question affirmatively with the first general construction of restorable tiebreaking schemes. We then show applications to various problems in fault-tolerant network design. These include a faster algorithm for subset replacement paths, more efficient fault-tolerant (exact) distance labeling schemes, fault-tolerant subset distance preservers and +4 additive spanners with improved sparsity, and fast distributed algorithms that construct these objects. For example, an almost immediate corollary of our restorable tiebreaking scheme is the first nontrivial distributed construction of sparse fault-tolerant distance preservers resilient to three faults.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/14/2023

Improved Shortest Path Restoration Lemmas for Multiple Edge Failures: Trade-offs Between Fault-tolerance and Subpaths

The restoration lemma is a classic result by Afek, Bremler-Barr, Kaplan,...
research
09/10/2020

Fault-Tolerant Edge-Disjoint Paths – Beyond Uniform Faults

The overwhelming majority of survivable (fault-tolerant) network design ...
research
06/09/2014

Fault-Tolerant, but Paradoxical Path-Finding in Physical and Conceptual Systems

We report our initial investigations into reliability and path-finding b...
research
05/01/2018

Generic Single Edge Fault Tolerant Exact Distance Oracle

Given an undirected unweighted graph G and a source set S of |S| = σ so...
research
08/12/2020

Deterministic Replacement Path Covering

In this article, we provide a unified and simplified approach to derando...
research
10/13/2022

Beeping Shortest Paths via Hypergraph Bipartite Decomposition

Constructing a shortest path between two network nodes is a fundamental ...
research
02/14/2021

Fault-Tolerant Distance Labeling for Planar Graphs

In fault-tolerant distance labeling we wish to assign short labels to th...

Please sign up or login with your details

Forgot password? Click here to reset