BOINC: A System for Public-Resource Computing and Storage
GRID '04 Proceedings of the 5th IEEE/ACM International Workshop on Grid Computing
BAR fault tolerance for cooperative services
Proceedings of the twentieth ACM symposium on Operating systems principles
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
On the topologies formed by selfish peers
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
OSDI '06 Proceedings of the 7th symposium on Operating systems design and implementation
FlightPath: obedience vs. choice in cooperative services
OSDI'08 Proceedings of the 8th USENIX conference on Operating systems design and implementation
It's on me! the benefit of altruism in BAR environment
DISC'10 Proceedings of the 24th international conference on Distributed computing
FireSpam: Spam Resilient Gossiping in the BAR Model
SRDS '10 Proceedings of the 2010 29th IEEE Symposium on Reliable Distributed Systems
Introduction to Reliable and Secure Distributed Programming
Introduction to Reliable and Secure Distributed Programming
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
| Hi-index | 0.00 |
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.