Rapid almost-complete broadcasting in faulty networks
type: Item
instance of: scholarly article
title: Rapid almost-complete broadcasting in faulty networks
zbMATH Open document ID: 1163.68007
author: Rastislav Královič
author: Richard Královič
published in: Theoretical Computer Science
publication date: 2009-03-30T00:00:00Z
Mathematics Subject Classification ID: 68M10
zbMATH DE Number: 5534959
zbMATH Keywords: broadcasting
zbMATH Keywords: fault tolerance
zbMATH Keywords: distributed computing
MaRDI profile type: Publication
full work available at URL: j.tcs.2008.12.023
OpenAlex ID: W1968221723
cites work: Q5689764
cites work: Information dissemination in distributed systems with faulty units
cites work: Telephone Problems with Failures
cites work: Reliable Broadcasting in Logarithmic Time with Byzantine Link Failures
cites work: Broadcasting in synchronous networks with dynamic faults
cites work: On induced subgraphs of the cube
cites work: Self-stabilizing systems in spite of distributed control
cites work: Almost Safe Gossiping in Bounded Degree Networks
cites work: On Fractional Dynamic Faults with Threshold
cites work: Optimal broadcasting in hypercubes with dynamic faults
cites work: Dynamic faults have small effect on broadcasting in hypercubes.
cites work: Self-stabilization
cites work: Impossibility of distributed consensus with one faulty process
cites work: On the impact of sense of direction on message complexity
cites work: Broadcasting with linearly bounded transmission faults
cites work: A survey of gossiping and broadcasting in communication networks
cites work: Reaching Agreement in the Presence of Faults
cites work: Broadcasting in complete networks with faulty nodes using unreliable calls
cites work: Feasibility and complexity of broadcasting with random transmission failures
DOI: 10.1016/J.TCS.2008.12.023
Recommended article: Rapid Almost-Complete Broadcasting in Faulty Networks
Recommended article: Communication-efficient broadcasting in complete networks with dynamic faults
Recommended article: Broadcasting in complete networks with faulty nodes using unreliable calls
Recommended article: Fault-tolerant broadcasting and gossiping in communication networks
Recommended article: On optimal broadcasting in faulty hypercubes
Recommended article: FAST BROADCASTING WITH BYZANTINE FAULTS
Recommended article: Broadcasting in synchronous networks with dynamic faults
Recommended article: Reliable broadcasting in hypercubes with random link and node failures
Recommended article: Adaptive broadcasting with faulty nodes
description: scientific article; zbMATH DE number 5534959