Abstract
The problem of reliably transferring data from a set of \(N_{\cal P} \) producers to a set of \(N_{\cal C} \) consumers in the BAR model, named N-party BAR Transfer (NBART ), is an important building block for volunteer computing systems. An algorithm to solve this problem in synchronous systems, which provides a Nash equilibrium, has been presented in previous work. In this paper, we propose an NBART algorithm for asynchronous systems. Furthermore, we also address the possibility of collusion among the Rational processes. Our game theoretic analysis shows that the proposed algorithm tolerates certain degree of arbitrary collusion, while still fulfilling the NBART properties.
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
Anderson, D.: Boinc: A system for public-resource computing and storage. In: Proceedings of the 5th IEEE/ACM International Workshop on Grid Computing, GRID 2004, Pittsburgh, PA, USA, pp. 4–10. IEEE (November 2004)
Aiyer, S., Alvisi, L., Clement, A., Dahlin, M., Martin, J.P., Porth, C.: BAR fault tolerance for cooperative services. In: Proceedings of the 20th ACM Symposium on Operating Systems Principles, SOSP 2005, Brighton, United Kingdom, pp. 45–58. ACM (October 2005)
Vilaça, X., Leitão, J., Correia, M., Rodrigues, L.: N-party BAR Transfer. In: Fernàndez Anta, A., Lipari, G., Roy, M. (eds.) OPODIS 2011. LNCS, vol. 7109, pp. 392–408. Springer, Heidelberg (2011)
Eliaz, K.: Fault-tolerant implementation. Review of Economic Studies 69(3), 589–610 (2002)
Moscibroda, T., Schmid, S., Wattenhofer, R.: On the topologies formed by selfish peers. In: Proceedings of the 25th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2006, Denver, CO, USA, pp. 133–142. ACM (July 2006)
Aumann, R.J.: Acceptable points in General Cooperative $n$-person Games. In: Contributions to the Theory of Games IV. Annals of Mathematics Studies, vol. (40), pp. 287–324. Princeton University Press, Princeton (1959)
Bernheim, B., Peleg, B., Whinston, M.: Coalition-proof nash equilibria i. concepts. Journal of Economic Theory 42(1), 1–12 (1987)
Moreno, D., Wooders, J.: Coalition-proof equilibrium. Games and Economic Behavior 17(1), 80–112 (1996)
Abraham, I., Dolev, D., Gonen, R., Halpern, J.: Distributed computing meets game theory: robust mechanisms for rational secret sharing and multiparty computation. In: Proceedings of the 25th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2006, Denver, CO, USA, pp. 53–62. ACM (July 2006)
Clement, A., Napper, J., Li, H., Martin, J.P., Alvisi, L., Dahlin, M.: Theory of BAR games. In: Proceedings of the 26th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2007, Portland, OR, USA, pp. 358–359. ACM (August 2007)
Li, H., Clement, A., Wong, E., Napper, J., Roy, I., Alvisi, L., Dahlin, M.: BAR gossip. In: Proceedings of the 7th USENIX Symposium on Operating Systems Design and Implementation, OSDI 2006, Seattle, WA, USA, pp. 191–204. USENIX Association (November 2006)
Li, H., Clement, A., Marchetti, M., Kapritsos, M., Robison, L., Alvisi, L., Dahlin, M.: Flightpath: Obedience vs choice in cooperative services. In: Proceedings of the 8th USENIX Symposium on Operating Systems Design and Implementation, OSDI 2008, San Diego, CA, USA, pp. 355–368. USENIX Association (December 2008)
Mokhtar, S., Pace, A., Quéma, V.: FireSpam: Spam resilient gossiping in the BAR model. In: Proceedings of the 29th IEEE International Symposium on Reliable Distributed Systems, SRDS 2010, New Delhi, India, pp. 225–234. IEEE (October 2010)
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)
Cachin, C., Guerraoui, R., Rodrigues, L.: Introduction to Reliable and Secure Distributed Programming, 2nd edn. Springer-Verlag New York, Inc. (2011)
Vilaça, X., Denysyuk, O., Rodrigues, L.: Asynchrony and collusion in the N-party BAR transfer problem. Arxiv preprint arXiv:1204.4044v1 (2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Vilaça, X., Denysyuk, O., Rodrigues, L. (2012). Asynchrony and Collusion in the N-party BAR Transfer Problem. In: Even, G., Halldórsson, M.M. (eds) Structural Information and Communication Complexity. SIROCCO 2012. Lecture Notes in Computer Science, vol 7355. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31104-8_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-31104-8_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31103-1
Online ISBN: 978-3-642-31104-8
eBook Packages: Computer ScienceComputer Science (R0)