The Community for Technology Leaders
Green Image
<p>Consider a network consisting of units connected by links in which some units could be faulty. Suppose each unit has a message which must be transmitted to all other (fault-free) units. We present an algorithm for doing this in a network operating in a fully distributed manner that requires at most 3n logn+O(n) message transmissions by fault-free units. Among other things, our result can be used to devise an algorithm for distributed system level diagnosis which is more efficient than the best currently known algorithm for this purpose.</p>
distributed algorithms; message passing; fault tolerant computing; reliability; failure analysis; reliability theory; communication complexity; information dissemination; distributed systems; faulty units; fault-free units; distributed system level diagnosis; election; spanning tree; distributed algorithm.

S. Hakimi and A. Bagchi, "Information Dissemination in Distributed Systems with Faulty Units," in IEEE Transactions on Computers, vol. 43, no. , pp. 698-710, 1994.
92 ms
(Ver 3.3 (11022016))