Result verification and trust-based scheduling in peer-to-peer Grids

被引:57
作者
Zhao, SY [1 ]
Lo, V [1 ]
GauthierDickey, C [1 ]
机构
[1] Univ Oregon, Dept Informat & Comp Sci, Eugene, OR 97403 USA
来源
Fifth IEEE International Conference on Peer-to-Peer Computing, Proceedings | 2005年
关键词
result verification; Grid computing; trust; reputation system; peer-to-peer;
D O I
10.1109/P2P.2005.32
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Peer-to-peer Grids that seek to harvest idle cycles available throughout the Internet are vulnerable to hosts that fraudulently accept computational tasks and then maliciously return arbitrary results. Current strategies employed by popular cooperative computing Grids, such as SETI@Home, rely heavily on task replication to check results. However, result verification through replication suffers from two potential shortcomings: (1) susceptibility to collusion in which a group of malicious hosts conspire to return the same bad results and (2) high fixed overhead incurred by running redundant copies of the task. In this paper, we first propose a scheme called Quiz to combat collusion. The basic idea of Quiz is to insert indistinguishable quiz tasks with verifiable results known to the client within a package containing several normal tasks. The client can then accept or reject the normal task results based on the correctness of quiz results. Our second contribution is the promotion of trust-based task scheduling in peer-to-peer Grids. By coupling a reputation system with the basic verification schemes - Replication and Quiz - a client can potentially avoid malicious hosts and also reduce the overhead of verification for trusted hosts.
引用
收藏
页码:31 / 38
页数:8
相关论文
共 19 条
[11]  
LEE S, 2003, IEEE INFOCOMM
[12]  
LO V, 2004, IPTPS
[13]  
MAHESWARAN M, 1999, PARALLEL DISTRIBUTED
[14]  
Molnar D., 2000, E COMMERCE
[15]  
SANDER T, 1998, LNCS
[16]  
SARMENTA LFG, 2001, CCGRID
[17]  
WANG Y, 2003, 2 INT WORKSH AG PEER
[18]  
YU B, 2004, 1 IEEE S MULT SEC SU
[19]  
SETI HOME SEARCH EXT