Abstract
Formalisms for representing gossip problems are surveyed. A new method “calling schemes” is presented which generalizes existing methods. This survey is intended to serve primarily as a basis for future work.
Preview
Unable to display preview. Download preview PDF.
References
R.T. Bumby, A problem with telephones, SIAM J. Algebraic Discrete Methods 2 (1981) 13–18.
G. Burosch, V.K. Leont'ev, and A.S. Markosyan, On the possibility of information propagation on graphs, Soviet Math. Doklady 37 (1988) 52–55.
G. Burosch and J.M. Laborde, Label-connected graphs — an overview, Technical Report 898, Institut Imag, Grenoble, France, 1992.
R.C. Entringer and P.J. Slater, Gossips and telegraphs, J. Franklin Institute 307 (1979) 353–360.
F. Göbel, J.O. Cerdeira, and H.J. Veldman, Label-connected graphs and the gossip problem, Discrete Mathematics 87 (1991) 9–40.
S.M. Hedetniemi, S.T. Hedetniemi, and A.L. Liestman, A survey of gossiping and broadcasting in communication networks, Networks 18 (1988) 319–349.
D.J. Kleitman and J.B. Shearer, Further gossip problems, Discrete Mathematics 30 (1980) 151–156.
D.W. Krumme, K.N. Venkataraman, and G. Cybenko. Gossiping in minimal time, SIAM J. Computing 21 (1992) 111–139.
D. Krumme, Reordered gossip schemes, submitted to Discrete Mathematics.
R. Labahn, Information flows on hypergraphs, Discrete Mathematics 113 (1993) 71–97.
R. Labahn, Kernels of minimum size gossip schemes, to appear in Discrete Mathematics. Also Technical Reports 92774 (Part I) and 92785 (Part II), Forschungsinstitut für Diskrete Mathematik, Rheinische Friedrich-Wilhelms-Universität, Nassestr 2, D-5300 Bonn, Germany, 1992.
D. West, A class of solutions to the gossip problem, Part I, Discrete Mathematics 39 (1982) 307–326.
O. Wolfson and A. Segall, The communication complexity of atomic commitment and of gossiping, SIAM J. Computing 20 (1991) 423–450.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Krumme, D.W. (1994). Representations of gossip schemes. In: Cosnard, M., Ferreira, A., Peters, J. (eds) Parallel and Distributed Computing Theory and Practice. CFCP 1994. Lecture Notes in Computer Science, vol 805. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58078-6_21
Download citation
DOI: https://doi.org/10.1007/3-540-58078-6_21
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58078-2
Online ISBN: 978-3-540-48435-6
eBook Packages: Springer Book Archive