The resiliency of a network is its ability to remain effectively functioning also when any of its nodes or links fails. However, to reduce operational and set-up costs, a network should be small in size, and this conflicts with the requirement of being resilient. In this paper we address this trade-off for the prominent case of the broadcasting routing scheme, and we build efficient (i.e., sparse and fast) fault-tolerant approximate shortest-path trees, for both the edge and vertex single-failure case. In particular, for an n-vertex non-negatively weighted graph, and for any constant (Formula presented.), we design two structures of size (Formula presented.) which guarantee (Formula presented.)-stretched paths from the selected source also in the presence of an edge/vertex failure. This favorably compares with the currently best known solutions, which are for the edge-failure case of size O(n) and stretch factor 3, and for the vertex-failure case of size (Formula presented.) and stretch factor 3. Moreover, we also focus on the unweighted case, and we prove that an ordinary spanner can be slightly augmented in order to build efficient fault-tolerant approximate breadth-first-search trees.

Fault-Tolerant Approximate Shortest-Path Trees / Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido. - In: ALGORITHMICA. - ISSN 0178-4617. - (2017), pp. 1-24. [10.1007/s00453-017-0396-z]

Fault-Tolerant Approximate Shortest-Path Trees

Bilò, Davide;
2017-01-01

Abstract

The resiliency of a network is its ability to remain effectively functioning also when any of its nodes or links fails. However, to reduce operational and set-up costs, a network should be small in size, and this conflicts with the requirement of being resilient. In this paper we address this trade-off for the prominent case of the broadcasting routing scheme, and we build efficient (i.e., sparse and fast) fault-tolerant approximate shortest-path trees, for both the edge and vertex single-failure case. In particular, for an n-vertex non-negatively weighted graph, and for any constant (Formula presented.), we design two structures of size (Formula presented.) which guarantee (Formula presented.)-stretched paths from the selected source also in the presence of an edge/vertex failure. This favorably compares with the currently best known solutions, which are for the edge-failure case of size O(n) and stretch factor 3, and for the vertex-failure case of size (Formula presented.) and stretch factor 3. Moreover, we also focus on the unweighted case, and we prove that an ordinary spanner can be slightly augmented in order to build efficient fault-tolerant approximate breadth-first-search trees.
2017
Fault-Tolerant Approximate Shortest-Path Trees / Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido. - In: ALGORITHMICA. - ISSN 0178-4617. - (2017), pp. 1-24. [10.1007/s00453-017-0396-z]
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11388/202214
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 21
  • ???jsp.display-item.citation.isi??? 4
social impact