Verifiable broadcasting and gossiping in communication networks

DOI10.1016/S0166-218X(00)00379-6zbMath1016.68004OpenAlexW1995759318MaRDI QIDQ1602698

Kenneth A. Berman, Jerome L. Paul

Publication date: 24 June 2002

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

Full work available at URL: https://doi.org/10.1016/s0166-218x(00)00379-6

zbMATH Keywords

gossipingbroadcastingnetwork communication

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items (2)

New bounds on the minimum number of calls in failure‐tolerant gossiping ⋮ Improved Bounds for Minimum Fault-Tolerant Gossip Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Further gossip problems
• Methods and problems of communication in usual networks
• Gossips and telephones
• On Gossiping with Faulty Telephone Lines
• Telephone Problems with Failures
• A survey of gossiping and broadcasting in communication networks
• Fault-tolerant broadcasting and gossiping in communication networks

This page was built for publication: Verifiable broadcasting and gossiping in communication networks