Epidemic algorithms for replicated database maintenance
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Tight bounds on minimum broadcast networks
SIAM Journal on Discrete Mathematics
Time and Cost Trade-Offs in Gossiping
SIAM Journal on Discrete Mathematics
Balls and bins: a study in negative dependence
Random Structures & Algorithms
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Dissemination of Information in Communication Networks: Broadcasting, Gossiping, Leader Election, and Fault-Tolerance (Texts in Theoretical Computer Science. An EATCS Series)
On the communication complexity of randomized broadcasting in random-like graphs
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
The power of memory in randomized broadcasting
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Optimal gossip-based aggregate computation
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
How efficient can gossip be? (on the cost of resilient information exchange)
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Fast distributed computation in dynamic networks via random walks
DISC'12 Proceedings of the 26th international conference on Distributed Computing
| Hi-index | 0.00 |
We consider the gossiping problem in the classical random phone-call model introduced by Demers et. al. ([6]). We are given a complete graph, in which every node has an initial message to be disseminated to all other nodes. In each step every node is allowed to establish a communication channel with a randomly chosen neighbour. Karp et al. [15] proved that it is possible to design a randomized procedure performing O(n log log n) transmissions that accomplishes broadcasting in time O(log n), with probability 1 - n-1. In this paper we provide a lower bound argument that proves Ω(n log n) message complexity for any O(log n)-time randomized gossiping algorithm, with probability 1-o(1). This should be seen as a separation result between broadcasting and gossiping in the random phone-call model. We study gossiping at the two opposite points of the time and message complexity trade-off. We show that one can perform gossiping based on exchange of O(n ċ log n/ log log n) messages in time O(log2 n/log log n), and based on exchange of O(n log log n) messages with the time complexity O(√n). Both results hold wit probability 1 - n-1. Finally, we consider a model in which each node is allowed to store a small set of neighbours participating in its earlier transmissions. We show that in this model randomized gossiping based on exchange of O(n log log n) messages can be obtained in time O(log n), with probability 1 - n-1.