Abstract
The problems of gossiping and broadcasting in one-way communication mode are considered for some prominent families of graphs. The complexity is measured as the number of communication rounds in the gossip and broadcast algorithms. The main result of the paper is the precise estimation of the gossip-problem complexity in cycles. To obtain this result a new combinatorial analysis of gossiping in cycles is developed. This analysis leads to an optimal lower bound on the number of rounds, and also to the design of an optimal algorithm for gossiping in cycles. The optimal algorithm for gossiping is later used to design new, effective algorithms for gossiping in important families of interconnection networks (cube connected cycles, butterfly networks). Furthermore, a new, effective algorithm for broadcasting in shuffle-exchange networks is developed.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A. Bagchi, S. L. Hakimi, J. Mitchem, and E. Schmeichel: Parallel algorithms for gossiping by mail.Inform. Process. Lett. 34(4) (1990), 197–202.
J.-C. Bermond and C. Peyrat: Broadcasting in DeBruijn networks.Proc. 19th Southeastern Conference on Combinatorics, Graph Theory and Computing, pp. 283–292. Congressus Numerantium, Vol. 66. Utilitas Math., Winnipeg, Manitoba, 1988.
B. Baker and R. Shostak: Gossips and telephones.Discrete Math. 2 (1972), 191–193.
S. Even and B. Monien: On the number of rounds necessary to disseminate information.Proc. 1st ACM Symposium on Parallel Algorithms and Architectures, Santa Fe, NM, June 1989, pp. 318–327.
R. C. Entringer and P. J. Slater: Gossips and telegraphs.J. Franklin Instit. 307 (1979), 353–360.
A. M. Farley and A. Proskurowski: Gossiping in grid graphs.J. Combin. Inform. System Sci. 5 (1980), 161–172.
S. M. Hedetniemi, S. T. Hedetniemi, and A. L. Liestman: A survey of gossiping and broadcasting in communication networks.Networks 18 (1988), 319–349.
A. Hajnal, E. C. Milner, and E. Szemeredi: A cure for the telephone disease.Canad. Math. Bull. 15 (1972), 447–450.
A. L. Liestman and J. G. Peters: Broadcast networks of bounded degree.SIAM J. Discrete Math. 1 (1988), 531–540.
D. Richards and A. L. Liestman: Generalization of broadcasting and gossiping.Networks 18 (1988), 125–138.
E. Stöhr: Broadcasting in the butterfly network.Inform. Process. Lett. 39 (1991), 41–43.
Author information
Authors and Affiliations
Additional information
Communicated by Kurt Mehlhorn.
On leave from Comenius University, Bratislava, Czechoslovakia.
Rights and permissions
About this article
Cite this article
Hromkovič, J., Jeschke, C.D. & Monien, B. Optimal algorithms for dissemination of information in some interconnection networks. Algorithmica 10, 24–40 (1993). https://doi.org/10.1007/BF01908630
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01908630