Asynchrony and Collusion in the N-party BAR Transfer Problem

Details Asynchrony and Collusion in the N-party BAR Transfer Problem Asynchrony and Collusion in the N-party BAR Transfer Problem

2012-04-18

arxiv.org/abs/1204.4044v1

Computer Science

Distributed, Parallel, and Cluster Computing

13 pages, 3 algorithms, to appear in Proceedings of the 19th International Colloquium on Structural Information and Communicat

Scientific paper

The problem of reliably transferring data from a set of $N_P$ producers to a set of $N_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.

Affiliated with

Also associated with

No associations

Rating

Asynchrony and Collusion in the N-party BAR Transfer Problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Asynchrony and Collusion in the N-party BAR Transfer Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Asynchrony and Collusion in the N-party BAR Transfer Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-411526