TY - GEN
T1 - On fast and robust information spreading in the vertex-congest model
AU - Censor-Hillel, Keren
AU - Toukan, Tariq
N1 - Publisher Copyright: © Springer International Publishing Switzerland 2015.
PY - 2015
Y1 - 2015
N2 - This paper initiates the study of the impact of failures on the fundamental problem of information spreading in the Vertex-Congest model, in which in every round, each of the n nodes sends the same O(logn)-bit message to all of its neighbors. Our contribution to coping with failures is twofold. First, we prove that the randomized algorithm which chooses uniformly at random the next message to forward is slow, requiring Ω(n/k) rounds on some graphs, which we denote by Gn,k, where k is the vertex-connectivity. Second, we design a randomized algorithm that makes dynamic message choices, with probabilities that change over the execution. We prove that for G n,k it requires only a near-optimal number of O(nlog3n/k) rounds, despite a rate of q = O(k/nlog3n) failures per round. Our technique of choosing probabilities that change according to the execution is of independent interest.
AB - This paper initiates the study of the impact of failures on the fundamental problem of information spreading in the Vertex-Congest model, in which in every round, each of the n nodes sends the same O(logn)-bit message to all of its neighbors. Our contribution to coping with failures is twofold. First, we prove that the randomized algorithm which chooses uniformly at random the next message to forward is slow, requiring Ω(n/k) rounds on some graphs, which we denote by Gn,k, where k is the vertex-connectivity. Second, we design a randomized algorithm that makes dynamic message choices, with probabilities that change over the execution. We prove that for G n,k it requires only a near-optimal number of O(nlog3n/k) rounds, despite a rate of q = O(k/nlog3n) failures per round. Our technique of choosing probabilities that change according to the execution is of independent interest.
KW - Distributed computing
KW - Fault tolerance
KW - Information spreading
KW - Randomized algorithms
KW - Vertex-connectivity
UR - http://www.scopus.com/inward/record.url?scp=84950341547&partnerID=8YFLogxK
U2 - https://doi.org/10.1007/978-3-319-25258-2_19
DO - https://doi.org/10.1007/978-3-319-25258-2_19
M3 - منشور من مؤتمر
SN - 9783319252575
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 270
EP - 284
BT - Structural Information and Communication Complexity - 22nd International Colloquium, SIROCCO 2015, Post-Proceedings
A2 - Scheideler, Christian
T2 - 22nd International Colloquium on Structural Information and Communication Complexity, SIROCCO 2015
Y2 - 14 July 2015 through 16 July 2015
ER -