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