On Gossiping with Faulty Telephone Lines

DOI10.1137/0608036zbMath0626.05033OpenAlexW2056215685MaRDI QIDQ3029035

Alejandro A. Schäffer, Shaibal Roy, Ramsey W. Haddad

Publication date: 1987

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

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

zbMATH Keywords

gossip problemtelephone problemfault-tolerant communicationminimum length sequencetelephone calls

Mathematics Subject Classification ID

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

Related Items (13)

Fast gossiping with short unreliable messages ⋮ 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 ⋮ Reliable Broadcasting in Hypercubes with Random Link and Node Failures ⋮ New bounds on the minimum number of calls in failure‐tolerant gossiping ⋮ Communication complexity of gossiping by packets ⋮ Communication complexity of fault-tolerant information diffusion ⋮ Improved Bounds for Minimum Fault-Tolerant Gossip Graphs ⋮ Verifiable broadcasting and gossiping in communication networks ⋮ Lossy gossip and composition of metrics ⋮ Graph theoretical issues in computer networks

Cites Work

• Unnamed Item
• Toward optimal gossiping schemes with conference calls
• Gossiping old ladies
• A class of solutions to the gossip problem. I
• New gossips and telephones
• Gossips and telephones
• Telephone Problems with Failures
• A Problem with Telephones
• A Cure for the Telephone Disease

This page was built for publication: On Gossiping with Faulty Telephone Lines