loading...
A Reliability Model for Result Checking in Volunteer Computing
July 28-August 01
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SAINT.2008.252008 International Symposium on Appli ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
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.
Index Terms:
result checking, volunteer computing
Citation:
Ling Xu, Hong Wang, Hiroyuki Takizawa, Hiroaki Kobayashi, "A Reliability Model for Result Checking in Volunteer Computing," saint, pp.201-204, 2008 International Symposium on Applications and the Internet, 2008
Usage of this product signifies your acceptance of the Terms of Use.