Brahms: Byzantine resilient random membership sampling

Computer Networks

Volumn 53, Issue 13, 2009, Pages 2340-2359

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

^a YAHOO RESEARCH   (United States)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^c MICROSOFT RESEARCH   (United States)

Author keywords

Byzantine faults; Gossip; Membership; Random sampling

Indexed keywords

BYZANTINE FAULTS; DYNAMIC SYSTEMS; GOSSIP; GOSSIP PROTOCOLS; HIGH PROBABILITY; LINEAR PORTIONS; MALICIOUS BEHAVIOR; MEMBERSHIP; MEMBERSHIP PROTOCOLS; RANDOM SAMPLING; RIGOROUS ANALYSIS; THEORETICAL MODELS; TWO-COMPONENT;

EID: 67650523874     PISSN: 13891286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comnet.2009.03.008     Document Type: Article

References (44)

1. A. Allavena, A. Demers, J.E. Hopcroft, Correctness of a gossip based membership protocol, in: ACM PODC, 2005, pp. 292-301.
2. N. Alon, Y. Matias, M. Szegedy, The space complexity of approximating the frequency moments, in: Proc. of the 28th Annual ACM Symposium on Theory of Computing (STOC), 1996, pp. 20-29.
3. Attiya H., and Welch J. Distributed Computing Fundamentals, Simulations, and Advanced Topics (2004), John Wiley and Sons, Inc.
4. B. Awerbuch, C. Scheideler, Group spreading: a protocol for provably secure distributed name service, in: ICALP, 2004, pp. 183-195.
5. B. Awerbuch, C. Scheideler, Robust random number generation for peer-to-peer systems, in: OPODIS, 2006, pp. 275-289.
6. B. Awerbuch, C. Scheideler, Towards a scalable and robust DHT, in: SPAA, 2006, pp. 318-327.
7. B. Awerbuch, C. Scheideler, Towards scalable and robust overlay networks, in: IPTPS, 2006.
8. B. Babcock, M. Datar, R. Motwani, Sampling from a moving window over streaming data, in: Proc. of the 13th annual ACM-SIAM symposium on Discrete algorithms (SODA), 2002, pp. 633-634.
9. G. Badishi, I. Keidar, A. Sasson, Exposing and eliminating vulnerabilities to denial of service attacks in secure gossip-based multicast, in: DSN, June-July 2004, pp. 201-210.
10. Z. Bar-Yossef, R. Friedman, G. Kliot, RaWMS - random walk based lightweight membership service for wireless ad hoc networks, in: ACM MobiHoc, 2006, pp. 238-249.
11. Z. Bar-Yossef, M. Gurevich, Random sampling from a search engine's index, in: Proc. of 15th WWW, 2006, pp. 367-376, Full version available as CCIT Report #598, Department of Electrical Engineering, Technion.
12. Z. Bar-Yossef, T.S. Jayram, R. Kumar, D. Sivakumar, L. Trevisan, Counting distinct elements in a data stream, in: Proc. of the Sixth International Workshop on Randomization and Approximation Techniques (RANDOM), 2002, pp. 1-10.
13. Birman K.P., Hayden M., Ozkasap O., Xiao Z., Budiu M., and Minsky Y. Bimodal multicast. ACM Trans. Comput. Syst. 17 2 (1999) 41-88
14. Broder A.Z., Charikar M., Frieze A.M., and Mitzenmacher M. Min-wise independent permutations. J. Comput. Syst. Sci. 60 3 (2000) 630-659
15. M. Castro, P. Druschel, A.J. Ganesh, A.I.T. Rowstron, D.S. Wallach, Secure routing for structured peer-to-peer overlay networks, in: OSDI, 2002.
16. T. Condie, V. Kacholia, S. Sankararaman, J. Hellerstein, P. Maniatis, Induced churn as shelter from routing-table poisoning, in: Proc. of the 13th Annual Network and Distributed System Security Symposium (NDSS), 2006.
17. Datar M., Gionis A., Indyk P., and Motwani R. Maintaining Stream Statistics over Sliding Windows. SIAM J. Comput. 31 6 (2002) 1794-1813
18. A. Demers, D. Greene, C. Hauser, W. Irish, J. Larson, S. Shenker, H. Sturgis, D. Swinehart, D. Terry. epidemic algorithms for replicated database management, in: ACM PODC, August 1987, pp. 1-12.
19. D. Malkhi, Y. Mansour, M. K. Reiter, On diffusing updates in a Byzantine environment, in: SRDS, 1999, pp. 134-143.
20. J.R. Douceur, The Sybil attack, in: Proc. of the First International Workshop on Peer-to-Peer Systems (IPTPS), 2002, pp. 251-260.
21. Eugster P.Th., Guerraoui R., Handurukande S.B., Kouznetsov P., and Kermarrec A.-M. Lightweight probabilistic broadcast. ACM Trans. Comput. Syst. (TOCS) 21 4 (2003) 341-374
22. Ganesh A.J., Kermarrec A.-M., and Massoulie L. Peer-to-Peer membership management for gossip-based protocols. IEEE Trans. Comput. 52 2 (2003) 139-149
23. C. Gkantsidis, M. Mihail, A. Saberi, Random walks in peer-to-peer networks, in: IEEE INFOCOM, 2004, pp. 130-140.
24. Goldreich O., Goldwasser S., and Micali S. How to construct random functions. JACM 33 4 (1986) 792-807
25. Hillam B.P. A generalization of Krasnoselski's theorem on the real line. Math. Mag. 48 (1975) 167-168
26. Jelasity M., Voulgaris S., Guerraoui R., Kermarrec A.-M., and van Steen M. Gossip-based peer sampling. ACM Trans. Comput. Syst. (TOCS) 25 3 (2007) 8
27. G.-P. Jesi, M. van Steen, D. Hales, Identifying malicious peers before it's too late: a decentralized secure peer sampling service, in: Proc. of the First IEEE International Conference on Self-adaptive and Self-organizing Systems (SASO), June 2007.
28. H. Johansen, A. Allavena, R. van Renesse, Fireflies: scalable support for intrusion-tolerant network overlays, in: Proc. of the 2006 EuroSys Conference (EuroSys), 2006, pp. 3-13.
29. D. Karger, E. Lehman, T. Leighton, M. Levine, D. Lewin, R. Panigrahy, Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the world wide web, in: Proc. of the ACM STOC, 1997, pp. 654-663.
30. D.R. Karger, M. Ruhl, Simple efficient load balancing algorithms for peer-to-peer systems, in: SPAA, 2004, pp. 36-43.
31. V. King, J. Saia, Choosing a random peer, in: ACM PODC, 2004, pp. 125-130.
32. C. Law, K. Siu, Distributed construction of random expander networks, in: IEEE INFOCOM, April 2003, pp. 2133-2143.
33. H.C. Li, A. Clement, E.L. Wong, J. Napper, I. Roy, L. Alvisi, M. Dahlin, BAR gossip, in: Proc. of the Seventh USENIX Symp. on Oper. Systems Design and Impl. (OSDI), November 2006, pp. 45-58.
34. C. Lv, P. Cao, E. Cohen, K. Li, S. Shenker, Search and replication in unstructured peer-to-peer networks, in: Proc. of the 16th Intr. Conference on Supercomputing (ICS), 2002, pp. 84-95.
35. G. Manku, M. Bawa, P. Raghavan, Symphony: distributed hashing in a small world, in: Proc. of the Fourth USENIX Symposium on Internet Technologies and Systems (USITS), 2003.
36. L. Massoulie, E. Le Merrer, A.-M. Kermarrec, A.J. Ganesh, Peer counting and sampling in overlay networks: random walk methods, in: ACM PODC, 2006, pp. 123-132.
37. R. Melamed, I. Keidar, Araneola: a scalable reliable multicast system for dynamic environments, in: IEEE NCA, 2004, pp. 5-14.
38. Merkle R.C. Secure communications over insecure channels. CACM 21 (1978) 294-299
39. Minsky Y.M., and Schneider F.B. Tolerating malicious gossip. Dist. Comput. 16 1 (2003) 49-68
40. A. Singh, M. Castro, P. Druschel, A. Rowstron, Defending against eclipse attacks on overlay networks, in: ACM SIGOPS European Workshop, 2004.
41. A. Singh, T.-W. Ngan, P. Druschel, D.S. Wallach, Eclipse attacks on overlay networks: threats and defenses, in: IEEE INFOCOM, 2006.
42. Vitter J.S. Random sampling with a reservoir. ACM Trans. Math. Softw. 11 1 (1985) 37-57
43. Voulgaris S., Gavidia D., and van Steen M. CYCLON: inexpensive membership management for unstructured P2P overlays. J. Netw. Syst. Manage. 13 2 (2005) 197-217
44. Yu H., Kaminsky M., Gibbons P.B., and Flaxman A. SybilGuard: defending against Sybil attacks via social networks. IEEE/ACM Trans. Netw. (ToN) 16 3 (2008) 576-589