BAR primer

Proceedings of the International Conference on Dependable Systems and Networks

Volumn , Issue , 2008, Pages 287-296

  Clement, Allen ^a   Li, Harry ^a   Napper, Jeff ^a   Martin, Jean Philippe ^b   Alvisi, Lorenzo ^a   Dahlin, Mike ^a  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

^b MICROSOFT RESEARCH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BYZANTINE FAULTS; DEPENDABLE SYSTEMS; DEVELOPMENT CYCLES; INTERNATIONAL CONFERENCES; PROBLEM STATEMENTS; RELIABLE BROADCAST;

ACOUSTIC SURFACE WAVE FILTERS; FAULT TOLERANT COMPUTER SYSTEMS; NETWORK PROTOCOLS; SENSOR NETWORKS;

COMPUTER NETWORKS;

EID: 53349172205     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DSN.2008.4630097     Document Type: Conference Paper

References (17)

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, July 2006.
2. E. Adar and B. A. Huberman. Free riding on Gnutella. First Monday, 5(10):2-13, Oct. 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, Oct. 2005.
4. A. Clement, J. Napper, H. Li, J. Martin, L. Alvisi, and M. Dahlin. Theory of bar games. Technical report, University of Texas Department of Computer Sciences Technical Report R-06-63, December 2005.
5. B. Cohen. Incentives build robustness in BitTorrent. In First Workshop on the Economics of Peer-to-Peer Systems, June 2003.
6. D. Dolev and H. R. Strong. Authenticated algorithms for Byzantine agreement. Siam Journal Computing, 12(4):656-666, Nov. 1983.
7. K. Eliaz. Fault tolerant implementation. Review of Economic Studies, 69:589-610, Aug 2002.
8. J. Feigenbaum, R. Sami, and S. Shenker. Mechanism design for policy routing. In Proc. 23rd PODC, pages 11-20. ACM Press, 2004.
9. G. Hardin. The tragedy of the commons. Science, 162:1243-1248, 1968.
10. L. Lamport. Time, clocks, and the ordering of events in a distributed system. Communications of the ACM, 1978.
11. L. Lamport, R. Shostak, and M. Pease. The Byzantine generals problem. ACMTrans. Program. Lang. Syst., 1982.
12. H. C. Li, A. Clement, E. Wong, J. Napper, I. Roy, L. Alvisi, and M. Dahlin. Bar Gossip. In Proc. 7th OSDI, 2006.
13. R. Mahajan, M. Rodrig, D. Wetherall, and J. Zahorjan. Sustaining cooperation in multi-hop wireless networks. In NSDI, May 2005.
14. J.-P. Martin. Byzantine Fault-Tolerance and Beyond. PhD thesis, The University of Texas at Austin, Dec. 2006. TR-06-66.
15. T. Moscibroda, S. Schmid, and R. Wattenhofer. When selfish meets evil: Byzantine players in a virus inoculation game. In Proc. 25th PODC, 2006.
16. J.Nash. Non-cooperative games. The Annals of Mathematics, 54:286-295, Sept 1951.
17. J. Shneidman and D. C. Parkes. Specification faithfulness in networks with rational nodes. In Proc. 23rd PODC, pages 88-97. ACM Press, 2004.