Fast gossiping with short unreliable messages

DOI10.1016/0166-218X(94)90176-7zbMath0807.94029WikidataQ127705921 ScholiaQ127705921MaRDI QIDQ1339876

Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc

Publication date: 11 December 1994

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

gossipingcommunication network graph

Mathematics Subject Classification ID

Applications of graph theory (05C90) Communication networks in operations research (90B18) Applications of graph theory to circuits and networks (94C15)

Related Items (4)

Robust gossiping with an application to consensus ⋮ Token transfer in a faulty network ⋮ Fast gossiping by short messages ⋮ Optimal sequential gossiping by short messages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal and near-optimal broadcast in random graphs
• Broadcasting with random faults
• On Gossiping with Faulty Telephone Lines
• A survey of gossiping and broadcasting in communication networks
• Gossiping in Minimal Time
• Fast Gossiping for the Hypercube
• Reliable communication in networks with Byzantine link failures
• Tighter time bounds on fault-tolerant broadcasting and gossiping
• Almost Safe Gossiping in Bounded Degree Networks
• Sorting on a Mesh-Connected Computer with Delaying Links

This page was built for publication: Fast gossiping with short unreliable messages