The Multi-Tree Approach To Reliability In Distributed Networks

Authors:
A. Itai;M. Rodeh
Affiliations:
Technion;-
Venue:
SFCS '84 Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984
Year:
1984

Citing 0
Cited 5

Fast On-Line/Off-Line Algorithms for Optimal Reinforcement of a Network and Its Connections with Principal Partition

FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
Probing multiple node-disjoint paths using multi-labelled tree traversing

International Journal of Autonomous and Adaptive Communications Systems
ILP-based design of survivable broadcast trees

HPSR'09 Proceedings of the 15th international conference on High Performance Switching and Routing
Independent spanning trees on twisted cubes

Journal of Parallel and Distributed Computing
A counterexample for the proof of implication conjecture on independent spanning trees

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

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