Bar gossip

OSDI 2006 - 7th USENIX Symposium on Operating Systems Design and Implementation

Volumn , Issue , 2006, Pages 191-204

  Li, Harry C ^a   Clement, Allen ^a   Wong, Edmund L ^a   Napper, Jeff ^a   Roy, Indrajit ^a   Alvisi, Lorenzo ^a   Dahlin, Michael ^a  

^a University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SYSTEMS ANALYSIS;

DATA DISSEMINATION; DATA STREAMING; NODE REPUTATIONS; NON DETERMINISM; PARTNER SELECTION; PREDICTABLE THROUGHPUT; RAPID CONVERGENCE; STREAMING APPLICATIONS;

PEER TO PEER NETWORKS;

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

References (42)

1. A. S. Aiyer, L. Alvisi, A. Clement, M. Dahlin, J.-P. Martin, and C. Porth. BAR Fault Tolerance for Cooperative Services. In Proc. 20th SOSP, Brighton, UK, Oct. 2005. ACM Press.
2. G. Badishi, I. Keidar, and A. Sasson. Exposing and eliminating vulnerabilities to denial of service attacks in secure gossip-based multicast. In Proc. DSN-2004, page 223, Washington, DC, USA, 2004. IEEE Computer Society.
3. M. Bellare and P. Rogaway. Random oracles are practical: a paradigm for designing efficient protocols. In CCS’93: Proceedings of the 1st ACM conference on Computer and communications security, pages 62–73, New York, NY, USA, 1993. ACM Press.
4. K. P. Birman, M. Hayden, O. Oskasap, Z. Xiao, M. Budiu, and Y. Minsky. Bimodal multicast. ACM Trans. Comput. Syst., 17(2):41–88, May 1999.
5. K. P. Birman, R. van Renesse, and W. Vogels. Spinglass: Secure and scalable communications tools for mission-critical computing. In DARPA DISCEX-2001, 2001.
6. M. Castro, P. Druschel, A.-M. Kermarrec, A. Nandi, A. Rowstron, and A. Singh. SplitStream: high-bandwidth multicast in cooperative environments. In Proc. 19th SOSP, pages 298–313. ACM Press, 2003.
7. B. Cohen. Incentives build robustness in BitTorrent. In Proc. 2nd IPTPS, 2003.
8. A. Demers, D. Greene, C. Houser, W. Irish, J. Larson, S. Shenker, H. Sturgis, D. Swinehart, and D. Terry. Epidemic algorithms for replicated database maintenance. In Proc. 11th SOSP, Aug. 1987.
9. A. K. Dixit and S. Skeath. Games of Strategy. W. W. Norton & Company, 1999.
10. J. R. Douceur. The Sybil attack. In Proc. 1st IPTPS, pages 251–260. Springer-Verlag, 2002.
11. P. Eugster, S. Handurukande, R. Guerraoui, A. Kermarrec, and P. Kouznetsov. Lightweight probabilistic broadcast. In Proc. DSN-2001, pages 443–452, July 2001.
12. M. Feldman, C. Papadimitriou, J. Chuang, and I. Stoica. Free-riding and whitewashing in peer-to-peer systems. In Proc. PINS, pages 228–236. ACM Press, 2004.
13. A. J. Ganesh, A.-M. Kermarrec, and L. Massouli. Peer-to-peer membership management for gossip-based protocols. IEEE Trans. Comput., 52(2):139–149, 2003.
14. I. Gupta, K. Birman, and R. van Renesse. Fighting fire with fire: using randomized gossip to combat stochastic scalability limits. Journal of Quality and Reliability Engineering International, 18(3):165–184, 2002.
15. A. Habib and J. Chuang. Incentive mechanism for peer-to-peer media streaming. In 12th IEEE International Workshop on Quality of Service., 2004.
16. S. D. Kamvar, M. T. Schlosser, and H. Garcia-Molina. The Eigentrust algorithm for reputation management in P2P networks. In WWW03, pages 640–651, New York, NY, USA, 2003. ACM Press.
17. S. Kremer, O. Markowitch, and J. Zhou. An intensive survey of non-repudiation protocols. Computer Communications, 25(17):1606–1621, Nov. 2002.
18. D. Levin, R. Sherwood, and B. Bhattacharjee. Fair file swarming with FOX. In Proc. 5th IPTPS, Feb 2006.
19. M.-J. Lin and K. Marzullo. Directional gossip: Gossip in a wide area network. In European Dependable Computing Conference, pages 364–379, 1999.
20. D. Malkhi, Y. Mansour, and M. K. Reiter. Diffusion without false rumors: on propagating updates in a byzantine environment. Theor. Comput. Sci., 299(1-3):289–306, 2003.
21. D. Malkhi, E. Pavlov, and Y. Sella. Optimal unconditional information diffusion. In Proc. 15th DISC, pages 63–77, London, UK, 2001. Springer-Verlag.
22. D. Malkhi, M. Reiter, O. Rodeh, and Y. Sella. Efficient update diffusion in Byzantine environments. In Proc. 20th SRDS, 2001.
23. S. Marti and H. Garcia-Molina. Identity crisis: Anonymity vs. reputation in p2p systems. page 134. IEEE Computer Society, 2003.
24. M. Matsumoto and T. Nishimura. Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator. ACM Trans. Model. Comput. Simul., 8(1):3–30, 1998.
25. R. Melamed and I. Keidar. Araneola: A scalable reliable multicast system for dynamic environments. In Proc. 3rd NCA, pages 5–14, Washington, DC, USA, 2004. IEEE Computer Society.
26. Y. Minsky and F. Schneider. Private communication.
27. A. Nandi, T.-W. J. Ngan, A. Singh, P. Druschel, and D. S. Wallach. Scrivener: Providing incentives in cooperative content distribution systems. In Proc. 6th Middleware, Grenoble, France, Nov. 2005.
28. J. Nash. Non-cooperative games. The Annals of Mathematics, 54:286–295, Sept 1951.
29. National Institute of Standards and Technology. FIPS PUB 186-2: Digital Signature Standard (DSS). Jan. 2000.
30. T.-W. Ngan, D. S. Wallach, and P. Druschel. Incentives-compatible peer-to-peer multicast. In 2nd Workshop on Economics of Peer-to-Peer Systems, 2004.
31. D. C. Oppen and Y. K. Dalal. The clearinghouse: a decentralized agent for locating named objects in a distributed environment. ACM Trans. Inf. Syst., 1(3):230–253, 1983.
32. H. Pagnia and F. C. Gärtner. On the impossibility of fair exchange without a trusted third party. Technical Report TUD-BS-1999-02, Darmstadt University of Technology, Department of Computer Science, Darmstadt, Germany, Mar. 1999.
33. D. C. Parkes. Iterative Combinatorial Auctions: Achieving Economic and Computational Efficiency. PhD thesis, Department of Computer and Information Science, University of Pennsylvania, May 2001.
34. A. Puri and A. Eleftheriadis. MPEG-4: an object-based multimedia coding standard supporting mobile applications. Mob. Netw. Appl., 3(1):5–32, 1998.
35. R. V. Renesse, Y. Minsky, and M. Hayden. A gossip-style failure detection service. Technical report, Ithaca, NY, USA, 1998.
36. P. Resnick, K. Kuwabara, R. Zeckhauser, and E. Friedman. Reputation systems. Commun. ACM, 43(12):45–48, 2000.
37. A. Rowstron and P. Druschel. Storage management and caching in past, a large-scale, persistent peer-to-peer storage utility. In Proc. 18th SOSP, pages 188–201. ACM Press, 2001.
38. R. van Renesse, K. P. Birman, D. Dumitriu, and W. Vogels. Scalable management and data mining using Astrolabe. In Proc. 1st IPTPS, pages 280–294, London, UK, 2002. Springer-Verlag.
39. R. van Renesse, H. Johansen, and A. Allavena. Fireflies: Scalable support for intrusion-tolerant overlay networks. In EuroSys’06, 2006.
40. W. Vogels, R. van Renesse, and K. Birman. The power of epidemics: robust communication for large-scale distributed systems. SIGCOMM Comput. Commun. Rev., 33(1):131–135, 2003.
41. H. Yu, M. Kaminsky, P. B. Gibbons, and A. Flaxman. Sybil-guard: Defending against sybil attacks via social networks. In ACM SIGCOMM’06, Sept.
42. X. Zhang, J. Liu, B. Li, and T. P. Yum. DONet/CoolStreaming: A data-driven overlay network for live media streaming. In IEEE INFOCOM, Mar. 2005.