Correctness of Gossip-Based Membership under Message Loss

DOI10.1137/090769752zbMath1209.68048OpenAlexW2014751107MaRDI QIDQ5390617

Idit Keidar, Maxim Gurevich

Publication date: 4 April 2011

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/090769752

zbMATH Keywords

random samplingpeer-to-peermembershipgossip

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Related Items (3)

DEX: self-healing expanders ⋮ Distributed data clustering in sensor networks ⋮ Breaking the \(\log n\) barrier on rumor spreading

This page was built for publication: Correctness of Gossip-Based Membership under Message Loss