This Article 
 Bibliographic References 
 Add to: 
Gossiping in a Distributed Network
February 1993 (vol. 42 no. 2)
pp. 253-256

Consider a network in which each unit initially knows only its own identity and the identity of its immediate neighbors. Suppose each unit has a message intended for all other units. The authors give a distributed algorithm to accomplish this in point-to-point networks which is optimal in the number of transmissions it requires. They also show that this algorithm accomplishes this efficiently for broadcast (radio) networks, although the problem of finding a solution with the least number of transmissions, in broadcast networks, is shown to be NP-hard.

[1] M. C. Golumbic, "The general gossip problem," IBM Res. Rep. 4977, 1974.
[2] F. Harary,Graph Theory. Reading, MA: Addison-Wesley, 1969.
[3] F. Harary and A. J. Schwenk, "The communication problem on graphs and digraphs,"J. Franklin Institute, vol. 297, pp. 491-495, 1974.
[4] S. M. Hedetniemi, S. T. Hedetniemi, and A. L. Liestman, "A survey of gossiping and broadcasting in communication networks,"Networks, vol. 18, no. 4, pp. 319-349, Winter 1988.
[5] N. Alan, A. Bar-Noy, N. Linial, and D. Peleg, "On the complexity of radio communication," inProc. 21st ACM Symp. Theory Comput, 1989.
[6] R. Bar-Yehuda, O. Goldreich, and A. Itai, "On the time-complexity of broadcast in radio networks: An exponential gap between determinism and randomization," inProc. 5th ACM Symp. Principles Distributed Comput., 1986, pp. 98-107.
[7] I. Chlamtac and S. Kutten, "On broadcasting in radio networks problem analysis and protocol design,"IEEE Trans. Commun., vol. COM-33, Dec. 1985.
[8] I. Chlamtac and S. Kutten, "Tree-based broadcasting in multihop radio networks,"IEEE Trans. Comput., vol. C-36, no. 10, Oct. 1987.
[9] M. R. Garey and D. S. Johnson,Computers and Intractability: A Guide to Theory of NP-Completeness. San Francisco, CA: Freeman, 1979.

Index Terms:
broadcast networks; gossiping; distributed network; distributed algorithm; point-to-point networks; NP-hard; computational complexity; distributed algorithms; radio links.
A. Bagchi, S.L. Hakimi, E.F. Schmeichel, "Gossiping in a Distributed Network," IEEE Transactions on Computers, vol. 42, no. 2, pp. 253-256, Feb. 1993, doi:10.1109/12.204799
Usage of this product signifies your acceptance of the Terms of Use.