Reliable broadcasting in hypercubes with random link and node failures
From MaRDI portal
Recommendations
Cites work
- A guided tour of Chernoff bounds
- A survey of gossiping and broadcasting in communication networks
- Almost Safe Gossiping in Bounded Degree Networks
- Broadcasting in complete networks with faulty nodes using unreliable calls
- Broadcasting with random faults
- Fast Gossiping for the Hypercube
- Fast probabilistic algorithms for Hamiltonian circuits and matchings
- Gossiping in Minimal Time
- On Gossiping with Faulty Telephone Lines
- Optimal and near-optimal broadcast in random graphs
- Percolation, first-passage percolation and covering times for Richardson's model on the \(n\)-cube
- Telephone Problems with Failures
- Tighter time bounds on fault-tolerant broadcasting and gossiping
Cited in
(23)- Rapid almost-complete broadcasting in faulty networks
- Reliability properties of the hypercube network
- Broadcasting in a hypercube when some calls fail
- Reliability versus cost: Design of a probabilistic broadcast algorithm
- Optimal broadcasting in injured hypercubes using directed safety levels.
- Dynamic faults have small effect on broadcasting in hypercubes.
- A note on optimal time broadcast in faulty hypercubes
- Broadcasting in hypercubes and star graphs with dynamic faults.
- A fully decentralized and oblivious multi-node broadcast algorithm in hypercubes
- The diameter and connectivity of networks with random dependent faults
- Reliable communication in networks with Byzantine link failures
- Random induced subgraphs of Cayley graphs induced by transpositions
- HPP: A Reliable Causal Broadcast Protocol for Large-Scale Replication in Wide Area Networks
- scientific article; zbMATH DE number 1964078 (Why is no real title available?)
- Token transfer in a faulty network
- scientific article; zbMATH DE number 1420908 (Why is no real title available?)
- Feasibility and complexity of broadcasting with random transmission failures
- Fault—tolerant hypercube broadcasting via information dispersal
- SOFSEM 2006: Theory and Practice of Computer Science
- Broadcasting in hypercubes with randomly distributed Byzantine faults
- Reliable broadcast in dynamic networks with locally bounded Byzantine failures
- Feasibility and complexity of broadcasting with random transmission failures
- Almost-everywhere secure computation with edge corruptions
This page was built for publication: Reliable broadcasting in hypercubes with random link and node failures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2785368)
