Search and replication in unstructured peer-to-peer networks
ICS '02 Proceedings of the 16th international conference on Supercomputing
Security Considerations for Peer-to-Peer Distributed Hash Tables
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Secure routing for structured peer-to-peer overlay networks
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
Detecting Malicious Beacon Nodes for Secure Location Discovery in Wireless Sensor Networks
ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
Distributed Uniform Sampling in Unstructured Peer-to-Peer Networks
HICSS '06 Proceedings of the 39th Annual Hawaii International Conference on System Sciences - Volume 09
Peer counting and sampling in overlay networks: random walk methods
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
SybilGuard: defending against sybil attacks via social networks
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
ACM Transactions on Computer Systems (TOCS)
SybilLimit: A Near-Optimal Social Network Defense against Sybil Attacks
SP '08 Proceedings of the 2008 IEEE Symposium on Security and Privacy
Brahms: byzantine resilient random membership sampling
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
PeerCube: A Hypercube-Based P2P Overlay Robust against Collusion and Churn
SASO '08 Proceedings of the 2008 Second IEEE International Conference on Self-Adaptive and Self-Organizing Systems
On unbiased sampling for unstructured peer-to-peer networks
IEEE/ACM Transactions on Networking (TON)
An analytical model of information dissemination for a gossip-based protocol
Computer Networks: The International Journal of Computer and Telecommunications Networking
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
Analytical Study of Adversarial Strategies in Cluster-based Overlays
PDCAT '09 Proceedings of the 2009 International Conference on Parallel and Distributed Computing, Applications and Technologies
Computer Networks: The International Journal of Computer and Telecommunications Networking
Making chord robust to byzantine attacks
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Simple efficient load balancing algorithms for peer-to-peer systems
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Research note: On the uniformity of peer sampling based on view shuffling
Journal of Parallel and Distributed Computing
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 |
We consider the problem of uniform sampling in large scale open systems. Uniform sampling is a fundamental primitive that guarantees that any individual in a population has the same probability to be selected as sample. An important issue that seriously hampers the feasibility of uniform sampling in open and large scale systems is the unavoidable presence of malicious nodes. In this paper we show that restricting the number of requests that malicious nodes can issue and allowing for a full knowledge of the composition of the system is a necessary and sufficient condition to guarantee uniform and ergodic sampling. In a nutshell, a uniform and ergodic sampling guarantees that any node in the system is equally likely to appear as a sample at any non malicious node in the system and that infinitely often any node has a nonnull probability to appear as a sample of honest nodes.