This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Network Communication in Edge-Colored Graphs: Gossiping
April 1993 (vol. 4 no. 4)
pp. 438-445

A mechanism for scheduling communications in a network in which individuals exchange information periodically according to a fixed schedule is presented. A proper kedge-coloring of the network is considered to be a schedule of allowed communicationssuch that an edge of color i can be used only at times i modulo k. Within thiscommunication scheduling mechanism, the information exchange problem known asgossiping is considered. It is proved that there is a proper k edge-coloring such thatgossip can be completed in a path of n edges in a certain time for ngreater than or equal to k greater than or equal to 1. Gossipcan not be completed in such a path any earlier under any proper k edge-coloring. In anytree of bounded degree Delta and diameter d, gossip can be completed under a properDelta edge-coloring in time ( Delta -1)d+1. In a k edge-colored cycle of n vertices, othertime requirements of gossip are determined.

[1] S. F. Assman and D. J. Kleitman, "The number of rounds needed to exchange information within a graph,"Discr. Appl. Math., vol. 6, pp. 117-125, 1983.
[2] A. Bagchi, S. L. Hakimi, J. Mitchem, and E. Schmeichel, "Parallel algorithms for gossiping by mail,"Inform. Processing Lett., vol. 34, pp. 197-202, 1990.
[3] I. Cederbaum, "On the spread of information in communication nets,"Matrix and Tensor Quarterly, vol. 30, pp. 101-112, 1980.
[4] S. Even and B. Monien, "On the number of rounds necessary to disseminate information," inProc. 1st ACM Symp. on Parallel Algorithms and Architectures, Santa Fe, NM, June 1989.
[5] A. Farley and A. Proskurowski, "Gossiping in grid graphs,"J. Combin. Inform. Syst. Sci., vol. 5, pp. 161-172, 1980.
[6] G. Fricke, as communicated by a referee.
[7] S. T. Hedetniemi, S. M. Hedetniemi, and A. L. Liestman, "A survey of broadcasting and gossiping in communication networks,"Networks, vol. 18, pp. 319-349, 1988.
[8] W. D. Hillis,The Connection Machine. Cambridge, MA: MIT Press, 1985.
[9] J. Hromkovic, C. D. Jeschke, and B. Monien, "Optimal algorithms for dissemination of information in some interconnection networks," inMathematical Foundations of Computer Science '90. Also inLecture Notes in Computer Science 452. New York: Springer-Verlag, 1990.
[10] W. Knodel, "New gossips and telephones,"Discr. Math., vol. 13, p. 95, 1975.
[11] D. W. Krumme, K. N. Venkataraman, and G. Cybenko, "Gossiping in minimal time,"SIAM J. Comput., vol. 21, pp. 111-139, 1992.
[12] R. Labahn, "The telephone problem for trees,"Elektron. Informationsverarb. u. Kybernet., vol. 22, pp. 475-485, 1986.

Index Terms:
Index Termsnetwork communication; edge-colored graphs; gossiping; scheduling communications;graph colouring; multiprocessor interconnection networks; scheduling
Citation:
A.L. Liestman, D. Richards, "Network Communication in Edge-Colored Graphs: Gossiping," IEEE Transactions on Parallel and Distributed Systems, vol. 4, no. 4, pp. 438-445, April 1993, doi:10.1109/71.219758
Usage of this product signifies your acceptance of the Terms of Use.