Subscribe

Singer Island, FL

Oct. 24, 1984 to Oct. 26, 1984

ISBN: 0-8186-0591-X

pp: 137-147

A. Itai , Technion

ABSTRACT

Consider a network of asynchronous processors communicating by sending messages over unreliable lines. There are many advantages to restrict all communications to a spanning tree. To overcome the possible failure of k<k edges, we describe a communication protocol which uses k rooted spanning trees having the property that for every vertex v the paths from v to the root are edge-disjoint. A linear algorithm to find two such trees in a 2 edge-connected graph is described. This algorithm has a distributed version which finds the two trees even when a single edge fails during their construction. Finally, a method is given to transform centralized algorithms to distributed, reliable and efficient ones.

CITATION

A. Itai,
M. Rodeh,
"The Multi-Tree Approach To Reliability In Distributed Networks",

*FOCS*, 1984, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science 1984, pp. 137-147, doi:10.1109/SFCS.1984.715910