Asynchronous gossip

DOI10.1145/2450142.2450147MaRDI QIDQ5395710zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Chryssis Georgiou, Dariusz R. Kowalski, Rachid Guerraoui, Seth Gilbert

Publication date 17 February 2014

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://infoscience.epfl.ch/record/188872/files/async_gossip_a11-georgiou.pdf

zbMATH Keywords

adaptive versus oblivious adversaryasynchronycomplexityconsensusepidemicgossiprandomization

Mathematics Subject Classification ID

Combinatorial probability (60C05) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Recommendations

• On the complexity of asynchronous gossip
• Odd gossiping
• Robust gossiping with an application to consensus
• Simple, fast and deterministic gossip and rumor spreading

Cited in

(9)

• Breathe before speaking: efficient information dissemination despite noisy, limited and anonymous communication
• Confidential gossip
• An asynchronous randomized gossip consensus algorithm with nonuniform-selected probability and optimization
• Rumor spreading with no dependence on conductance
• scientific article; zbMATH DE number 3849231 (Why is no real title available?)
• Keeping track of the latest gossip in a distributed system
• Doing-it-all with bounded work and communication
• Who started this rumor? Quantifying the natural differential privacy of gossip protocols
• Early adapting to trends: self-stabilizing information spread using passive communication

This page was built for publication: Asynchronous gossip

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