Communication complexity of fault-tolerant information diffusion

This paper considers problems of fault-tolerant information diffusion in a network with cost function. We show that the problem of determining the minimum cost necessary to perform fault-tolerant gossiping among a given set of participants is NP-hard and given approximate (with respect to the cost) algorithms. We also analyze the communication time of fault-tolerant gossiping algorithms. Finally, we give an optimal cost fault tolerant broadcasting algorithm and apply our results to the atomic commitment problem.<<ETX>>

[1]  Cynthia Dwork,et al.  Patterns of communication in consensus protocols , 1984, PODC '84.

[2]  R. Bumby.  A Problem with Telephones , 1981 .

[3]  S. Louis Hakimi,et al.  Parallel algorithms for information dissemination by packets , 1991, Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing.

[4]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[5]  Dana S. Richards,et al.  Reliable broadcasting , 1994, Discret. Appl. Math..

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

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

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

[9]  Vassos Hadzilacos,et al.  A knowledge-theoretic analysis of atomic commitment protocols , 1987, PODS '87.

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

[11]  Luisa Gargano,et al.  Fault - tolerant hypercube broadcasting via information dispersal , 1993, Networks.

[12]  Ákos Seress.  Gossiping old ladies , 1983, Discret. Math..

[13]  S. Lennart Johnsson,et al.  Optimum Broadcasting and Personalized Communication in Hypercubes , 1989, IEEE Trans. Computers.

[14]  David Peleg.  A Note on Optimal Time Broadcast in Faulty Hypercubes , 1995, J. Parallel Distributed Comput..

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

[16]  David W. Krumme,et al.  Gossiping in Minimal Time , 1992, SIAM J. Comput..

[17]  S. Louis Hakimi,et al.  Gossigping in a Distributed Network , 1993, IEEE Trans. Computers.

[18]  Robert E. Tarjan,et al.  Augmentation Problems , 1976, SIAM J. Comput..

[19]  Daniel J. Kleitman,et al.  Further gossip problems , 1980, Discret. Math..

[20]  Shimon Even,et al.  On the number of rounds necessary to disseminate information , 1989, SPAA '89.

[21]  Pierre Fraigniaud,et al.  Broadcasting and Gossiping in de Bruijn Networks , 1994, SIAM J. Comput..

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

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

[24]  Douglas B. West.  A class of solutions to the gossip problem, part I , 1982, Discret. Math..

[25]  Brenda S. Baker,et al.  Gossips and telephones , 1972, Discret. Math..

[26]  David W. Krumme.  Fast Gossiping for the Hypercube , 1992, SIAM J. Comput..

[27]  E. C. Milner,et al.  A Cure for the Telephone Disease , 1972, Canadian Mathematical Bulletin.

[28]  Quentin F. Stout,et al.  Intensive Hypercube Communication. Prearranged Communication in Link-Bound Machines , 1990, J. Parallel Distributed Comput..

[29]  Ouri Wolfson,et al.  The Communication Complexity of Atomic Commitment and of Gossiping , 1991, SIAM J. Comput..

[30]  Yousef Saad,et al.  Data communication in parallel architectures , 1989, Parallel Comput..