Designing mechanisms for reliable internet-based computing

Proceedings of the 7th IEEE International Symposium on Networking Computing and Applications, NCA 2008

Volumn , Issue , 2008, Pages 315-324

  Anta, Antonio Fernández ^a   Georgiou, Chryssis ^b   Mosteiro, Miguel A ^a,c  

^a UNIVERSIDAD REY JUAN CARLOS   (Spain)

^b UNIVERSITY OF CYPRUS   (Cyprus)

^c RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GAME-THEORETIC MODELS; INTERNATIONAL SYMPOSIUM; INTERNET-BASED COMPUTING;

COMPUTER NETWORKS; GAME THEORY; INTERNET; MECHANISMS; RELIABILITY; TECHNICAL PRESENTATIONS;

COMPUTER SYSTEMS;

EID: 51749096881     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/NCA.2008.41     Document Type: Conference Paper

References (28)

1. I. Abraham, D. Dolev, R. Goden, and J.Y. Halpern. Distributed computing meets game theory: Robust mechanisms for rational secret sharing and multiparty computation. In proc. of PODC 2006, pp. 53-62, 2006.
2. D. Anderson. BOINC: A system for public-resource computing and storage. In proc. of GRID 2004, pp. 4-10, 2004.
3. J. R. Douceur and T. Moscibroda. Lottery trees: motivational deployment of networked systems In proc. of SIGCOMM 2007, pp. 121-132, 2007.
4. J. R. Douceur. The Sybil attack. In proc. of IPTPS 2002, pp. 251-260, 2002.
5. "Enabling Grids for E-sciencE", http://www.eu-egee.org.
6. J. Feigenbaum, Ch. Papadimitriou, R. Sami, and S. Shenker. A BGP-based mechanism for lowest-cost routing. Distributed Computing, 18(1):61-72, 2005.
7. A. Fernández, C. Georgiou, L. Lopez, and A. Santos. Reliably executing tasks in the presence of untrusted processors. In proc. of SRDS 2006, pp. 39-50, 2006.
8. A. Fernández Anta, C. Georgiou, and M. A. Mosteiro. Cost-sensitive Mechanisms for Internet-based Computing. Technical Report UCY-TR-08-01, Dept. of Computer Science, University of Cyprus, March 2008.
9. I.T. Foster and A. Iamnitchi. On death, taxes, and the convergence of P2P and grid computing. In proc. of IPTPS 2003, pp. 118-128, 2003.
10. D. Fotakis. Memoryless facility location in one pass. In proc. of STACS 2006, pp. 608-620, 2006.
11. P. Golle and I. Mironov. Uncheatable distributed computations. In proc. of CT-RSA 2001, pp. 425-440, 2001.
12. P. Golle and S. Stubblebine. Secure distributed computing in a commercial environment. In proc. of Financial Cryptography, 2001.
13. M. Halldorsson, J.Y. Halpern, L. Li, and V. Mirrokni. On spectrum sharing games. In proc. of PODC 2004, pp. 107-114, 2004.
14. J.Y. Halpern. Computer science and game theory: A brief survey. Palgrave Dictionary of Economics, to appear.
15. J.Y. Halpern and V. Teague. Rational secret sharing and multiparty computation. In proc. of STOC 2004, pp. 623-632, 2004.
16. K.M. Konwar, S. Rajasekaran, and A.A. Shvartsman. Robust network supercomputing with malicious processes. In proc. of DISC 2006, pp. 474-488, 2006.
17. E. Korpela, D. Werthimer, D. Anderson, J. Cobb, and M. Lebofsky. SETI@home: Massively distributed computing for SETI. Computing in Science and Engineering, 3(1):78-83, 2001.
18. E. Koutsoupias and Ch. Papadimitriou. Worst-case equilibria. In proc. of STACS 1999, pp. 404-413, 1999.
19. M.Mavronicolas and P. Spirakis. The price of selfish routing. Algorithmica, 48(1):91-126, 2007.
20. T. Moscibroda, S. Schmid, and R. Wattenhofer. When selfish meets evil: byzantine players in a virus inoculation game. In proc. of PODC 2006, pp. 35-44, 2006.
21. J.F. Nash. Equilibrium points in n-person games. National Academy of Sciences, 36(1):48-49, 1950.
22. N. Nisan and A. Ronen. Algorithmic mechanism design. Games and Economic Behavior, 35:166-196, 2001.
23. N. Nisan, T. Roughgarden, E. Tardos, and V.V. Vazirani, editors. Algorithmic Game Theory. Cambridge University Press, 2007.
24. A. Lopez-Ortiz. Algorithmic foundations of the Internet. ACM SIGACT News Distributed Computing Column 18, 2005.
25. T. Roughgarden and E. Tardos. How bad is selfish routing? Journal of ACM, 49(2):236-259, 2002.
26. J. Shneidman and D.C. Parkes. Rationality and self-interest in P2P networks. In proc. of IPTPS 2003, pp. 139-148, 2003.
27. "TeraGrid", http://www.teragrid.org.
28. M. Yurkewych, B.N. Levine, and A.L. Rosenberg. On the cost-ineffectiveness of redundancy in commercial P2P computing. In proc. of CCS 2005, pp. 280-288, 2005.