On fast and robust information spreading in the vertex-congest model

Keren Censor-Hillel, Tariq Toukan

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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.

Original languageEnglish
Title of host publicationStructural Information and Communication Complexity - 22nd International Colloquium, SIROCCO 2015, Post-Proceedings
EditorsChristian Scheideler
Pages270-284
Number of pages15
DOIs
StatePublished - 2015
Event22nd International Colloquium on Structural Information and Communication Complexity, SIROCCO 2015 - Montserrat, Spain
Duration: 14 Jul 201516 Jul 2015

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9439

Conference

Conference22nd International Colloquium on Structural Information and Communication Complexity, SIROCCO 2015
Country/TerritorySpain
CityMontserrat
Period14/07/1516/07/15

Keywords

  • Distributed computing
  • Fault tolerance
  • Information spreading
  • Randomized algorithms
  • Vertex-connectivity

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'On fast and robust information spreading in the vertex-congest model'. Together they form a unique fingerprint.

Cite this