Fault-tolerant broadcasting and gossiping in communication networks

DOI10.1002/(SICI)1097-0037(199610)28:3%3C143::AID-NET3%3E3.0.CO;2-NzbMATH Open0865.90058OpenAlexW2063105299MaRDI QIDQ5689809FDOQ5689809

Authors: Andrzej Pelc 

Publication date: 6 July 1997

Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199610)28:3%3C143::aid-net3%3E3.0.co;2-n

Recommendations

• Communication-efficient broadcasting in complete networks with dynamic faults
• Tighter time bounds on fault-tolerant broadcasting and gossiping
• Verifiable broadcasting and gossiping in communication networks
• A probabilistic characterization of a fault-tolerant gossiping algorithm
• Broadcasting in complete networks with faulty nodes using unreliable calls
• Efficient Gossiping by Packets in Networks with Random Faults
• Rapid Almost-Complete Broadcasting in Faulty Networks
• Rapid almost-complete broadcasting in faulty networks

zbMATH Keywords

fault-tolerancebroadcastinggossipingnetwork communicationefficiency measures

Mathematics Subject Classification ID

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

Cited In (46)

• The parameterized complexity of the minimum shared edges problem
• The diameter and connectivity of networks with random dependent faults
• Verifiable broadcasting and gossiping in communication networks
• A note on broadcasting with linearly bounded transmission faults in constant degree networks
• Improved bounds for minimum fault-tolerant gossip graphs
• A probabilistic characterization of a fault-tolerant gossiping algorithm
• Binary linear programming models for robust broadcasting in communication networks
• Robust gossiping with an application to consensus
• Invited talk: Resilient distributed algorithms
• Efficient communication in unknown networks
• Message-optimal protocols for fault-tolerant broadcasts/multicasts in distributed systems with crash failures
• Fault-tolerant sequential scan
• Efficient collective communciation in optical networks
• Asynchronous Broadcasting with Bivalent Beeps
• Feasibility and complexity of broadcasting with random transmission failures
• \(f\)-sensitivity distance oracles and routing schemes
• Searching games with errors -- fifty years of coping with liars
• Title not available (Why is that?)
• Communication complexity of fault-tolerant information diffusion
• Efficient broadcasting with linearly bounded faults
• Colouring paths in directed symmetric trees with applications to WDM routing
• Compound constructions of broadcast networks
• A COMPOUNDING ALGORITHM FOR 1-FAULT TOLERANT BROADCAST NETWORKS
• Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance.
• Rapid almost-complete broadcasting in faulty networks
• Consensus vs. Broadcast in Communication Networks with Arbitrary Mobile Omission Faults
• Computing input multiplicity in anonymous synchronous networks with dynamic faults
• Title not available (Why is that?)
• Efficient gossip and robust distributed computation
• Time-efficient broadcast in radio networks
• A survey on undirected circulant graphs
• New bounds on the minimum number of calls in failure‐tolerant gossiping
• Algorithms - ESA 2003
• Broadcasting with locally bounded byzantine faults
• A new parameter for a broadcast algorithm with locally bounded Byzantine faults
• Broadcasting in hypercubes and star graphs with dynamic faults.
• Tighter time bounds on fault-tolerant broadcasting and gossiping
• Feasibility and complexity of broadcasting with random transmission failures
• FAST BROADCASTING WITH BYZANTINE FAULTS
• Dynamic faults have small effect on broadcasting in hypercubes.
• Deterministic Models of Communication Faults
• A fault-tolerant broadcast scheme in the star graph under the single-port, half-duplex communication model
• Stochastic and deterministic fault detection for randomized gossip algorithms
• Confidential gossip
• Meeting the deadline: on the complexity of fault-tolerant continuous gossip
• Reliable broadcasting in product networks

This page was built for publication: Fault-tolerant broadcasting and gossiping in communication networks

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