Almost Safe Gossiping in Bounded Degree Networks

DOI10.1137/0405025zbMath0768.05060OpenAlexW1980048622MaRDI QIDQ4018844

Krzysztof Diks, Andrzej Pelc

Publication date: 16 January 1993

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0405025

zbMATH Keywords

reliabilityinformationcommunication networkscommunication networkrandom faultsgossip problemgossip schemes

Mathematics Subject Classification ID

Paths and cycles (05C38) Applications of graph theory to circuits and networks (94C15)

Related Items (11)

Fast gossiping with short unreliable messages ⋮ Feasibility and complexity of broadcasting with random transmission failures ⋮ Broadcasting with linearly bounded transmission faults ⋮ Token transfer in a faulty network ⋮ Sparse networks supporting efficient reliable broadcasting ⋮ Broadcasting in complete networks with faulty nodes using unreliable calls ⋮ \(f\)-sensitivity distance oracles and routing schemes ⋮ Reliable Broadcasting in Hypercubes with Random Link and Node Failures ⋮ Deterministic Models of Communication Faults ⋮ Rapid almost-complete broadcasting in faulty networks ⋮ FAST BROADCASTING WITH BYZANTINE FAULTS

This page was built for publication: Almost Safe Gossiping in Bounded Degree Networks