FlightPath: Obedience vs. Choice in cooperative services

Proceedings of the 8th USENIX Symposium on Operating Systems Design and Implementation, OSDI 2008

Volumn , Issue , 2019, Pages 355-368

  Li, Harry C ^a   Clement, Allen ^a   Marchetti, Mirco ^b   Kapritsos, Manos ^a   Robison, Luke ^a   Alvisi, Lorenzo ^a   Dahlin, Mike ^a  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

^b UNIVERSITY OF MODENA AND REGGIO EMILIA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

JITTER; SYSTEMS ANALYSIS;

COOPERATIVE SERVICES; LIVE STREAMING; MALICIOUS ACTIVITIES; NASH EQUILIBRIA; ORDERS OF MAGNITUDE; PEER-TO-PEER STREAMING; PRACTICAL SYSTEMS; RUNTIME ADAPTATION;

PEER TO PEER NETWORKS;

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

References (43)

1. I. Abraham, D. Dolev, R. Gonen, and J. Halpern. Distributed computing meets game theory: robust mechanisms for rational secret sharing and multiparty computation. In Proc. 25th PODC, pages 53-62, July 2006.
2. R. Ahlswede, N. Cai, S.-Y. Li, and R. Yeung. Network information flow. Information Theory, IEEE Transactions on, 46(4):1204-1216, Jul 2000.
3. 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, pages 45-58, Oct. 2005.
4. N. Alon, J. Edmonds, and M. Luby. Linear time erasure codes with nearly optimal recovery. In FOCS'95, page 512, Washington, DC, USA, 1995. IEEE Computer Society.
5. 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.
6. M. Bellare and P. Rogaway. Random oracles are practical: a paradigm for designing efficient protocols. In Proc. 1st CCC, pages 62-73, New York, NY, USA, 1993. ACM Press.
7. K. P. Birman, M. Hayden, O. Oskasap, Z. Xiao, M. Budiu, and Y. Minsky. Bimodal multicast. ACM TOCS, 17(2):41-88, May 1999.
8. K. P. Birman, R. van Renesse, and W. Vogels. Spinglass: Secure and scalable communications tools for mission-critical computing. In DARPA DISCEX-2001, 2001.
9. T. C. Bressoud and F. B. Schneider. Hypervisor-based fault tolerance. ACM TOCS, 14(1):80-107, 1996.
10. 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.
11. S. Chien and A. Sinclair. Convergence to approximate nash equilibria in congestion games. In SODA'07, pages 169-178, Philadelphia, PA, USA, 2007. Society for Industrial and Applied Mathematics.
12. P. A. Chou, Y. Wu, and K. Jain. Practical network coding. In ACCCC03, October 2003.
13. B. Cohen. Incentives build robustness in BitTorrent. In P2PECON'03, June 2003.
14. C. Daskalakis, A. Mehta, and C. Papadimitriou. A note on approximate nash equilibria. In WINE'06, 2006.
15. 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.
16. J. R. Douceur. The Sybil attack. In Proc. 1st IPTPS, pages 251-260. Springer-Verlag, 2002.
17. P. Eugster, S. Handurukande, R. Guerraoui, A. Kermarrec, and P. Kouznetsov. Lightweight probabilistic broadcast. In DSN'01, pages 254-269, July 2001.
18. C. Gkantsidis and P. Rodriguez. Network coding for large scale content distribution. INFOCOM, 4:2235-2245 vol. 4, March 2005.
19. K. P. Gummadi, S. Saroiu, and S. D. Gribble. King: estimating latency between arbitrary internet end hosts. SIGCOMM Com-put. Commun. Rev., 32(3):11-11, 2002.
20. 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.
21. I. Gupta, A.-M. Kermarrec, and A. J. Ganesh. Efficient and adaptive epidemic-style protocols for reliable and scalable multicast. IEEE TPDS, 17(7):593-605, 2006.
22. M. Haridasan and R. van Renesse. Defense against intrusion in a live streaming multicast system. In Proceedings of P2P'06, pages 185-192, Washington, DC, USA, 2006. IEEE Computer Society.
23. J. Jannotti, D. K. Gifford, K. L. Johnson, M. F. Kaashoek, and J. James W. O'Toole. Overcast: reliable multicasting with an overlay network. In Proceedings of OSDI'00, pages 14-14, Berkeley, CA, USA, 2000. USENIX Association.
24. Kazaa. http://www.kazaa.com.
25. Kazaa Lite. http://en.wikipedia.org/wiki/Kazaa Lite.
26. I. Keidar, R. Melamed, and A. Orda. Equicast: Scalable multicast with selfish users. In PODC'06, 2006.
27. D. Kostić, A. Rodriguez, J. Albrecht, and A. Vahdat. Bullet: high bandwidth data dissemination using an overlay mesh. In SOSP'03, pages 282-297, New York, NY, USA, 2003. ACM.
28. J. Leitao, J. Pereira, and L. Rodrigues. Hyparview: A membership protocol for reliable gossip-based broadcast. In DSN'07, pages 419-429, Washington, DC, USA, 2007. IEEE Computer Society.
29. H. C. Li, A. Clement, E. Wong, J. Napper, I. Roy, L. Alvisi, and M. Dahlin. BAR Gossip. In Proceedings of OSDI'06, pages 191-204, Nov. 2006.
30. M. G. Luby, M. Mitzenmacher, M. A. Shokrollahi, D. A. Spiel-man, and V. Stemann. Practical loss-resilient codes. In STOC '97, pages 150-159. ACM Press, 1997.
31. D. Malkhi, Y. Mansour, and M. K. Reiter. Diffusion without false rumors: on propagating updates in a byzantine environment. TCS, 299(1-3):289-306, 2003.
32. D. Malkhi, M. Reiter, O. Rodeh, and Y. Sella. Efficient update diffusion in Byzantine environments. In Proc. 20th SRDS, 2001.
33. R. Melamed and I. Keidar. Araneola: A scalable reliable multicast system for dynamic environments. In Proc. of NCA'04, pages 5-14, Washington, DC, USA, 2004. IEEE Computer Society.
34. T. Moscibroda, S. Schmid, and R. Wattenhofer. When selfish meets evil: Byzantine players in a virus inoculation game. In Proc. 25th PODC, pages 35-44, July 2006.
35. J. Nash. Non-cooperative games. The Annals of Mathematics, 54:286-295, Sept 1951.
36. T.-W. Ngan, D. S. Wallach, and P. Druschel. Incentives-compatible peer-to-peer multicast. In P2PECON'04, 2004.
37. V. Pai, K. Kumar, K. Tamilmani, V. Sambamurthy, and A. Mohr. Chainsaw: Eliminating trees from overlay multicast. In IPTPS '05, February 2005.
38. M. Sirivianos, J. H. Park, R. Chen, and X. Yang. Free-riding in bittorrent networks with the large view exploit. In IPTPS'07, February 2007.
39. R. van Renesse, K. P. Birman, and S. Maffeis. Horus: A flexible group communication system. Comm. ACM, 39(4):76-83, 1996.
40. R. van Renesse, H. Johansen, and A. Allavena. Fireflies: Scalable support for intrusion-tolerant overlay networks. In EuroSys '06, 2006.
41. J. Venkataraman, P. Francis, and J. Calandrino. Chunkyspread: Multi-tree unstructured peer-to-peer multicast. In IPTPS'06, February 2006.
42. H. Yu, M. Kaminsky, P. B. Gibbons, and A. Flaxman. Sybil-guard: Defending against sybil attacks via social networks. In ACM SIGCOMM'06, Sept.
43. X. Zhang, J. Liu, B. Li, and T. P. Yum. CoolStreaming/DONet: A data-driven overlay network for live media streaming. In IEEE INFOCOM, Mar. 2005.