Correctness of a gossip based membership protocol

DOI10.1145/1073814.1073871MaRDI QIDQ5177252zbMATH OpenOpenAlexFDO

Authors André Allavena, Alan Demers, John Hopcroft

Publication date 10 March 2015

Published in Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1073814.1073871

zbMATH Keywords

epidemicgossipgroup communicationmembershippeer-to-peerprobabilistic multi-castrandom graphsreliabilityscalability

Mathematics Subject Classification ID

Network protocols (68M12) Distributed systems (68M14) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15) Communication networks in operations research (90B18)

Recommendations

• Correctness of gossip-based membership under message loss
• Correctness of gossip-based membership under message loss
• scientific article; zbMATH DE number 2080512
• A probabilistic characterization of a fault-tolerant gossiping algorithm
• Dynamic gossip

Cited in

(7)

• A probabilistic characterization of a fault-tolerant gossiping algorithm
• scientific article; zbMATH DE number 2080512 (Why is no real title available?)
• Correctness of gossip-based membership under message loss
• Correctness of gossip-based membership under message loss
• Distributed Computing – IWDC 2005
• Agents and Peer-to-Peer Computing
• Robust privacy-preserving gossip averaging

This page was built for publication: Correctness of a gossip based membership protocol

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