Characterizing the adversarial power in uniform and ergodic node sampling

ACM International Conference Proceeding Series

Volumn , Issue , 2011, Pages 12-19

  Anceaume, Emmanuelle ^a   Busnel, Yann ^b   Gambs, Sébastien ^c  

^a CNRS   (France)

^b UNIVERSITÉ DE NANTES   (France)

^c UNIVERSITÉ DE RENNES 1   (France)

Author keywords

Algorithms; Theory

Indexed keywords

ERGODICS; INPUT STREAMS; LARGE-SCALE DYNAMICS; LOWER BOUNDS; MALICIOUS NODES; NODE IDENTIFIERS; NODE SAMPLING; REALISTIC MODEL; SAMPLING STRATEGIES; THEORY;

ALGORITHMS; MATHEMATICAL MODELS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 80053911680     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2031792.2031795     Document Type: Conference Paper

References (23)

1. S. M. Ali and S. D. Silvey. General Class of Coeffcients of Divergence of One Distribution from Another. Journal of the Royal Statistical Society. Series B (Methodological), 28(1):131-142, 1966.
2. E. Anceaume, F. V. Brasileiro, R. Ludinard, B. Sericola, and F. Tronel. Dependability Evaluation of Cluster-based Distributed Systems. International Journal of Foundations of Computer Science (IJFCS), 5(22), 2011.
3. E. Anceaume, Y. Busnel, and S. Gambs. Uniform and Ergodic Sampling in Unstructured Peer-to-Peer Systems with Malicious Nodes. In Proceedings of the 14th International Conference On Principles Of Distributed Systems (OPODIS), volume 6490, pages 64-78, 2010.
4. B. Awerbuch and C. Scheideler. Towards a Scalable and Robust Overlay Network. In Proceedings of the 6th International Workshop on Peer-to-Peer Systems (IPTPS), 2007.
5. R. Baldoni, R. Beraldi, V. Quema, L. Querzoni, and S. Tucci-Piergiovanni. TERA: Topic-based Event Routing for Peer-to-peer Architectures. In Proceedings of the International Conference on Distributed Event-Based Systems (DEBS), pages 2-13. ACM, 2007. (Pubitemid 47281501)
6. M. Bertier, Y. Busnel, and A.-M. Kermarrec. On Gossip and Populations. In Proceedings of the 16th International Colloquium on Structural Information and Communication Complexity (SIROCCO), 2009.
7. E. Bortnikov, M. Gurevich, I. Keidar, G. Kliot, and A. Shraer. Brahms: Byzantine Resilient Random Membership Sampling. Computer Networks, 53:2340-2359, 2009. A former version appeared in the 27th ACM Symposium on Principles of Distributed Computing (PODC), 2008.
8. Y. Busnel, R. Beraldi, and R. Baldoni. On the Uniformity of Peer Sampling based on View Shuffing. Journal of Parallel and Distributed Computing, To appear (In Press, Corrected Proof), 2011.
9. T. Cover and J. Thomas. Elements of information theory. Wiley New York, 1991.
10. P. B. Godfrey, S. Shenker, and I. Stoica. Minimizing churn in distributed systems. In Proceedings of the ACM SIGCOMM, 2006.
11. M. Gurevich and I. Keidar. Correctness of Gossip-Based Membership under Message Loss. In Proceedings of the 28th annual Symposium on Principles of distributed computing (PODC), Calgary, AL, Canada, 2009. ACM Press.
12. M. Jelasity, S. Voulgaris, R. Guerraoui, A.-M. Kermarrec, and M. van Steen. Gossip-based Peer Sampling. ACM Transaction on Computer System, 25(3), 2007.
13. G. P. Jesi, A. Montresor, and M. van Steen. Secure Peer Sampling. Computer Networks, 54(12):2086-2098, 2010.
14. D. R. Karger and M. Ruhl. Simple Effcient Load Balancing Algorithms for Peer-to-Peer. In Proceedings of the 3rd International Workshop on Peer-to-Peer Systems (IPTPS), 2004.
15. S. Le Blond, F. Le Fessant, and E. Le Merrer. Finding Good Partners in Availability-Aware P2P Networks. In Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), pages 472-484. Springer-Verlag, 2009.
16. D. Liu, P. Ning, and W. Du. Detecting Malicious Beacon Nodes for Secure Location Discovery in Wireless Sensor Networks. In Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (ICDCS), 2005.
17. Q. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker. Search and Replication in Unstructured Peer-to-Peer Networks. In Proceedings of the International Conference on Supercomputing (ICS), pages 84-95, 2002. (Pubitemid 35039987)
18. D. Malkhi, M. K. Reiter, A. Wool, and R. N. Wright. Probabilistic Byzantine Quorum Systems. In Proceedings of the 21rst annual ACM Symposium on Principles of Distributed Computing (PODC), 2008.
19. L. Massoulié, E. L. Merrer, A.-M. Kermarrec, and A. Ganesh. Peer Counting and Sampling in Overlay Networks: Random Walk Methods. In Proceedings of the 25th Annual Symposium on Principles of Distributed Computing (PODC), pages 123-132. ACM Press, 2006. (Pubitemid 44393700)
20. G. Monge. Mémoire sur la théorie des déblais et des remblais. Histoire de l'Academie royale des sciences, avec les Mémoires de Mathématique et de Physique, pages 666-704, 1781.
21. A. Singh, T.-W. Ngan, P. Druschel, and D. S. Wallach. Eclipse Attacks on Overlay Networks: Threats and Defenses. In Proceedings of the 25th IEEE International Conference on Computer Communications (INFOCOM), 2006.
22. H. Yu, P. B. Gibbons, M. Kaminsky, and F. Xiao. SybilLimit: A Near-Optimal Social Network Defense against Sybil Attacks. In Proceedings of the IEEE Symposium on Security and Privacy (SP), pages 3-17, 2008.
23. H. Yu, M. Kaminsky, P. B. Gibbons, and A. Flaxman. SybilGuard: Defending against Sybil Attacks via Social Networks. In Proceedings of the ACM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM), pages 267-278, 2006. (Pubitemid 44623733)