1st International ICST Conference on Communications and Networking in China

Research Article

Combating Hidden Action in Unstructured Peer-to-Peer Systems

  • @INPROCEEDINGS{10.1109/CHINACOM.2006.344762,
        author={Qi  Zhao and Jianzhong Zhang and Jingdong  Xu},
        title={Combating Hidden Action in Unstructured Peer-to-Peer Systems},
        proceedings={1st International ICST Conference on Communications and Networking in China},
        publisher={IEEE},
        proceedings_a={CHINACOM},
        year={2007},
        month={4},
        keywords={Hidden Action Peer-to-Peer Unstructured},
        doi={10.1109/CHINACOM.2006.344762}
    }
    
  • Qi Zhao
    Jianzhong Zhang
    Jingdong Xu
    Year: 2007
    Combating Hidden Action in Unstructured Peer-to-Peer Systems
    CHINACOM
    IEEE
    DOI: 10.1109/CHINACOM.2006.344762
Qi Zhao1,*, Jianzhong Zhang1,*, Jingdong Xu1,*
  • 1: Computer Science Department, Nankai University, Tianjin, 300071 China
*Contact email: qizhao6688@hotmail.com, zjz@mail.nankai.edu.cn, xujd@mail.nankai.edu.cn

Abstract

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.