Efficient Gossiping by Packets in Networks with Random Faults
From MaRDI portal
Publication:4875431
DOI10.1137/0409002zbMATH Open0843.68005OpenAlexW2055723591MaRDI QIDQ4875431FDOQ4875431
Authors: Krzysztof Diks, Andrzej Pelc 
Publication date: 5 June 1996
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0409002
Recommendations
- Fast gossiping with short unreliable messages
- Optimal gossiping in geometric radio networks in the presence of dynamical faults
- FAST BROADCASTING WITH BYZANTINE FAULTS
- Optimal communication in networks with randomly distributed byzantine faults
- Broadcasting in complete networks with faulty nodes using unreliable calls
Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Parallel algorithms in computer science (68W10) Network design and communication in computer systems (68M10)
Cited In (18)
- Communication complexity of gossiping by packets
- Fault-tolerant broadcasting and gossiping in communication networks
- Gossiping by processors prone to omission failures
- Longest fault-free paths in star graphs with vertex faults
- Cycles in butterfly graphs
- Communication complexity of fault-tolerant information diffusion
- Longest fault-free paths in hypercubes with vertex faults
- Communication in Networks with Random Dependent Faults
- Edge-fault-tolerant hamiltonicity of locally twisted cubes under conditional edge faults
- Fault-free longest paths in star networks with conditional link faults
- Embedding Hamiltonian cycles in alternating group graphs under conditional fault model
- Simplified Chernoff bounds with powers-of-two probabilities
- Fault-free Hamiltonian cycles in twisted cubes with conditional link faults
- Optimal gossiping in geometric radio networks in the presence of dynamical faults
- Token transfer in a faulty network
- Stochastic and deterministic fault detection for randomized gossip algorithms
- Edge-fault-tolerant Hamiltonicity of pancake graphs under the conditional fault model
- On flooding in the presence of random faults
This page was built for publication: Efficient Gossiping by Packets in Networks with Random Faults
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4875431)
