Byzantine resilient random membership sampling

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2008, Pages 145-154

  Bortnikov, Edward ^a   Gurevich, Maxim ^b   Keidar, Idit ^b   Kliot, Gabriel ^b   Shraer, Alexander ^b  

^a YAHOO RESEARCH   (United States)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Byzantine faults; Gossip; Membership; Random sampling

Indexed keywords

BYZANTINE FAULTS; DYNAMIC SYSTEMS; GOSSIP; GOSSIP PROTOCOLS; HIGH PROBABILITIES; LINEAR PORTIONS; MALICIOUS BEHAVIORS; MEMBERSHIP; MEMBERSHIP PROTOCOLS; RANDOM SAMPLING; RIGOROUS ANALYSIS; THEORETICAL MODELS; TWO COMPONENTS; UNIFORM SAMPLINGS;

EID: 57549096534     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (30)

1. A. Allavena, A. Demers, and J. E. Hopcroft. Correctness of a gossip based membership protocol. In ACM PODC, pages 292-301, 2005.
2. H. Attiya and J. Welch. Distributed Computing Fundamentals, Simulations, and Advanced Topics. John Wiley and Sons, Inc., 2004.
3. B. Awerbuch and C. Scheideler. Towards a Scalable and Robust DHT. In SPAA, pages 318-327, 2006.
4. G. Badishi, I. Keidar, and A. Sasson. Exposing and Eliminating Vulnerabilities to Denial of Service Attacks in Secure Gossip-Based Multicast. In DSN, pages 201-210, June-July 2004.
5. Z. Bar-Yossef, R. Friedman, and G. Kliot. RaWMS - Random Walk based Lightweight Membership Service for Wireless Ad Hoc Networks. In ACM MobiHoc, pages 238-249, 2006.
6. K. P. Birman, M. Hayden, O. Ozkasap, Z. Xiao, M. Budiu, and Y. Minsky. Bimodal multicast. ACM Transactions on Computer Systems, 17(2):41-88, 1999.
7. E. Bortnikov, M. Gurevich, I. Keidar, G. Kliot, and A. Shraer. Brahms: Byzantine Resilient Random Membership Sampling. Technical Report CCIT Report #688, Technion, Feb 2008.
8. A. Z. Broder, M. Charikar, A. M. Frieze, and M. Mitzenmacher. Min-wise independent permutations. J. Computer and System Sciences, 60(3):630-659, 2000.
9. T. Condie, V. Kacholia, S. Sankararaman, J. Hellerstein, and P. Maniatis. Induced Churn as Shelter from RoutingTable Poisoning. In NDSS, 2006.
10. A. Demers, D. Greene, C. Hauser, W. Irish, J. Larson, S. Shenker, H. Sturgis, D. Swinehart, and D. Terry. Epidemic Algorithms for Replicated Database Management. In ACM PODC, pages 1-12, August 1987.
11. D. Malkhi, Y. Mansour, and M. K. Reiter. On Diffusing Updates in a Byzantine Environment. In SRDS, pages 134-143, 1999.
12. J. R. Douceur. The Sybil Attack. In IPTPS. 2002.
13. P. Th. Eugster, R. Guerraoui, S. B. Handurukande, P. Kouznetsov, and A.-M. Kermarrec. Lightweight probabilistic broadcast. ACM Transactions on Computer Systems (TOCS), 21(4):341-374, 2003.
14. A. J. Ganesh, A.-M. Kermarrec, and L. Massoulie. Peer-to-Peer Membership Management for Gossip-Based Protocols. IEEE Trans. Comput., 52(2): 139-149, 2003.
15. C. Gkantsidis, M. Mihail, and A. Saberi. Random walks in peer-to-peer networks. In IEEE INFOCOM, 2004.
16. O. Goldreich, S. Goldwasser, and S. Micali. How to construct random functions. JACM, 33(4):792-807, 1986.
17. B. P. Hillam. A Generalization of Krasnoselski's Theorem on the Real Line. Math. Mag., 48:167-168, 1975.
18. M. Jelasity, S. Voulgaris, R. Guerraoui, A.-M. Kermarrec, and M. van Steen. Gossip-based peer sampling. ACM TOCS, 25(3):8, 2007.
19. H. Johansen, A. Allavena, and R. van Renesse. Fireflies: scalable support for intrusion-tolerant network overlays. In Proc. of the 2006 EuroSys conference (EuroSysj), pages 3-13, 2006.
20. V. King and J. Saia. Choosing a random peer. In ACM PODC, pages 125-130, 2004.
21. C. Law and K. Siu. Distributed construction of random expander networks. In IEEE INFOCOM, April 2003.
22. H. C. Li, A. Clement, E. L. Wong, J. Napper, I. Roy, L. Alvisi, and M. Dahlin. BAR Gossip. In Proc. of the 7th USENIX Symp. on Open Systems Design and Impl. (OSDI), pages 45-58, Nov. 2006.
23. C. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker. Search and replication in unstructured peer-to-peer networks. In Proc. of the 16th Intr. Conference on Supercomputing (ICS), pages 84-95, 2002.
24. G. Manku, M. Bawa, and P. Raghavan. Symphony: Distributed hashing in a small world. In Proc. of the 4th USENIX Symposium on Internet Technologies and Systems (USITS), 2003.
25. L. Massoulie, E. Le Merrer, A.-M. Kermarrec, and A. J. Ganesh. Peer Counting and Sampling in Overlay Networks: Random Walk Methods. In ACM PODC, pages 123-132, 2006.
26. R. Melamed and I. Keidar. Araneola: A Scalable Reliable Multicast System for Dynamic Environments. In IEEE NCA, pages 5-14, 2004.
27. R. C. Merkle. Secure Communications over Insecure Channels. CACM. 21:294-299, April 1978.
28. Y M. Minsky and F. B. Schneider. Tolerating Malicious Gossip. Dist. Computing, 16(1):49-68, February 2003.
29. Atul Singh, T.-W. Ngan. Peter Druschel, and Dan S. Wallach. Eclipse Attacks on Overlay Networks: Threats and Defenses. In IEEE INFOCOM, 2006.'
30. S. Voulgaris, D. Gavidia, and M. van Steen. CYCLON: Inexpensive Membership Management for Unstructured P2P Overlays. Journal of Network and Systems Management, 13(2): 197-217, July 2005.