How efficient can gossip be? (On the cost of resilient information exchange)

DOI10.1007/978-3-642-14162-1_10zbMATH Open1288.68007OpenAlexW1864333249MaRDI QIDQ3587432FDOQ3587432

Authors: Dan Alistarh, Morteza Zadimoghaddam, Rachid Guerraoui, Seth Gilbert 

Publication date: 7 September 2010

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-14162-1_10

Recommendations

• Efficient gossip and robust distributed computation
• Optimal gossip with direct addressing
• Efficient gossip and robust distributed computation
• On the complexity of asynchronous gossip
• Robust gossiping with an application to consensus

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14) Network protocols (68M12)

Cited In (8)

• A probabilistic characterization of a fault-tolerant gossiping algorithm
• On collaborative content distribution using multi-message gossip
• Robust gossip-based aggregation: a practical point of view
• Correctness of gossip-based membership under message loss
• Breathe before speaking
• Correctness of gossip-based membership under message loss
• Gossip and the efficiency of interactions
• Who started this rumor? Quantifying the natural differential privacy of gossip protocols

This page was built for publication: How efficient can gossip be? (On the cost of resilient information exchange)

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