Fast Gossiping in Square Meshes/Tori with Bounded-Size Packets
IEEE Transactions on Parallel and Distributed Systems
Gossiping in the Multicasting Communication Environment
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
An Efficient Algorithm for Gossiping in the Multicasting Communication Environment
IEEE Transactions on Parallel and Distributed Systems
Optimal gossiping in paths and cycles
Journal of Discrete Algorithms
Improved gossipings by short messages in 2-dimensional meshes
Journal of Parallel and Distributed Computing
On the hamiltonicity of the cartesian product
Information Processing Letters
The algorithm of pipelined gossiping
Journal of Systems Architecture: the EUROMICRO Journal
Optimal gossiping in square 2D meshes
Theoretical Computer Science
Minimum-latency gossiping in multi-hop wireless networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Optimal Gathering Algorithms in Multi-hop Radio Tree-Networks ith Interferences
ADHOC-NOW '08 Proceedings of the 7th international conference on Ad-hoc, Mobile and Wireless Networks
On the hamiltonicity of the cartesian product
Information Processing Letters
Minimum weight dynamo and fast opinion spreading
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
| Hi-index | 0.00 |
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. Finally, we investigate the problem of determining sparse networks in which gossiping can be performed in the minimum possible number of rounds.