A reliability model for result checking in volunteer computing

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

1 Citation (Scopus)

Abstract

Large scale volunteer computing has been proved to be an efficient mechanism to solve the complicated problems [2]. Specifically, in such a system, thousands of idle computers on the network are organized to finish a series of tasks dispatched by a central server. However, this computing model is vulnerable to attack from malicious peers returning incorrect results, since it is impossible to check each of thousands of the results. To address this problem, we propose a scheme to evaluate the reliability of each peer, and hence to distinguish whether the peer is honest or malicious. Specifically, the task dispatching pattern is changed so that the results returned from a peer can reflect the type of this peer. We focus on a typical dispatching pattern, and analyze its performance both theoretically and experimentally. The results indicate that the proposed scheme can effectively differentiate the malicious peers for most of the reasonable situations.

Original languageEnglish
Title of host publicationProceedings - 2008 International Symposium on Applications and the Internet, SAINT 2008
Pages201-204
Number of pages4
DOIs
Publication statusPublished - 2008
Event2008 International Symposium on Applications and the Internet, SAINT 2008 - Turku, Finland
Duration: 2008 Jul 282008 Aug 1

Publication series

NameProceedings - 2008 International Symposium on Applications and the Internet, SAINT 2008

Other

Other2008 International Symposium on Applications and the Internet, SAINT 2008
CountryFinland
CityTurku
Period08/7/2808/8/1

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Computer Science Applications

Fingerprint Dive into the research topics of 'A reliability model for result checking in volunteer computing'. Together they form a unique fingerprint.

Cite this