Abstract
This paper addresses the problem of performing efficiently an important operation of communication in networks, namely gossip. We study it in the line-communication model that is similar to the circuit-switching technique. We construct algorithms to gossip in any tree network and prove that they are optimal or asymptotically optimal. In all the cases, we show that the difference between lower and upper bounds is constant. In addition, these results give a general method to gossip, since any (connected) network has a spanning tree.
This work was supported by the “Opération RUMEUR” of the French PRC PRS.
Chapter PDF
Similar content being viewed by others
References
A. Bondy, U. Murty, Graph theory with applications, Mac Millan Press LTD, 1981.
A. Farley, Minimum-time broadcast networks, Networks 10 (1980) 59–70.
P. Fraigniaud, E. Lazard, Methods and problems of communication in usual networks, Discrete Applied Mathematics 53 (1994) 79–133.
S. Hedetniemi, S. Hedetniemi, A. Liestman, A survey of gossiping and broadcasting in communication networks, Networks 18 (1988) 319–349.
J. Hromkovic, R. Klasing, E. Stöhr, H. Wagener, Gossiping in vertex-disjoint paths mode in d-dimensional grids and planar graphs, Proc. First Annual European Symposium on Algorithms (ESA'93), LNCS 726, Springer Verlag (1993) 200–211.
J. Hromkovic, R. Klasing, W Unger, H. Wagener, Optimal algorithm for broadcast and gossip in the edge-disjoint path mode. Proc. 4th Scandinavian Workshop on Algorithm Theory (SWAT'94), LNCS 824, Springer-Verlag (1994) 219–230.
J. Kane, J. Peters, Line broadcasting in cycles, Technical repport number CMPT TR 94-11, School of computing science, Simon Fraser University, Burnaby, Canada.
W. Knödel, New gossips and telephones, Discrete Mathematics 13 (1975) 95.
C. Laforest, Broadcast and gossip in line-communication mode, Technical repport number 1005, LRI, Bât. 490, Université de Paris-Sud, 91405 Orsay Cedex France (1995).
J. de Rumeur, Communications dans les réseaux de processeurs. Edition Masson, Etudes et recherches en informatique (1994).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Laforest, C. (1996). Gossip in trees under line-communication mode. In: Bougé, L., Fraigniaud, P., Mignotte, A., Robert, Y. (eds) Euro-Par'96 Parallel Processing. Euro-Par 1996. Lecture Notes in Computer Science, vol 1123. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61626-8_43
Download citation
DOI: https://doi.org/10.1007/3-540-61626-8_43
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61626-9
Online ISBN: 978-3-540-70633-5
eBook Packages: Springer Book Archive