Combating Hidden Action in Unstructured Peer-to-Peer Systems

被引:0
作者
Zhao, Qi [1 ]
Zhang, Jianzhong [1 ]
Xu, Jingdong [1 ]
机构
[1] Nankai Univ, Comp Sci Dept, Tianjin 300071, Peoples R China
来源
2006 FIRST INTERNATIONAL CONFERENCE ON COMMUNICATIONS AND NETWORKING IN CHINA | 2006年
关键词
Hidden Action; Peer-to-Peer; Unstructured;
D O I
暂无
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
In unstructured peer-to-peer systems, cooperation by the intermediate peers are essential for the success of queries. However, intermediate peers may choose to forward packets at a low priority or not forward the packets at all, which is referred as peers' hidden action. Hidden Action may lead to significant decrement of search efficiency. In contrast to building a global system with reputations or economics, we proposed MSSF, an improved search method, to help queries route around the peers with hidden action. MSSF does not need to check other peers' behavior. It automatically adapts to change query routes according to the previous query results. Simulation results show that MSSF is more robust than Gnutella flooding when peers with hidden action increase.
引用
收藏
页数:5
相关论文
共 16 条
[1]  
[Anonymous], 2002, IEEE INTERNET COMPUT
[2]  
[Anonymous], 2003, P WEBDB
[3]  
[Anonymous], 2003, P WIOPT 03 MOD OPT M
[4]  
Banerjee A., 1997, SIM VERS SEQ MOV STR
[5]  
Bansal S., 2003, OBS BAS COOP ENF AD
[6]  
BUCHEGGER S, 2002, P IEEE ACM S MOB AD
[7]  
Buchegger S, IC2003 EPFL
[8]  
CHU J, 2002, P SPIE
[9]   MORAL HAZARD IN TEAMS [J].
HOLMSTROM, B .
BELL JOURNAL OF ECONOMICS, 1982, 13 (02) :324-340
[10]  
Marti S., 2000, MobiCom 2000. Proceedings of the Sixth Annual International Conference on Mobile Computing and Networking, P255, DOI 10.1145/345910.345955