On the cost-ineffectiveness of redundancy in commercial P2P computing

Authors:
Matthew Yurkewych;Brian N. Levine;Arnold L. Rosenberg
Affiliations:
University of Massachusetts, Amherst, MA;University of Massachusetts, Amherst, MA;University of Massachusetts, Amherst, MA
Venue:
Proceedings of the 12th ACM conference on Computer and communications security
Year:
2005

Citing 11
Cited 6

Performance analysis of the CONFIDANT protocol

Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Distributed algorithmic mechanism design: recent results and future directions

DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
SETI@home: an experiment in public-resource computing

Communications of the ACM
Uncheatable Distributed Computations

CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
The Sybil Attack

IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Secure Distributed Computing in a Commercial Environment

FC '01 Proceedings of the 5th International Conference on Financial Cryptography
Using redundancy to improve robustness of distributed mechanism implementations

Proceedings of the 4th ACM conference on Electronic commerce
BOINC: A System for Public-Resource Computing and Storage

GRID '04 Proceedings of the 5th IEEE/ACM International Workshop on Grid Computing
Pastiche: making backup cheap and easy

OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
Tor: the second-generation onion router

SSYM'04 Proceedings of the 13th conference on USENIX Security Symposium - Volume 13
On the hardness of permanent

STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science

Quantifying Resistance to the Sybil Attack

Financial Cryptography and Data Security
Collusion Detection for Grid Computing

CCGRID '09 Proceedings of the 2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid
An authentication protocol in web-computing

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Ensuring content integrity for untrusted peer-to-peer content distribution networks

NSDI'07 Proceedings of the 4th USENIX conference on Networked systems design & implementation
GAUR: a method to detect Sybil groups in peer-to-peer overlays

International Journal of Grid and Utility Computing
Achieving reliability in master-worker computing via evolutionary dynamics

Euro-Par'12 Proceedings of the 18th international conference on Parallel Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a game-theoretic model of the interactions between server and clients in a constrained family of commercial P2P computations (where clients are financially compensated for work). We study the cost of implementing redundant task allocation (redundancy, for short) as a means of preventing cheating. Under the assumption that clients are motivated solely by the desire to maximize expected profit, we prove that, within this framework, redundancy is cost effective only when collusion among clients, including the Sybil attack, can be prevented. We show that in situations where this condition cannot be met, non-redundant task allocation is much less costly than redundancy.