Abstract
Gossiping (also called total exchange or all-to-all communication) 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 here gossiping in the store- and-forward, full-duplex and Δ-port (or shouting) model. In such a model, the protocol consists of a sequence of rounds and during each round, each node can send (and receive) messages from all its neighbors. The great majority of the previous works on gossiping problems allows the messages to be freely concatenated and so messages of arbitrary length can be transmitted during a round. Here we restrict the problem to the case where at each round communicating nodes can exchange exactly one packet. We give a lower bound of N−1/δ, where δ is the minimum degree, and show that it is attained in Cayley symmetric digraphs with some additional properties. That implies the existence of an optimal gossiping protocol for classical networks like hypercubes, k-dimensional tori, and star-graphs. Furthermore we introduce the notion of complete rotation in Cayley symmetric digraphs which appears to be an interesting property worth of study in itself.
That work was supported by the French GDR/PRC PRS and by the Galileo cooperation project with the University of Salerno
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
A. Bagchi, E.F. Schmeichel and S.L. Hakimi.: Parallel Information Dissemination by Packets. SIAM Journal of Computing, 23 (1994) 355–372
J.-C. Bermond, L.Gargano, A. Rescigno and U. Vaccaro.: Fast Gossiping by Short Messages. Proc. 22nd ICALP 95, Szeged, Hungary, Lecture Notes in Computer Science, Springer-Verlag, 944(1995) 135–146. An extended version should appear in: SIAM Journal of Computing.
D. P. Bertsekas and J. N. Tsitsiklis.: Parallel and Distributed Computation: Numerical Methods. Prentice-Hall, Englewood Cliffs, NJ, (1989)
J. de Rumeur.: Communications dans les réseaux de processeurs. Masson Paris, (1994)
P. Fragopoulou.: Communication and Fault Tolerance Algorithms on a Class of Interconnection Networks. Ph.D. Thesis, Department of Computing and Information Science, Queen's University, Kingston, ON, Canada, (1995)
P. Fragopoulou and S.G. Akl.: A Framework for Optimal Communication on a Subclass of the Cayley Class Based Networks. Proc. 14th Annual IEEE International Phoenix Conference on Computers and Communications (IPCCC-95), Phoenix, AR, U.S.A. (1995) 241–248
P. Fragopoulou, S.G. Akl and H. Meijer.: Optimal Communication Primitives on the Generalized Hypercube Network. Journal of Parallel and Distributed Computing, 32(2) (1996) 173–187
P. Fraigniaud and E. Lazard.: Methods and Problems of Communication in Usual Networks. Discrete Applied Mathematics 53 (1994) 79–134
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. Hily and D. Sotteau.: Communications in Bus Networks. Parallel and Distributed Computing, Lectures Notes in Computer Science, Springer-Verlag, 805 (1994) 197–206
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
J.-C. König, P.S. Rao, and D. Trystram.: Analysis of Gossiping Algorithms in Torus with Restricted Bufferization Capabilities. Technical Report IMAG Grenoble, (1994)
M. Mahéo and J.-F. Saclé.: Note on the Problem of Gossiping in Multidimensional Grids. Discrete Applied Mathematics 53 (1994) 287–290
N. Marlin.: Rapport de DEA (1996)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bermond, JC., Kodate, T., Pérennes, S. (1996). Gossiping in cayley graphs by packets. In: Deza, M., Euler, R., Manoussakis, I. (eds) Combinatorics and Computer Science. CCS 1995. Lecture Notes in Computer Science, vol 1120. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61576-8_91
Download citation
DOI: https://doi.org/10.1007/3-540-61576-8_91
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61576-7
Online ISBN: 978-3-540-70627-4
eBook Packages: Springer Book Archive