Sparse Fault-Tolerant BFS Trees

@inproceedings{Parter2013SparseFB,
  title={Sparse Fault-Tolerant BFS Trees},
  author={Merav Parter and David Peleg},
  booktitle={ESA},
  year={2013}
}
A fault-tolerant structure for a network is required to continue functioning following the failure of some of the network’s edges or vertices. This paper considers breadth-first search (BFS) spanning trees, and addresses the problem of designing a sparse fault-tolerant BFS tree, or FT-BFS tree for short, namely, a sparse subgraph T of the given network G such that subsequent to the failure of a single edge or vertex, the surviving part T′ of T still contains a BFS spanning tree for (the… 
Fault Tolerant Approximate BFS Trees
TLDR
This paper addresses the problem of designing a fault-tolerant (α, β) approximate BFS tree (or FT-ABFS tree for short), namely, a subgraph H of the given network G such that subsequent to the failure of a single edge, the surviving part of H still contains an approximate B FS spanning tree for (the surviving parts of) G.
Fault Tolerant Approximate BFS Structures
TLDR
This paper addresses the problem of designing a fault-tolerant (α, β) approximate BFS structure (or FT-ABFSstructure for short), namely, a subgraph H of the network G such that subsequent to the failure of some subset F of edges or vertices, the surviving part of H still contains an approximate B FS spanning tree for (the surviving parts of) G.
Fault-Tolerant Approximate BFS Structures
TLDR
It is proved that there exists a (polynomial-time constructible) (3f, flog n) FT-ABFS structure with O(f n) edges that is resilient against f faults, and an interesting dichotomy between multiplicative and additive spanners is demonstrated.
Dual Failure Resilient BFS Structure
TLDR
The structural analysis provided in this paper may decrease the barrier for understanding the general case of f ≥ 2 faults and pave the way to the future design of f-fault resilient structures for f ≥ 1 and multiple sources S ⊆ V.
Effective Edge-Fault-Tolerant Single-Source Spanners via Best (or Good) Swap Edges
TLDR
This paper solves the ABSE problem for the case in which T is a single-source shortest-path tree of G, and two selected swap criteria aim to minimize either the maximum or the average stretch in the swap tree of all the paths emanating from the source.
Fault-Tolerant Approximate Shortest-Path Trees
TLDR
This paper builds efficient (i.e., sparse and fast) fault-tolerant approximate shortest-path trees, for both the edge and vertex single-failure case, and proves that an ordinary spanner can be slightly augmented in order to build efficient fault- tolerance approximate breadth-first-search trees.
Efficient Oracles and Routing Schemes for Replacement Paths
TLDR
This paper presents several efficient constructions of a DSO for maintaining S x T distances under single edge (or vertex) faults, and shows a family of DSOs that exhibits a tradeoff between the additive stretch and the size of the oracle.
Near-Optimal Distributed Algorithms for Fault-Tolerant Tree Structures
TLDR
The time complexity of the algorithms presented are nearly optimal in the following strong sense: they almost match even the lower bounds of constructing (basic) BFS and MST trees.
Approximate Single-Source Fault Tolerant Shortest Path
TLDR
This article addresses several variants of the problem of maintaining the (1+ε)-approximate shortest path from s to each vϵ V in the presence of a failure of an edge or a vertex and presents two distributed algorithms.
Approximate Single Source Fault Tolerant Shortest Path
TLDR
This paper addresses several variants of the problem of maintaining the (1 + ∈)-approximate shortest path from s to each v ∈ V in the presence of a failure of an edge or a vertex and shows that the size of the subgraph H is optimal (up to logarithmic factors) by proving a lower bound of Ω(nL/∈) edges.
...
...

References

SHOWING 1-10 OF 40 REFERENCES
Fault-tolerant compact routing schemes for general graphs
Fault-tolerant spanners for general graphs
TLDR
An f-vertex fault tolerant (2k-1)-spanner of size O(f <sup>2</sup> k<sup>f+1</Sup> · n<sup><sup>1+1/k</sup>) (only f times larger than standard spanners) is presented.
Replacement Paths via Fast Matrix Multiplication
  • O. Weimann, R. Yuster
  • Computer Science, Mathematics
    2010 IEEE 51st Annual Symposium on Foundations of Computer Science
  • 2010
TLDR
For an n-vertex graph with integral edge-lengths between -M and M, this work gives a randomized algorithm that uses fast matrix multiplication and is sub-cubic for appropriate values of M and shows how to construct a distance sensitivity oracle in the same time bounds.
Efficient algorithms for constructing fault-tolerant geometric spanners
TLDR
This paper presents an algorithm with running time O(n logdB1 n + kn log log n + k2n) that constructs a spanner with O(k2n), whose total edge length is bounded by G(2) times the weight of a miuimum spanning tree of S, and that is resilient to k edge or vertex faults.
Improved Distance Sensitivity Oracles via Fast Single-Source Replacement Paths
TLDR
This paper presents the first distance sensitivity oracle that achieves simultaneously subcubic preprocessing time and sublinear query time for integer weights in the interval [-M, M], and matches the best known runtime for the simpler replacement paths problem in which both the source s and the target t are fixed.
New Results of Fault Tolerant Geometric Spanners
TLDR
A construction of a k-vertex fault tolerant spanner with O(kn) edges which is a tight bound and a more natural but stronger definition of k-edge fault tolerance which not necessarily can be satisfied if one allows only simple edges between the points of S.
f-Sensitivity Distance Oracles and Routing Schemes
TLDR
This paper presents an efficiently constructible f-sensitivity distance oracle that given a triplet (s,t,F), where s and t are vertices and F is a set of forbidden edges such that |F|≤f, returns an estimate of the distance between s andT in G(V,E∖F), and is the first to consider approximate oracles for general graphs.
Fault-Tolerant Geometric Spanners
TLDR
A greedy algorithm is presented that for any t > 1 and any non-negative integer k, constructs a k-fault-tolerant t-spanner in which every vertex is of degree O(k) and whose total cost is O( k2) times the cost of the minimum spanning tree; these bounds are asymptotically optimal.
Oracles for Distances Avoiding a Failed Node or Link
TLDR
A deterministic oracle with constant query time for this problem that uses $O (n^2\log n)$ space, where $n$ is the number of vertices in $G$ and the construction time for the oracle is $O(mn^{2} + n^{3}\ log n)$.
Dual-failure distance and connectivity oracles
TLDR
The sheer complexity of the algorithm suggests that moving beyond dual-failures will require a fundamentally different approach to the problem, and it may yet be possible to find distance/connectivity oracles capable of handling any fixed number of failures.
...
...