Robust gossiping with an application to consensus
From MaRDI portal
Publication:856404
DOI10.1016/J.JCSS.2006.08.001zbMATH Open1119.68222OpenAlexW2008636585MaRDI QIDQ856404FDOQ856404
Dariusz R. Kowalski, Bogdan S. Chlebus
Publication date: 7 December 2006
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2006.08.001
Recommendations
- Robust gossip-based aggregation: a practical point of view
- Broadcast Gossip Algorithms for Consensus on Strongly Connected Digraphs
- A Gossip-Based Algorithm for Discrete Consensus Over Heterogeneous Networks
- Efficient gossip and robust distributed computation
- Efficient gossip and robust distributed computation
- Gossip Algorithms for Convex Consensus Optimization Over Networks
- Broadcast Gossip Ratio Consensus: Asynchronous Distributed Averaging in Strongly Connected Networks
- Broadcast Gossip Algorithms for Consensus
- Gossip consensus algorithms via quantized communication
- Almost sure exponential convergence to consensus of random gossip algorithms
Cites Work
- Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance.
- A survey of gossiping and broadcasting in communication networks
- Fault-tolerant broadcasting and gossiping in communication networks
- Title not available (Why is that?)
- Ramanujan graphs
- Probability and Computing
- Tolerating a linear number of faults in networks of bounded degree
- Methods and problems of communication in usual networks
- Impossibility of distributed consensus with one faulty process
- Reaching Agreement in the Presence of Faults
- The Byzantine Generals Problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- A lower bound for the time to assure interactive consistency
- Fully Polynomial Byzantine Agreement for n > 3t Processors in t + 1 Rounds
- Bounds on information exchange for Byzantine agreement
- Performing Work Efficiently in the Presence of Faults
- Title not available (Why is that?)
- Fault Tolerance in Networks of Bounded Degree
- Efficient gossip and robust distributed computation
- Title not available (Why is that?)
- Spatial gossip and resource location protocols
- Information dissemination in distributed systems with faulty units
- Message-optimal protocols for Byzantine Agreement
- On the message complexity of binary Byzantine agreement under crash failures
- Fast gossiping with short unreliable messages
- Resource discovery in distributed networks
- Telephone Problems with Failures
Cited In (19)
- Broadcast Gossip Algorithms for Consensus
- Quiescence of self-stabilizing gossiping among mobile agents in graphs
- Gossiping by processors prone to omission failures
- Bounded Confidence Gossip Algorithms for Opinion Formation and Data Clustering
- Gossip Algorithms for Convex Consensus Optimization Over Networks
- The logic of gossiping
- Fast agreement in networks with Byzantine nodes
- Efficient gossip and robust distributed computation
- On the Communication Surplus Incurred by Faulty Processors
- Brief Announcement: Improved Consensus in Quantum Networks
- Deterministic Fault-Tolerant Distributed Computing in Linear Time and Communication
- Time and Communication Efficient Consensus for Crash Failures
- Almost sure exponential convergence to consensus of random gossip algorithms
- New bounds on the minimum number of calls in failure‐tolerant gossiping
- Communication-efficient randomized consensus
- Title not available (Why is that?)
- Meeting the deadline: on the complexity of fault-tolerant continuous gossip
- Fault-tolerant graph realizations in the congested clique
- Doing-it-all with bounded work and communication
This page was built for publication: Robust gossiping with an application to consensus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q856404)
