
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
A. Bagchi, S.L. Hakimi, E.F. Schmeichel, "Gossiping in a Distributed Network," IEEE Transactions on Computers, vol. 42, no. 2, pp. 253256, February, 1993.  
BibTex  x  
@article{ 10.1109/12.204799, author = {A. Bagchi and S.L. Hakimi and E.F. Schmeichel}, title = {Gossiping in a Distributed Network}, journal ={IEEE Transactions on Computers}, volume = {42}, number = {2}, issn = {00189340}, year = {1993}, pages = {253256}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.204799}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Gossiping in a Distributed Network IS  2 SN  00189340 SP253 EP256 EPD  253256 A1  A. Bagchi, A1  S.L. Hakimi, A1  E.F. Schmeichel, PY  1993 KW  broadcast networks; gossiping; distributed network; distributed algorithm; pointtopoint networks; NPhard; computational complexity; distributed algorithms; radio links. VL  42 JA  IEEE Transactions on Computers ER   
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 pointtopoint 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 NPhard.
[1] M. C. Golumbic, "The general gossip problem," IBM Res. Rep. 4977, 1974.
[2] F. Harary,Graph Theory. Reading, MA: AddisonWesley, 1969.
[3] F. Harary and A. J. Schwenk, "The communication problem on graphs and digraphs,"J. Franklin Institute, vol. 297, pp. 491495, 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. 319349, Winter 1988.
[5] N. Alan, A. BarNoy, N. Linial, and D. Peleg, "On the complexity of radio communication," inProc. 21st ACM Symp. Theory Comput, 1989.
[6] R. BarYehuda, O. Goldreich, and A. Itai, "On the timecomplexity of broadcast in radio networks: An exponential gap between determinism and randomization," inProc. 5th ACM Symp. Principles Distributed Comput., 1986, pp. 98107.
[7] I. Chlamtac and S. Kutten, "On broadcasting in radio networks problem analysis and protocol design,"IEEE Trans. Commun., vol. COM33, Dec. 1985.
[8] I. Chlamtac and S. Kutten, "Treebased broadcasting in multihop radio networks,"IEEE Trans. Comput., vol. C36, no. 10, Oct. 1987.
[9] M. R. Garey and D. S. Johnson,Computers and Intractability: A Guide to Theory of NPCompleteness. San Francisco, CA: Freeman, 1979.