Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Lightweight probabilistic broadcast
ACM Transactions on Computer Systems (TOCS)
Gossip-Based Computation of Aggregate Information
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Peer-to-peer networks based on random transformations of connected regular undirected graphs
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Peer counting and sampling in overlay networks: random walk methods
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Distributed random digraph transformations for peer-to-peer networks
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
TERA: topic-based event routing for peer-to-peer architectures
Proceedings of the 2007 inaugural international conference on Distributed event-based systems
ACM Transactions on Computer Systems (TOCS)
Brahms: byzantine resilient random membership sampling
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
PuppetCast: A Secure Peer Sampling Protocol
EC2ND '08 Proceedings of the 2008 European Conference on Computer Network Defense
An analytical model of information dissemination for a gossip-based protocol
Computer Networks: The International Journal of Computer and Telecommunications Networking
T-Man: Gossip-based fast overlay topology construction
Computer Networks: The International Journal of Computer and Telecommunications Networking
The flip markov chain and a randomising P2P protocol
Proceedings of the 28th ACM symposium on Principles of distributed computing
Correctness of gossip-based membership under message loss
Proceedings of the 28th ACM symposium on Principles of distributed computing
A Formal Characterization of Uniform Peer Sampling Based on View Shuffling
PDCAT '09 Proceedings of the 2009 International Conference on Parallel and Distributed Computing, Applications and Technologies
Coupling-Based Internal Clock Synchronization for Large-Scale Dynamic Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Uniform and ergodic sampling in unstructured peer-to-peer systems with malicious nodes
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Characterizing the adversarial power in uniform and ergodic node sampling
Proceedings of the First International Workshop on Algorithms and Models for Distributed Event Processing
| Hi-index | 0.00 |
Consider a group of peers, an ideal random peer sampling service should return a peer, which is a uniform independent random sample of the group. This paper focuses on the implementation and analysis of a peer sampling service based on symmetric view shuffling, where each peer is equipped with a local view of size c, representing a uniform random sample of size c of the whole system. To this end, pairs of peers regularly and continuously swap a part of their local views (shuffle operation). The paper provides the following formal proofs: (i) starting from any non-uniform distribution of peers in the peers' local views, after a sequence of pairwise shuffle operations, each local view eventually represents a uniform sample of size c; (ii) once the previous property holds, any successive sequence of shuffle operations does not modify this uniformity property and (iii) a lower bound for convergence speed. This paper also presents some numerical results concerning the speed of convergence to uniform samples of the local views.