On the cost-ineffectiveness of redundancy in commercial P2P computing

Proceedings of the ACM Conference on Computer and Communications Security

Volumn , Issue , 2005, Pages 280-288

  Yurkewych, Matthew ^a   Levine, Brian N ^a   Rosenberg, Arnold L ^a  

^a Biologically Inspired Neural and Dynamical Systems Laboratory   (United States)

Author keywords

Collusion; Game theory; P2P computing; Redundancy

Indexed keywords

COMPUTATION THEORY; COST EFFECTIVENESS; DISTRIBUTED COMPUTER SYSTEMS; GAME THEORY; INTERACTIVE COMPUTER SYSTEMS; RESOURCE ALLOCATION;

COLLUSION; P2P COMPUTING; TASK ALLOCATION;

REDUNDANCY;

EID: 33745800476     PISSN: 15437221     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1102120.1102157     Document Type: Conference Paper

References (31)

1. D. Anderson. BOINC: A System for Public-Resource Computing and Storage. 5th IEEE/ACM Intl. Wkshp. on Grid Computing, 2004.
2. D. Anderson, J. Cobb, E. Korpela, Matt Lebofsky, D. Werthimer. SETI@home: An Experiment in Public-Resource Computing. Comm. ACM 45, 2002.
3. Berkeley Open Infrastructure for Network Computing (BOINC). http://boinc.berkeley.edu
4. D. Bernstein. Protecting Communications Against Forgery. Algorithmic Number Theory, J. Buhler and P. Stevenhagan (Ed.), to appear 2005.
5. S. Buchegger, J. Le Boudec. Performance Analysis of the CONFIDANT Protocol: Cooperation of Nodes -Fairness in Distributed Ad-hoc Networks. IEEE/ACM Wkshp. on Mobile Ad Hock Networking and Computing (MobiHOC), 2002.
6. J-Y. Cai, A. Nerukar, D. Sivakumar, On the Hardness of Permanent. Proc. 16th Ann. Symp. on Theoretical Aspects of Computer Science, 1999.
7. L. P. Cox, C. D. Murray, B. D. Noble. Pastiche: Making Backup Cheap and Easy. 5th ACM/USENIX Symp. on Operating Systems Design and Implementation, 2002.
8. R. Dingledine, N. Mathewson, P. Syverson. Tor: The Second-Generation Onion Router. 13th USENIX Security Symp., 2004.
9. J. Douceur. The Sybil Attack. 1st Intl. Wkshp. on Peer-to-Peer Systems, 2002.
10. Distributed.net. http://www.distributed.net
11. EBay, http://www.ebay.com
12. J. Feigenbaum and S. Shenker. Distributed Algorithmic Mechanism Design: Recent Results and Future Directions. 6th Intl. Wkshp. on Discrete Algorithms and Methods for Mobile Computing and Communications, 2002.
13. FightAIDS@home. http://www.fightaidsathome.com
14. Folding@home. http://folding.stanford.edu
15. I. Foster and A. Iamnitchi. On Death, Taxes, and the Convergence of Peer-to-Peer and Grid Computing. 2nd Intl. Wkshp. on Peer-to-Peer Systems, 2003.
16. P. Golle and I. Mironov. Uncheatable Distributed Computations. Topics in Cryptology, CT-RSA, 2001.
17. P. Golle and S. Stubblebine. Secure Distributed Computing in a Commercial Environment. Proceedings of Financial Cryptography, 2001.
18. The Google Compute Project, http://www.toolbar.google.com/dc/offerdc.html
19. J. Gray. Distributed Computing Economics. Microsoft Research TR-2003-24, March 2003.
20. R. Hogg and E. Tanis. Probability and Statistical Inference, 4th Ed. Macmillan Publishing, 1993.
21. U. Maurer. Information-Theoretic Cryptography. Advances in Cryptology - CRYPTO '99, Lecture Notes in Computer Science, Springer-Verlag, vol. 1666, 47-64, 1999.
22. J. Ledlie, J. Shneidman, M. Seltzer, J. Huth. Scooped, Again. 2nd Intl. Wkshp, on Peer-to-Peer Systems, 2003.
23. D. Mookherjee, I. Png. Optimal Auditing, Insurance, and Redistribution.Quarterly J. Economics 104, 399-415, 1989.
24. J.F. Nash. Equilibrium Points in N-Person Games. Proc. National Academy of Sciences of the United States of America (36), 1950.
25. J.F. Nash. Non-Cooperative Games. Annals of Mathematics (54), 1951.
26. M. Osborne, A. Rubenstein. A Course in Game Theory. MIT Press, 1994.
27. E. Rasmusen. An Introduction to Game Theory, 3rd Ed. Blackwell Publishing, 2003.
28. RSA Secret Key Challenge. http://wvw.rsasecurity.com/rsalabs/node.asp?id=2100
29. K. Sanzgiri, B. Dahill, D. LaFlamme, B. N. Levine, C. Shields, E. Belding-Royer. A Secure Routing Protocol for Ad hoc Newtorks. IEEE/ACM Journal of Selected Areas in Communications: Special issue on Wireless Ad hoc Networks (JSAC), 2005.
30. J. Shneidman and D. Parkes. Rationality and Self-Interest in Peer to Peer Networks. 2nd Intl. Wkshp. on Peer-to-Peer Systems, 2003.
31. J. Shneidman and D. Parkes. Using Redundancy to Improve Robustness of Distributed Mechanism Implementations. 4th ACM Conf. on Electronic Commerce, 2003.