
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Teofilo F. Gonzalez, "An Efficient Algorithm for Gossiping in the Multicasting Communication Environment," IEEE Transactions on Parallel and Distributed Systems, vol. 14, no. 7, pp. 701708, July, 2003.  
BibTex  x  
@article{ 10.1109/TPDS.2003.1214321, author = {Teofilo F. Gonzalez}, title = {An Efficient Algorithm for Gossiping in the Multicasting Communication Environment}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {14}, number = {7}, issn = {10459219}, year = {2003}, pages = {701708}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2003.1214321}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  An Efficient Algorithm for Gossiping in the Multicasting Communication Environment IS  7 SN  10459219 SP701 EP708 EPD  701708 A1  Teofilo F. Gonzalez, PY  2003 KW  Approximation algorithms KW  gossiping KW  multicasting KW  communication schedules. VL  14 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Abstract—We present an algorithm for the gossiping problem defined over an
[1] A. BarNoy, S. Guha, J. Naor, and B. Schieber, Multicasting in Heterogeneous Networks SIAM J. Computing, vol. 30, no. 2, 2000.
[2] J.C. Bermond, L. Gargano, A.A. Rescigno, and U. Vaccaro, Fast Gossiping by Short Messages SIAM J. Computing, vol. 27, no. 4, pp. 917941, 1998.
[3] D.P. Bertsekas and J.N. Tsitsiklis, Parallel and Distributed Computation.Englewood Cliffs, N.J.: Prentice Hall International, 1989.
[4] O. Egecioglu and T. Gonzalez, MinimumEnergy Broadcast in Simple Graphs with Limited Node Power Proc. IASTED Parallel and Distributed Computing Systems Conference, pp. 334338, 2001.
[5] S. Even and B. Monien, “On the Number of Rounds Necessary to Disseminate Information,” Proc. First ACM Symp. Parallel Algorithms and Architectures, pp. 318327, 1989.
[6] U. Feige, D. Peleg, P. Raghavan, and E. Upfal, Randomized Broadcast in Networks Proc. Int'l Symp. Algorithms SIGAL pp. 128137, 1990.
[7] P. Fraigniaud and E. Lazard, "Methods and Problems of Communication in Usual Networks," Discrete Applied Math., vol. 53, pp. 79133, 1994.
[8] P. Fraigniaud and S. Vial, Approximation Algorithms for Broadcasting and Gossiping J. Parallel and Distributed Computing, vol. 43, pp. 4755, 1997.
[9] S. Fujita and M. Yamashita, Optimal Group Gossiping in Hypercube under Circuit Switching Rounds SIAM J. Computing, vol. 25, no. 5, pp. 10451060, 1996.
[10] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NPCompleteness.New York: W.H. Freeman, 1979.
[11] L. Gargano, A.A. Rescigno, and U. Vaccaro, Communication Complexity of Gossiping by Packets J. Parallel and Distributed Computing, vol. 45, pp. 7381, 1997.
[12] T.F. Gonzalez, Complexity and Approximations for MultiMessage Multicasting J. Parallel and Distributed Computing, no. 55, pp. 215235, 1998.
[13] T.F. Gonzalez, Simple Algorithms for MultiMessage Multicasting with Forwarding Algorithmica, vol. 29, pp. 511533, 2001.
[14] T.F. Gonzalez, Improved Approximation Algorithms for MultiMessage Multicasting Nordic J. Computing, vol. 5, pp. 196213, 1998.
[15] T.F. Gonzalez, Gossiping with Multicasting Communication Primitives Proc. 2000 Parallel and Distributed Computing Systems Conference, pp. 768773, Nov. 2000.
[16] T. Gonzalez, Gossiping in the Multicasting Communication Environment Proc. Int'l Parallel and Distributed Processing Symp., 2001.
[17] S.M. Hedetniemi, S.T. Hedetniemi, and A.L. Liestman, A Survey of Gossiping and Broadcasting in Communication Networks NETWORKS, no. 18, pp. 129134, 1988.
[18] J. Hromkovic, R. Klasing, B. Monien, and R. Peine, Dissemination of Information in Interconnection Networks (Broadcasting and Gossiping). D.Z. Du and D.F. Hsu, eds. Kluwer Academic, pp. 273282, 1995.
[19] D.W. Krumme, G. Cybenko, and K.N. Venkataraman, “Gossiping in Minimal Time,” SIAM J. Computing, vol. 21, no. 1, pp. 111139, Feb. 1992.
[20] H. Shen, Efficient Multiple Multicasting in Hypercubes J. Systems Architecture, vol. 43, no. 9, Aug. 1997.
[21] R. Ravi, Rapid Rumor Ramification Proc. 35th Ann. Symp. Foundations of Computer Science, pp. 202213, 1994.