Adaptive broadcasting with faulty nodes

Leszek Ga̧sieniec, Andrzej Pelc

Research output: Contribution to journalArticlepeer-review

17 Scopus citations

Abstract

We consider broadcasting from a fault-free source to all nodes of a completely connected n-node network in the presence of k faulty nodes. Every node can communicate with at most one other node in a unit of time and during this period every pair of communicating nodes can exchange information packets. Faulty nodes cannot send information. Broadcasting is adaptive, i.e., a node schedules its next communication on the basis of information currently available to it. Assuming that the fraction of faulty nodes is bounded by a constant smaller than 1, we construct a broadcasting algorithm working in worst-case time O(log2 n).

Original languageEnglish (US)
Pages (from-to)903-912
Number of pages10
JournalParallel Computing
Volume22
Issue number6
DOIs
StatePublished - Sep 1996

Keywords

  • Adaptive
  • Algorithms
  • Broadcasting
  • Fault-tolerance

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture
  • Computer Networks and Communications
  • Computer Graphics and Computer-Aided Design
  • Artificial Intelligence

Fingerprint Dive into the research topics of 'Adaptive broadcasting with faulty nodes'. Together they form a unique fingerprint.

Cite this