N-party BAR Transfer: motivation, definition, and challenges

ABSTRACT

This paper introduces the N-party BAR Transfer service. The service aims at transferring data from a group of replicated producers to a group of replicated consumers, in a setting where the behaviour of the processes is characterized by the Byzantine Altruistic Rational (BAR) model. The problem is motivated, a precise definition of problem is presented, and the challenges on solving the problem are discussed.

References

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 PODC'06, pages 53--62, Denver, Colorado, USA, July 2006.
2. S. Aiyer, L. Alvisi, A. Clement, M. Dahlin, J.-P. Martin, and C. Porth. BAR fault tolerance for cooperative services. In SOSP'05, pages 45--58, Brighton, United Kingdom, Oct. 2005.
3. D. Anderson. Boinc: A system for public-resource computing and storage. In GRID'04, pages 4--10, Pittsburgh, USA, Nov. 2004.
4. D. Anderson, J. Cobb, E. Korpela, M. Lebofsky, and D. Werthimer. [email protected]: an experiment in public-resource computing. C. ACM, 45(11):56--61, November 2002.
5. G. Bracha and S. Toueg. Asynchronous consensus and broadcast protocols. J. ACM, 32:824--840, October 1985.
6. R. Canetti and T. Rabin. Fast asynchronous Byzantine agreement with optimal resilience. In STOC'93, pages 42--51, New York, NY, USA, 1993.
7. M. Castro and B. Liskov. Practical Byzantine fault tolerance and proactive recovery. ACM Transactions on Computer Systems, 20(4):398--461, 2002.
8. A. Clement, M. Kapritsos, S. Lee, Y. Wang, L. Alvisi, M. Dahlin, and T. Riche. Upright cluster services. In SOSP'09, pages 277--290, Big Sky, Montana, USA, Oct. 2009.
9. A. Clement, H. Li, J. Napper, J.-P. Martin, L. Alvisi, and M. Dahlin. BAR primer. In DSN'08, pages 287--296, Anchorage, Alaska, USA, June 2008.
10. A. Clement, J. Napper, H. Li, J.-P. Martin, L. Alvisi, and M. Dahlin. Theory of BAR games. In PODC'07, pages 358--359, Portland, USA, Aug. 2007.
11. B. Cohen. Incentives build robustness in bittorrent. In NetEcon'03, Berkeley (CA), USA, June 2003.
12. L. Cox and B. D. Noble. Samsara: Honor among thieves in peer-to-peer storage. In SOSP'03, pages 120--132, Bolton Landing, NY, USA, Oct. 2003.
13. J. Dean and S. Ghemawat. MapReduce: simplified data processing on large clusters. In OSDI'04, San Francisco, USA, 2004.
14. T. Distler and R. Kapitza. Increasing performance in Byzantine fault-tolerant systems with on-demand replica consistency. In EuroSys'11, pages 91--106, Salzburg, Austria, Apr. 2011.
15. D. Dolev and H. Strong. Authenticated algorithms for Byzantine agreement. SIAM J. Comput., 12(4):656--666, 1983.
16. K. Eliaz. Fault tolerant implementation. Review of Economic Studies, 69(3):589--610, 2002.
17. I. Keidar, R. Melamed, and A. Orda. Equicast: Scalable multicast with selfish users. In PODCâĂŹ06, pages 63--71, July 2006.
18. L. Lamport. The part-time parliament. ACM Trans. on Computer Systems, 16(2):133--169, May 1998.
19. L. Lamport, R. Shostak, and M. Pease. The Byzantine generals problem. ACM Trans. Program. Lang. Syst., 4:382--401, July 1982.
20. M. Landers, H. Zhang, and K.-L. Tan. PeerStore: better performance by relaxing in peer-to-peer backup. Zurich, Switzerland, Aug. 2004.
21. S. Lee and K. Shin. Interleaved all-to-all reliable broadcast on meshes and hypercubes. Parallel and Distributed Systems, IEEE Transactions on, 5(5):449--458, may 1994.
22. H. Li, A. Clement, M. Marchetti, M. Kapritsos, L. Robison, L. Alvisi, and M. Dahlin. Flightpath: Obedience vs choice in cooperative services. In OSDI'08, San Diego, CA, USA, Dec. 2008.
23. H. Li, A. Clement, E. Wong, J. Napper, I. Roy, L. Alvisi, and M. Dahlin. BAR gossip. In OSDI'06, pages 191--204, Seattle, WA, USA, Nov. 2006.
24. D. Malkhi and M. Reiter. Byzantine quorum systems. In STOC'97, pages 569--578, El Paso, USA, 1997.
25. J.-P. Martin, L. Alvisi, and M. Dahlin. Minimal Byzantine storage. In DISC'02, pages 311--325, Toulouse, France, Oct. 2002.
26. O. Martin and R. Ariel. A Course in Game Theory. MIT Press, 1994.
27. S. Mokhtar, A. Pace, and V. Quéandma. FireSpam: Spam resilient gossiping in the BAR model. In SRDS'10, pages 225--234, New Delhi, India, Oct. 2010.
28. T. Moscibroda, S. Schmid, and R. Wattenhofer. On the topologies formed by selfish peers. In PODC '06, pages 133--142, Denver, USA, July 2006. ACM.
29. J. Shneidman, D. Parkes, and L. Massoulie. Faithfulness in internet algorithms. In PINS'2004, Portland, OR, USA, September 2004.
30. E. L. Wong, J. B. Leners, and L. Alvisi. It's on me! the benefit of altruism in BAR environment. In DISC'10, pages 406--420, Cambridge, MA, USA, Sept. 2010.
31. J. Yin, J.-P. Martin, A. Venkataramani, L. Alvisi, and M. Dahlin. Separating agreement from execution for Byzantine fault tolerant services. In SOSP'03, pages 253--267, Bolton Landing, NY, USA, Oct. 2003.

Index Terms

• Computer systems organization

  • Architectures

    • Distributed architectures

• Software and its engineering

  • Software organization and properties

    • Software system structures

      • Distributed systems organizing principles