A scheduling and certification algorithm for defeating collusion in desktop grids

Louis Claude Canon, Emmanuel Jeannot, Jon Weissman

Research output: Chapter in Book/Report/Conference proceedingConference contribution

9 Scopus citations

Abstract

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.

Original languageEnglish (US)
Title of host publicationProceedings - 31st International Conference on Distributed Computing Systems, ICDCS 2011
Pages343-352
Number of pages10
DOIs
StatePublished - 2011
Event31st International Conference on Distributed Computing Systems, ICDCS 2011 - Minneapolis, MN, United States
Duration: Jun 20 2011Jul 24 2011

Publication series

NameProceedings - International Conference on Distributed Computing Systems

Other

Other31st International Conference on Distributed Computing Systems, ICDCS 2011
Country/TerritoryUnited States
CityMinneapolis, MN
Period6/20/117/24/11

Keywords

  • Collusion
  • Desktop grid
  • Modeling
  • Sabotage

Fingerprint

Dive into the research topics of 'A scheduling and certification algorithm for defeating collusion in desktop grids'. Together they form a unique fingerprint.

Cite this