Brahms: Byzantine resilient random membership sampling

DOI10.1016/J.COMNET.2009.03.008zbMath1176.68018OpenAlexW2022929184MaRDI QIDQ838500

Edward Bortnikov, Alexander Shraer, Idit Keidar, Maxim Gurevich, Gabriel Kliot

Publication date: 26 August 2009

Published in: Computer Networks (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.142.2436

zbMATH Keywords

random samplingmembershipgossipbyzantine faults

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Randomized algorithms (68W20)

Related Items (3)

DEPENDABILITY EVALUATION OF CLUSTER-BASED DISTRIBUTED SYSTEMS ⋮ Unnamed Item ⋮ Decentralized polling with respectable participants

This page was built for publication: Brahms: Byzantine resilient random membership sampling