Abstract
We introduce the N-party BAR transfer problem that consists in reliably transferring arbitrarily large data from a set of N producers to a set of N consumers in the BAR model, i.e., in the presence of Byzantine, Altruistic, and Rational participants. The problem considers the existence of a trusted observer that gathers evidence to testify that the producers and consumers have participated in the transfer. We present an algorithm that solves the problem for N ≥ 2f + 1, where f is the maximum number of Byzantine processes in each of the producer and consumer sets. We do not impose limits on the number of Rational participants, although they can deviate from the algorithm to improve their utility. We show that our algorithm provides a Nash equilibrium.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abraham, I., Dolev, D., Gonen, R., Halpern, J.: Distributed computing meets game theory: robust mechanisms for rational secret sharing and multiparty computation. In: PODC 2006, Denver, USA, pp. 53–62 (July 2006)
Aiyer, S., Alvisi, L., Clement, A., Dahlin, M., Martin, J.-P., Porth, C.: BAR fault tolerance for cooperative services. In: SOSP 2005, Brighton, United Kingdom, pp. 45–58 (October 2005)
Anderson, D.: Boinc: A system for public-resource computing and storage. In: GRID 2004, Pittsburgh, USA, pp. 4–10 (November 2004)
Anderson, D., Cobb, J., Korpela, E., Lebofsky, M., Werthimer, D.: SETI@home: an experiment in public-resource computing. Communications of the ACM 45(11), 56–61 (2002)
Axelrod, R.: The Evolution of Cooperation. Basic Books, New York (1984)
Baldoni, R., Helary, J.-M., Raynal, M., Tanguy, L.: Consensus in Byzantine asynchronous systems. J. Discrete Algorithms 1(2), 185–210 (2003)
Canetti, R., Rabin, T.: Fast asynchronous Byzantine agreement with optimal resilience. In: STOC 1993, New York, USA, pp. 42–51 (1993)
Castro, M., Liskov, B.: Practical Byzantine fault tolerance and proactive recovery. ACM Transactions on Computer Systems 20(4), 398–461 (2002)
Clement, A., Napper, J., Li, H., Martin, J.-P., Alvisi, L., Dahlin, M.: Theory of bar games. In: PODC 2007, Portland, USA, pp. 358–359 (August 2007)
Correia, M., Neves, N.F., Lung, L.C., Verissimo, P.: Low complexity Byzantine-resilient consensus. Distributed Computing 17(3), 237–249 (2005)
Dolev, D., Strong, H.: Authenticated algorithms for Byzantine agreement. SIAM J. Comput. 12(4), 656–666 (1983)
Dwork, C., Lynch, N., Stockmeyer, L.: Consensus in the presence of partial synchrony. J. of ACM 35, 288–323 (1988)
Eliaz, K.: Fault tolerant implementation. Review of Economic Studies 69(3), 589–610 (2002)
Fraigniaud, P.: Asymptotically optimal broadcasting and gossiping in faulty hypercube multicomputers. IEEE Transactions on Computers 41(11), 1410–1419 (1992)
Hardin, G.: The tragedy of the commons. Science 162(3859), 1243–1247 (1968)
Keidar, I., Melamed, R., Orda, A.: Equicast: Scalable multicast with selfish users. In: PODC 2006, pp. 63–71 (July 2006)
Kotla, R., Alvisi, L., Dahlin, M., Clement, A., Wong, E.: Zyzzyva: speculative Byzantine fault tolerance. In: SOSP 2007, Stevenson, USA, pp. 45–58 (October 2007)
Lamport, L.: The part-time parliament. ACM Trans. on Computer Systems 16(2), 133–169 (1998)
Lamport, L., Shostak, R., Pease, M.: The Byzantine generals problem. ACM Trans. Program. Lang. Syst. 4, 382–401 (1982)
Lee, S., Shin, K.G.: Interleaved all-to-all reliable broadcast on meshes and hypercubes. IEEE Transactions on Parallel and Distributed Systems 5(5), 449–458 (1994)
Li, H., Clement, A., Marchetti, M., Kapritsos, M., Robison, L., Alvisi, L., Dahlin, M.: Flightpath: Obedience vs choice in cooperative services. In: OSDI 2008, San Diego, USA (December 2008)
Li, H., Clement, A., Wong, E., Napper, J., Roy, I., Alvisi, L., Dahlin, M.: BAR gossip. In: OSDI 2006, Seattle, USA, pp. 191–204 (November 2006)
Malkhi, D., Reiter, M.: Byzantine quorum systems. In: STOC 1997, El Paso, USA, pp. 569–578 (1997)
Martin, J.P., Alvisi, L., Dahlin, M.: Minimal Byzantine storage. In: Malkhi, D. (ed.) DISC 2002. LNCS, vol. 2508, pp. 311–325. Springer, Heidelberg (2002)
Martin, O., Ariel, R.: A Course in Game Theory. MIT Press (1994)
Wong, E.L., Leners, J.B., Alvisi, L.: It’s on Me! The Benefit of Altruism in BAR Environments. In: Lynch, N.A., Shvartsman, A.A. (eds.) DISC 2010. LNCS, vol. 6343, pp. 406–420. Springer, Heidelberg (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Vilaça, X., Leitão, J., Correia, M., Rodrigues, L. (2011). N-party BAR Transfer. In: Fernàndez Anta, A., Lipari, G., Roy, M. (eds) Principles of Distributed Systems. OPODIS 2011. Lecture Notes in Computer Science, vol 7109. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25873-2_27
Download citation
DOI: https://doi.org/10.1007/978-3-642-25873-2_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25872-5
Online ISBN: 978-3-642-25873-2
eBook Packages: Computer ScienceComputer Science (R0)