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

Full description

Saved in:

Bibliographic Details
Published in:	International journal of parallel, emergent and distributed systems Vol. 36; no. 5; pp. 412 - 439
Main Authors:	Anceaume, Emmanuelle, Busnel, Yann, Sericola, Bruno
Format:	Journal Article
Language:	English
Published:	Abingdon Taylor & Francis 03.09.2021 Taylor & Francis Ltd
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!