A Scheduling and Certification Algorithm for Defeating Collusion in Desktop Grids

By exploiting idle time on volunteer machines, desktop grids provide a way to execute large sets of tasks with negligible maintenance and low cost. Although desktop grids are attractive for their scalability and low cost, relying on external resources may compromise the correctness of application execution due to the well-known unreliability of nodes. In this paper, we consider a very challenging threat model: correlated errors caused either by organized groups of cheaters that may collude to produce incorrect results, or by buggy or so-called "unofficial" clients. By using a previously described on-line algorithm for detecting collusion and characterizing the participant behaviors, we propose a scheduling and result certification algorithm that tackles collusion. Using several real-life traces, we show that our approach minimizes both replication overhead and the number of incorrectly certified results.

[1]  David P. Anderson,et al.  BOINC: a system for public-resource computing and storage , 2004, Fifth IEEE/ACM International Workshop on Grid Computing.

[2]  Chris GauthierDickey,et al.  Result verification and trust-based scheduling in peer-to-peer grids , 2005, Fifth IEEE International Conference on Peer-to-Peer Computing (P2P'05).

[3]  Emmanuel Jeannot,et al.  A dynamic approach for characterizing collusion in desktop grids , 2010, 2010 IEEE International Symposium on Parallel & Distributed Processing (IPDPS).

[4]  Hector Garcia-Molina,et al.  The Eigentrust algorithm for reputation management in P2P networks , 2003, WWW '03.

[5]  Chryssis Georgiou,et al.  Reliably Executing Tasks in the Presence of Untrusted Entities , 2006, 2006 25th IEEE Symposium on Reliable Distributed Systems (SRDS'06).

[6]  Audun J sang,et al.  An Algebra for Assessing Trust in Certi cation Chains , 1998 .

[7]  Luis F. G. Sarmenta.  Sabotage-tolerance mechanisms for volunteer computing systems , 2002, Future Gener. Comput. Syst..

[8]  Bruno Sousa,et al.  Sabotage-tolerance and trust management in desktop grid computing , 2007, Future Gener. Comput. Syst..

[9]  Audun Jøsang,et al.  An Algebra for Assessing Trust in Certification Chains , 1999, NDSS.

[10]  David P. Anderson,et al.  SETI@home: an experiment in public-resource computing , 2002, CACM.

[11]  Álvaro Enrique Arenas,et al.  Defeating Colluding Nodes in Desktop Grid Computing Platforms , 2008, 2008 IEEE International Symposium on Parallel and Distributed Processing.

[12]  Alexandru Iosup,et al.  The Failure Trace Archive: Enabling Comparative Analysis of Failures in Diverse Distributed Systems , 2010, 2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing.

[13]  Vern Paxson,et al.  On the Adaptive Real-Time Detection of Fast-Propagating Network Worms , 2007, DIMVA.

[14]  John R. Douceur,et al.  The Sybil Attack , 2002, IPTPS.

[15]  Thomas Engel,et al.  Collusion Detection for Grid Computing , 2009, 2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid.

[16]  Arnold L. Rosenberg,et al.  On the cost-ineffectiveness of redundancy in commercial P2P computing , 2005, CCS '05.

[17]  Franck Cappello,et al.  Cost-benefit analysis of Cloud Computing versus desktop grids , 2009, 2009 IEEE International Symposium on Parallel & Distributed Processing.

[18]  Axel W. Krings,et al.  A Probabilistic Approach for Task and Result Certification of Large-Scale Distributed Applications in Hostile Environments , 2005, EGC.

[19]  Abhishek Chandra,et al.  Adaptive Reputation-Based Scheduling on Unreliable Distributed Infrastructures , 2007, IEEE Transactions on Parallel and Distributed Systems.

[20]  Emmanuel Jeannot,et al.  A Scheduling Algorithm for Defeating Collusion , 2010 .