Fault-tolerant broadcasting and gossiping in communication networks
From MaRDI portal
(Redirected from Publication:5689809)
Recommendations
- Communication-efficient broadcasting in complete networks with dynamic faults
- Tighter time bounds on fault-tolerant broadcasting and gossiping
- Verifiable broadcasting and gossiping in communication networks
- A probabilistic characterization of a fault-tolerant gossiping algorithm
- Broadcasting in complete networks with faulty nodes using unreliable calls
- Efficient Gossiping by Packets in Networks with Random Faults
- Rapid Almost-Complete Broadcasting in Faulty Networks
- Rapid almost-complete broadcasting in faulty networks
Cited in
(46)- Rapid almost-complete broadcasting in faulty networks
- A probabilistic characterization of a fault-tolerant gossiping algorithm
- Communication complexity of fault-tolerant information diffusion
- Efficient broadcasting with linearly bounded faults
- Compound constructions of broadcast networks
- Reliable broadcasting in product networks
- Dynamic faults have small effect on broadcasting in hypercubes.
- Efficient collective communciation in optical networks
- Verifiable broadcasting and gossiping in communication networks
- Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance.
- Confidential gossip
- The parameterized complexity of the minimum shared edges problem
- Efficient gossip and robust distributed computation
- Broadcasting in hypercubes and star graphs with dynamic faults.
- Binary linear programming models for robust broadcasting in communication networks
- Efficient communication in unknown networks
- Asynchronous broadcasting with bivalent beeps
- A survey on undirected circulant graphs
- The diameter and connectivity of networks with random dependent faults
- Consensus vs. Broadcast in Communication Networks with Arbitrary Mobile Omission Faults
- Improved bounds for minimum fault-tolerant gossip graphs
- Time-efficient broadcast in radio networks
- FAST BROADCASTING WITH BYZANTINE FAULTS
- A COMPOUNDING ALGORITHM FOR 1-FAULT TOLERANT BROADCAST NETWORKS
- Deterministic Models of Communication Faults
- Tighter time bounds on fault-tolerant broadcasting and gossiping
- Message-optimal protocols for fault-tolerant broadcasts/multicasts in distributed systems with crash failures
- A fault-tolerant broadcast scheme in the star graph under the single-port, half-duplex communication model
- Colouring paths in directed symmetric trees with applications to WDM routing
- scientific article; zbMATH DE number 1875436 (Why is no real title available?)
- A note on broadcasting with linearly bounded transmission faults in constant degree networks
- scientific article; zbMATH DE number 7310081 (Why is no real title available?)
- Feasibility and complexity of broadcasting with random transmission failures
- Stochastic and deterministic fault detection for randomized gossip algorithms
- New bounds on the minimum number of calls in failure‐tolerant gossiping
- Algorithms - ESA 2003
- Searching games with errors -- fifty years of coping with liars
- Meeting the deadline: on the complexity of fault-tolerant continuous gossip
- \(f\)-sensitivity distance oracles and routing schemes
- A new parameter for a broadcast algorithm with locally bounded Byzantine faults
- Invited talk: Resilient distributed algorithms
- Broadcasting with locally bounded byzantine faults
- Fault-tolerant sequential scan
- Robust gossiping with an application to consensus
- Feasibility and complexity of broadcasting with random transmission failures
- Computing input multiplicity in anonymous synchronous networks with dynamic faults
This page was built for publication: Fault-tolerant broadcasting and gossiping in communication networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5689809)
