Issue No. 02 - February (1993 vol. 42)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.204799
<p>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.</p>
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. , pp. 253-256, February 1993, doi:10.1109/12.204799