Correctness of gossip-based membership under message loss

DOI10.1145/1582716.1582743zbMath1291.68036OpenAlexW2167618262MaRDI QIDQ5170312

Maxim Gurevich, Idit Keidar

Publication date: 23 July 2014

Published in: Proceedings of the 28th ACM symposium on Principles of distributed computing (Search for Journal in Brave)

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

zbMATH Keywords

random samplingpeer-to-peermembershipgossip

Mathematics Subject Classification ID

Network protocols (68M12)

Related Items (2)

On the uniformity of peer sampling based on view shuffling ⋮ Maintaining the Ranch topology

This page was built for publication: Correctness of gossip-based membership under message loss