Tighter time bounds on fault-tolerant broadcasting and gossiping

DOI10.1002/NET.3230220505MaRDI QIDQ4014613zbMATH OpenOpenAlexFDO

Authors Luisa Gargano

Publication date 13 October 1992

Published in Networks (Search for Journal in Brave)

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

zbMATH Keywords

broadcastingfault-tolerant broadcastinggossipingunreliable lines

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Reliability, availability, maintenance, inspection in operations research (90B25)

Recommendations

• Time bounds on fault‐tolerant broadcasting
• Fault-tolerant broadcasting and gossiping in communication networks
• Minimum Time Broadcast Networks Tolerating a Logarithmic Number of Faults
• New bounds on the minimum number of calls in failure‐tolerant gossiping
• scientific article; zbMATH DE number 961881

Cites work

• A Cure for the Telephone Disease
• scientific article; zbMATH DE number 4023423 (Why is no real title available?)
• Minimum broadcast graphs

Cited in

(18)

• Broadcasting in complete networks with faulty nodes using unreliable calls
• Communication complexity of fault-tolerant information diffusion
• Efficient broadcasting with linearly bounded faults
• Fast gossiping with short unreliable messages
• Reliable broadcasting
• Minimum time broadcast in faulty star networks
• Broadcasting with linearly bounded transmission faults
• A note on optimal time broadcast in faulty hypercubes
• Binary linear programming models for robust broadcasting in communication networks
• Reliable broadcasting in hypercubes with random link and node failures
• FAST BROADCASTING WITH BYZANTINE FAULTS
• Sparse networks supporting efficient reliable broadcasting
• Token transfer in a faulty network
• Communication complexity of gossiping by packets
• Stochastic and deterministic fault detection for randomized gossip algorithms
• New bounds on the minimum number of calls in failure‐tolerant gossiping
• Fault-tolerant broadcasting and gossiping in communication networks
• Time-relaxed 1-fault tolerant broadcast networks

This page was built for publication: Tighter time bounds on fault-tolerant broadcasting and gossiping

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4014613)