Papers
Topics
Authors
Recent
Search
2000 character limit reached

Fault-Tolerant Labeling and Compact Routing Schemes

Published 1 Jun 2021 in cs.DS and cs.DC | (2106.00374v1)

Abstract: The paper presents fault-tolerant (FT) labeling schemes for general graphs, as well as, improved FT routing schemes. For a given nn-vertex graph GG and a bound ff on the number of faults, an ff-FT connectivity labeling scheme is a distributed data structure that assigns each of the graph edges and vertices a short label, such that given the labels of the vertices ss and tt, and at most ff failing edges FF, one can determine if ss and tt are connected in G∖FG \setminus F. The primary complexity measure is the length of the individual labels. Since their introduction by [Courcelle, Twigg, STACS '07], compact FT labeling schemes have been devised only for a limited collection of graph families. In this work, we fill in this gap by proposing two (independent) FT connectivity labeling schemes for general graphs, with a nearly optimal label length. This serves the basis for providing also FT approximate distance labeling schemes, and ultimately also routing schemes. Our main results for an nn-vertex graph and a fault bound ff are: -- There is a randomized FT connectivity labeling scheme with a label length of O(f+log⁡n)O(f+\log n) bits, hence optimal for f=O(log⁡n)f=O(\log n). This scheme is based on the notion of cycle space sampling [Pritchard, Thurimella, TALG '11]. -- There is a randomized FT connectivity labeling scheme with a label length of O(log⁡3n)O(\log^3 n) bits (independent of the number of faults ff). This scheme is based on the notion of linear sketches of [Ahn et al., SODA '12]. -- For k≥1k\geq 1, there is a randomized routing scheme that routes a message from ss to tt in the presence of a set FF of faulty edges, with stretch O(∣F∣2k)O(|F|^2 k) and routing tables of size O~(f3n1/k)\tilde{O}(f^3 n^{1/k}). This significantly improves over the state-of-the-art bounds by [Chechik, ICALP '11], providing the first scheme with sub-linear FT labeling and routing schemes for general graphs.

Authors (2)
Citations (22)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.