Effective Edge-Fault-Tolerant Single-Source Spanners via Best (or Good) Swap Edges

  title={Effective Edge-Fault-Tolerant Single-Source Spanners via Best (or Good) Swap Edges},
  author={Davide Bil{\`o} and Feliciano Colella and Luciano Gual{\`a} and Stefano Leucci and Guido Proietti},
Computing all best swap edges (ABSE) of a spanning tree T of a given n-vertex and m-edge undirected and weighted graph G means to select, for each edge e of T, a corresponding non-tree edge f, in such a way that the tree obtained by replacing e with f enjoys some optimality criterion (which is naturally defined according to some objective function originally addressed by T). Solving efficiently an ABSE problem is by now a classic algorithmic issue, since it conveys a very successful way of… 

An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner

A very efficient solution is provided, running in O(n^2 \log ^4 n) time, which drastically improves (almost by a quadratic factor in n in dense graphs) on the previous known best result.

A Distributed Minimum Spanning Tree Based on all Best Swap Edges in CRN

The article acquainted and resolved issues related to all finest swap edges of MST in a cognitive radio network and proposed an efficient algorithm in CRN, which aims to lists all finest feasible edge and applies swapping of edges in order to find MSTIn CRN.

A Novel Algorithm for the All-Best-Swap-Edge Problem on Tree Spanners

This work designs an O(n^2) time and space algorithm that computes a best swap edge of every tree edge, and addresses the fault-tolerant scenario in which each edge of a given tree spanner may temporarily fail and has to be replaced by abest swap edge, i.e. an edge that reconnects T-e at a minimum stretch factor.



Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree

This paper focuses its attention on the relevant cases in which k=O(1) and k=n, which model realistic communication paradigms, and improves the above result by presenting an $\widetilde{O}(m)$ time and linear space algorithm.

Swapping a failing edge of a shortest paths tree by minimizing the average stretch factor

Swapping a Failing Edge of a Single Source Shortest Paths Tree Is Good and Fast

This paper presents efficient algorithms for the problem of finding a best swap edge, for each edge e of S(r) , with respect to several objectives.

Sparse Fault-Tolerant BFS Trees

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 surviving part of) G.

Linear Time Distributed Swap Edge Algorithms

A novel technique is presented that addresses the all best swap edges problem in a distributed environment from a time perspective that works in linear time with respect to the height h of T for a number of different criteria, while retaining the optimal number of messages.

A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree

This work considers a two-edge connected, non-negatively real-weighted graph G with n vertices and m edges, and a single-source shortest paths tree (SPT) of G rooted at an arbitrary vertex, and presents a time algorithm to find a best swap edge for every edge of the SPT.

Fault-Tolerant Approximate Shortest-Path Trees

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.

Point-of-Failure Shortest-Path Rerouting: Computing the Optimal Swap Edges Distributively

This work presents two simple and efficient distributed algorithms for computing the optimal swap edges of a shortest-path tree, one of which uses messages containing a constant amount of information, while the other is tailored for systems that allow long messages.

The Swap Edges of a Multiple-Sources Routing Tree

An O(mlog n+n2)-time algorithm for the case of two sources and an O(mn)-time algorithms for the cases of more than two sources are proposed, where m and n are the numbers of edges and vertices of G, respectively.

Sensitivity Analysis of Minimum Spanning Trees and Shortest Path Trees