TY - GEN

T1 - Efficient information exchange in the random phone-call model

AU - Berenbrink, Petra

AU - Czyzowicz, Jurek

AU - Elsässer, Robert

AU - Ga̧sieniec, Leszek

N1 - Copyright:
Copyright 2010 Elsevier B.V., All rights reserved.

PY - 2010

Y1 - 2010

N2 - 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(nloglogn) transmissions that accomplishes broadcasting in time O(logn), with probability 1-n -1. In this paper we provide a lower bound argument that proves Ω(nlogn) message complexity for any O(logn)-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•logn/loglogn) messages in time O(log2 n/loglogn), and based on exchange of O(nloglogn) messages with the time complexity 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(nloglogn) messages can be obtained in time O(logn), with probability 1-n -1.

AB - 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(nloglogn) transmissions that accomplishes broadcasting in time O(logn), with probability 1-n -1. In this paper we provide a lower bound argument that proves Ω(nlogn) message complexity for any O(logn)-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•logn/loglogn) messages in time O(log2 n/loglogn), and based on exchange of O(nloglogn) messages with the time complexity 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(nloglogn) messages can be obtained in time O(logn), with probability 1-n -1.

UR - http://www.scopus.com/inward/record.url?scp=77955341352&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77955341352&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-14162-1_11

DO - 10.1007/978-3-642-14162-1_11

M3 - Conference contribution

AN - SCOPUS:77955341352

SN - 3642141617

SN - 9783642141614

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 127

EP - 138

BT - Automata, Languages and Programming - 37th International Colloquium, ICALP 2010, Proceedings

T2 - 37th International Colloquium on Automata, Languages and Programming, ICALP 2010

Y2 - 6 July 2010 through 10 July 2010

ER -