Trade-offs between reliability and overheads in peer-to-peer reputation tracking

被引:10
作者
Gupta, M [1 ]
Ammar, MH
Ahamad, M
机构
[1] Indiana Univ, Dept Comp Sci, Bloomington, IN 47405 USA
[2] Georgia Tech, Coll Comp, Atlanta, GA 30332 USA
关键词
peer-to-peer; Gnutella; reputations;
D O I
10.1016/j.comnet.2005.07.006
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The success of incentive techniques to motivate freeriders to contribute resources in file-sharing Gnutella-like peer-to-peer networks depends on the availability of peer behavior tracking in terms of resource consumption and contribution. Though many reputation systems have been proposed toward the goal of behavior tracking, the overheads incurred in such tracking have received little attention. Consideration of overheads is an important factor in judging the merits of a practical reputation tracking scheme in order to maintain the scalability of the underlying peer-to-peer network. This paper proposes two methods of reputation tracking: strong and weak reputations. These methods differ in the trade-offs between reliability of reputation tracking and the overheads incurred. We formally specify and verify strong reputations and note that while the scheme yields highly reliable reputation tracking, the reliability and overhead trade-offs in weak reputations present a more viable alternative for large peer-to-peer networks. (c) 2005 Elsevier B.V. All rights reserved.
引用
收藏
页码:501 / 522
页数:22
相关论文
共 16 条
[1]  
ABERER K, 2001, 9 INT C INF KNOWL MA
[2]  
[Anonymous], WORLD WID WEB C
[3]  
DAMIANI E, 2002, 9 ACM C COMP COMM SE
[4]  
EASTLAKE PJD, 2001, 3174 RFC
[5]  
GOUDA MG, 1998, ELEMENT NETWORK PROT
[6]  
GUPTA M, 2003, ACM NOSSDAV
[7]  
GUPTA M, 2003, ACM NGC
[8]  
Lai Kevin, 2003, WORKSH EC PEER TO PE
[9]  
LEE DF, 2002, THESIS U TEXAS AUSTI
[10]  
Lee S, 2003, IEEE INFOCOM SER, P1272