Byzantine-tolerant uniform node sampling service in large-scale networks

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 proc...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International journal of parallel, emergent and distributed systems Jg. 36; H. 5; S. 412 - 439
Hauptverfasser: Anceaume, Emmanuelle, Busnel, Yann, Sericola, Bruno
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Abingdon Taylor & Francis 03.09.2021
Taylor & Francis Ltd
Schlagworte:
Byzantine nodes
Computer Science
Data stream
Data Structures and Algorithms
Distributed, Parallel, and Cluster Computing
Information Theory
Markov chains
Nodes
randomised approximation algorithm
Sampling
uniform sampling
Randomized approximation algorithm
Markov chains
Data stream
Byzantine nodes
Uniform sampling
ISSN:1744-5760, 1744-5779
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1744-5760
1744-5779
DOI:10.1080/17445760.2021.1939873