Correctness of a gossip based membership protocol

DOI10.1145/1073814.1073871zbMath1314.68038OpenAlexW2010505009MaRDI QIDQ5177252

John E. Hopcrofts, André Allavena, Alan Demers

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

reliabilityrandom graphsscalabilitygroup communicationepidemicpeer-to-peermembershipgossipprobabilistic multi-cast

Mathematics Subject Classification ID

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

Related Items (1)

A probabilistic characterization of a fault-tolerant gossiping algorithm

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