New bounds on the minimum number of calls in failure‐tolerant gossiping

DOI10.1002/net.20259zbMath1192.68039OpenAlexW4235709423MaRDI QIDQ5191126

Zhé Hóu, Maiko Shigeno

Publication date: 28 July 2009

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20259

zbMATH Keywords

reliabilitygossipingcommunication network

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10)

Related Items (1)

Improved Bounds for Minimum Fault-Tolerant Gossip Graphs

Cites Work

• Robust gossiping with an application to consensus
• Methods and problems of communication in usual networks
• Verifiable broadcasting and gossiping in communication networks
• Minimum linear gossip graphs and maximal linear (?,k)-gossip graphs
• On Gossiping with Faulty Telephone Lines
• Telephone Problems with Failures
• A survey of gossiping and broadcasting in communication networks
• On generalized gossiping and broadcasting
• Fault-tolerant broadcasting and gossiping in communication networks

This page was built for publication: New bounds on the minimum number of calls in failure‐tolerant gossiping