Robust gossiping with an application to consensus

DOI10.1016/J.JCSS.2006.08.001zbMATH1119.68222OpenAlexW2008636585MaRDI QIDQ856404FDOQ856404

Authors 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

zbMATH Keywords

synchronyconsensusdistributed algorithmcrash failuregossipingmessage passing

Mathematics Subject Classification ID

Distributed algorithms (68W15) Distributed systems (68M14)

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

• scientific article; zbMATH DE number 1306905 (Why is no real title available?)
• scientific article; zbMATH DE number 2013838 (Why is no real title available?)
• scientific article; zbMATH DE number 1849959 (Why is no real title available?)
• scientific article; zbMATH DE number 857072 (Why is no real title available?)
• scientific article; zbMATH DE number 3188071 (Why is no real title available?)
• A lower bound for the time to assure interactive consistency
• A survey of gossiping and broadcasting in communication networks
• Bounds on information exchange for Byzantine agreement
• Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance.
• Efficient gossip and robust distributed computation
• Fast gossiping with short unreliable messages
• Fault Tolerance in Networks of Bounded Degree
• Fault-tolerant broadcasting and gossiping in communication networks
• Fully Polynomial Byzantine Agreement for n > 3t Processors in t + 1 Rounds
• Impossibility of distributed consensus with one faulty process
• Information dissemination in distributed systems with faulty units
• Message-optimal protocols for Byzantine Agreement
• Methods and problems of communication in usual networks
• On the message complexity of binary Byzantine agreement under crash failures
• Performing Work Efficiently in the Presence of Faults
• Probability and Computing
• Ramanujan graphs
• Reaching Agreement in the Presence of Faults
• Resource discovery in distributed networks
• Spatial gossip and resource location protocols
• Telephone Problems with Failures
• The Byzantine Generals Problem
• Tolerating a linear number of faults in networks of bounded degree

Cited in

(26)

• How efficient can gossip be? (On the cost of resilient information exchange)
• Broadcast Gossip Algorithms for Consensus
• Brief Announcement: Improved Consensus in Quantum Networks
• Deterministic Fault-Tolerant Distributed Computing in Linear Time and Communication
• Efficient gossip and robust distributed computation
• Fault-tolerant graph realizations in the congested clique
• Meeting the deadline, on the complexity of fault-tolerant \textsc{Continuous Gossip}
• Gossiping by processors prone to omission failures
• Robust gossip-based aggregation: a practical point of view
• scientific article; zbMATH DE number 7440211 (Why is no real title available?)
• Almost sure exponential convergence to consensus of random gossip algorithms
• The logic of gossiping
• Bounded Confidence Gossip Algorithms for Opinion Formation and Data Clustering
• Time and Communication Efficient Consensus for Crash Failures
• On the Communication Surplus Incurred by Faulty Processors
• New bounds on the minimum number of calls in failure‐tolerant gossiping
• Meeting the deadline: on the complexity of fault-tolerant continuous gossip
• Fast scalable deterministic consensus for crash failures
• Keeping track of the latest gossip in a distributed system
• Communication-efficient randomized consensus
• Doing-it-all with bounded work and communication
• Quiescence of self-stabilizing gossiping among mobile agents in graphs
• Fast agreement in networks with Byzantine nodes
• Asynchronous gossip
• Efficient gossip and robust distributed computation
• Gossip Algorithms for Convex Consensus Optimization Over Networks

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)