Adaptive Broadcasting with Faulty Nodes

We consider broadcasting from a fault-free source to all nodes of a completely connected n-node network in the presence of k faulty nodes. Every node can communicate with at most one other node in a unit of time and during this period every pair of communicating nodes can exchange information packets. Faulty nodes cannot send information. Broadcasting is adaptive, i.e., a node schedules its next communication on the basis of information currently available to it. Assuming that the fraction of faulty nodes is bounded by a constant smaller than 1, we construct a broadcasting algorithm working in worst-case time O(log2 n).

[1]  Luisa Gargano.  Tighter time bounds on fault-tolerant broadcasting and gossiping , 1992, Networks.

[2]  Krzysztof Diks,et al.  Waking up an anonymous faulty network from a single source , 1994, 1994 Proceedings of the Twenty-Seventh Hawaii International Conference on System Sciences.

[3]  Andrzej Pelc,et al.  Broadcasting with a Bounded Fraction of Faulty Nodes , 1997, J. Parallel Distributed Comput..

[4]  Edward R. Scheinerman,et al.  Optimal and near-optimal broadcast in random graphs , 1989, Discret. Appl. Math..

[5]  Daniel Bienstock.  Broadcasting with random faults , 1988, Discret. Appl. Math..

[6]  M. Hawrylycz,et al.  Telephone problems with failures , 1986 .

[7]  Pierre Fraigniaud,et al.  Methods and problems of communication in usual networks , 1994, Discret. Appl. Math..

[8]  Alejandro A. Schäffer,et al.  Time bounds on fault-tolerant broadcasting , 1989, Networks.

[9]  Krzysztof Diks,et al.  Sparse Networks Supporting Efficient Reliable Broadcasting , 1993, Nord. J. Comput..

[10]  Luisa Gargano,et al.  Minimum Time Broadcast Networks Tolerating a Logarithmic Number of Faults , 1992, SIAM J. Discret. Math..

[11]  A. Schäffer,et al.  On gossiping with faulty telephone lines , 1987 .

[12]  Arthur L. Liestman.  Fault-tolerant broadcast graphs , 1985, Networks.

[13]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[14]  Parameswaran Ramanathan,et al.  Reliable Broadcast in Hypercube Multicomputers , 1988, IEEE Trans. Computers.

[15]  Arthur L. Liestman,et al.  A survey of gossiping and broadcasting in communication networks , 1988, Networks.

[16]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[17]  Krzysztof Diks,et al.  Optimal broadcasting in faulty hypercubes , 1991, [1991] Digest of Papers. Fault-Tolerant Computing: The Twenty-First International Symposium.