Skip to main content

Fast gossiping by short messages

  • Communication Protocols
  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1995)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 944))

Included in the following conference series:

  • 162 Accesses

Abstract

Gossiping is the process of information diffusion in which each node of a network holds a packet that must be communicated to all other nodes in the network. We consider the problem of gossiping in communication networks under the restriction that communicating nodes can exchange up to a fixed number p of packets at each round. In the first part of the paper we study the extremal case p = 1 and we exactly determine the optimal number of communication rounds to perform gossiping for several classes of graphs, including Hamiltonian graphs and complete k-ary trees. For arbitrary graphs we give asymptotically matching upper and lower bounds. We also study the case of arbitrary p and we exactly determine the optimal number of communication rounds to perform gossiping under this hypothesis for complete graphs, hypercubes, rings, and paths.

The work of the first author was partially supported by the French GDR/PRC Project PRS. He wants also to thank the Dipartimento di Informatica ed Applicazioni of the Università di Salerno, where part of his research was done, for inviting him. The work of the last three authors was partially supported by Progetto Finalizzato Sistemi Informatici e Calcolo Parallelo of C.N.R. under Grant No. 92.01622.PF69 and by the Italian Ministry of the University and Scientific Research, Project: Algoritmi, Modelli di Calcolo e Strutture Informative.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. N. Alon, F.R.K. Chung, and R.L. Graham “Routing Permutations on Graphs via Matchings”, Proc. 25th ACM Symposium on the Theory of Computing (STOC '93), San Diego, CA (1993), 583–591.

    Google Scholar 

  2. B. Alspach, “The Classification of Hamiltonian Generalized Petersen Graphs”, J. Combinatorial Theory, Series B, 34 (1983), 293–312.

    Google Scholar 

  3. A. Bagchi, E.F. Schmeichel, and S.L. Hakimi, “Sequential Information Dissemination by Packets”, Networks, 22 (1992), 317–333.

    Google Scholar 

  4. A. Bagchi, E.F. Schmeichel, and S.L. Hakimi, “Parallel Information Dissemination by Packets”, SIAM J. on Computing, 23 (1994), 355–372.

    Google Scholar 

  5. J.-C. Bermond, L. Gargano, A. Rescigno, and U. Vaccaro, “Fast Gossiping by Short Messages”, manuscript available from the authors.

    Google Scholar 

  6. J.-C. Bermond, L. Gargano, A. Rescigno, and U. Vaccaro, in preparation.

    Google Scholar 

  7. D. P. Bertsekas, and J. N. Tsitsiklis, Parallel and Distributed Computation: Numerical Methods, Prentice-Hall, Englewood Cliffs, NJ, 1989.

    Google Scholar 

  8. B.S. Chlebus, K. Diks, A. Pelc, “Optimal Gossiping with Short Unreliable Messages”, Discr. Appl. Math., 53 (1994), 15–24.

    Google Scholar 

  9. P. Fraignaud, E. Lazard, “Methods and Problems of Communication in Usual Networks”, Discr. Appl. Math., 53 (1994), 79–134.

    Google Scholar 

  10. S. Fujita, “Gossiping in Mesh-Bus Computers by Packets with Bounded Length”, IPS Japan SIGAL, 36-6 (1993), 41–48.

    Google Scholar 

  11. M. Fürer and B. Raghavachari, “Approximating the Minimum Degree Spanning Tree to within One from the Optimal Degree”, Proc. of SODA '92, Orlando, FL (1992), 317–324.

    Google Scholar 

  12. S. M. Hedetniemi, S. T. Hedetniemi, and A. Liestman, “A Survey of Gossiping and Broadcasting in Communication Networks”, Networks, 18 (1988), 129–134.

    Google Scholar 

  13. A. Hily and D. Sotteau, “Communications in Bus Networks”, in: Parallel and Distributed Computing, M. Cosnard, A. Ferreira, and J. Peters (Eds.), Lectures Notes in Computer Science, 805, Springer-Verlag, (1994), 197–206.

    Google Scholar 

  14. J. Hromković, R. Klasing, B. Monien, and R. Peine, “Dissemination of Information in Interconnection Networks (Broadcasting and Gossiping)”, to appear in: F. Hsu, D.-Z. Du (Eds.) Combinatorial Network Theory, Science Press & AMS.

    Google Scholar 

  15. D. W. Krumme, K.N. Venkataraman, and G. Cybenko, “Gossiping in Minimal Time”, SIAM J. on Computing, 21 (1992), 111–139.

    Google Scholar 

  16. J. de Rumeur, Communication dans les Reseaux de Processeur, MASSON, Paris (1994).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Zoltán Fülöp Ferenc Gécseg

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bermond, J.C., Gargano, L., Rescigno, A.A., Vaccaro, U. (1995). Fast gossiping by short messages. In: Fülöp, Z., Gécseg, F. (eds) Automata, Languages and Programming. ICALP 1995. Lecture Notes in Computer Science, vol 944. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60084-1_69

Download citation

  • DOI: https://doi.org/10.1007/3-540-60084-1_69

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60084-8

  • Online ISBN: 978-3-540-49425-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics