Byzantine-tolerant uniform node sampling service in large-scale networks. Issue 5 (3rd September 2021)

• Record Type: Journal Article
• Authors: Anceaume, Emmanuelle; Busnel, Yann; Sericola, Bruno
• Is Part Of: International journal of parallel, emergent and distributed systems. Volume 36:Issue 5(2021)
• Page Start: 412
• Page End: 439
• Publication Date: 2021-09-03
• Subjects: Data stream -- Byzantine nodes -- uniform sampling -- Markov chains -- randomised approximation algorithm; Parallel computers -- Periodicals; Electronic data processing -- Distributed processing -- Periodicals; Computer algorithms -- Periodicals; 004.35
• DOI: 10.1080/17445760.2021.1939873
• Languages: English
• ISSNs: 1744-5760

Abstract

Abstract : We consider the problem of achieving uniform node sampling in large scale systems in presence of Byzantine nodes. This service offers a single simple primitive that returns, upon invocation, the identifier of a random node that belongs to the system. We first propose an omniscient strategy that processes on the fly an unbounded and arbitrarily biased input stream made of node identifiers exchanged within the system, and outputs a stream that preserves the uniformity property (same probability to appear in the sample). We show that this property holds despite any arbitrary bias introduced by the adversary. We then propose a strategy that is capable of approximating the omniscient strategy without requiring any prior knowledge on the composition of the input stream. We show through both theoretical analysis and extensive simulations that this strategy accurately approximates the omniscient one. We evaluate the resilience of the strategy by studying two representative attacks. We quantify the minimum number of identifiers that Byzantine nodes must insert in the input stream to prevent uniformity. Finally, we propose a new construction in series that allows to both increase the accuracy of a single sketch and decrease the time to converge to a uniform output stream.