###
Journal of Software:2011.22(9):2121-2136

eMule 网络最佳节点标识
刘祥涛,程学旗,李洋,陈小军,白硕,刘悦
(中国科学院 计算技术研究所,北京 100190;中国科学院 研究生院,北京 100049;中国移动通信研究院,北京 100053)
Optimal Peer Identifier in eMule Network
LIU Xiang-Tao,CHENG Xue-Qi,LI Yang,CHEN Xiao-Jun,BAI Shuo,LIU Yue
(Institute of Computing Technology, The Chinese Academy of Sciences, Beijing 100190, China;Graduate University, The Chinese Academy of Sciences, Beijing 100049, China;China Mobile Research Institute, Beijing 100053, China)
Abstract
Chart / table
Reference
Similar Articles
Article :Browse 3617   Download 4195
Received:June 09, 2009    Revised:December 25, 2009
> 中文摘要: eMule 网络是近年来越来越流行的文件共享对等网络.一直以来,文件源的准确定位是文件共享对等网络的一个关键步骤;此外,不健康内容的肆意传播也使网络监管成为必需.这些都导致准确确定eMule 网络中节点的需求,同时促使eMule 网络最佳节点标识问题的提出.然而,eMule 网络中广泛使用的节点标识Kad ID 因可被eMule 用户任意更改,存在Kad ID 别名,即单个节点对应多个Kad ID 的情况,以及Kad ID 重复,即多个节点对应同一个Kad ID的情况,从而使用传统Kad ID 很难准确确
Abstract:In recent years, eMule network, a kind of peer-to-peer (P2P) file-sharing network has become more and more popular. Along with its popularity, the demand to accurately determine the peer in eMule has also increased for two reasons: it is a critical step to accurately locate sources of files in P2P file-sharing networks, and the wanton spread of vulgar content makes it necessary to censor eMule. This demand allows everyone to put forward the problem of optimal peer identifier in eMule network. However, since Kad ID (the widely-used identifier in eMule network) can be freely changed by users of eMule, there exists Kad ID aliasing, a single peer may correspond to multiple Kad IDs; reversely, There also exists Kad ID repetition, which are multiple peers corresponding with a single Kad ID. Therefore, it is difficult to accurately determine the peer by using Kad ID. This paper attempts to solve this problem. First, the stability factor (SF) of peer identifier is defined to evaluate candidate identifiers. Then, a crawler named Rainbow is designed and implemented to collect peer information from multiple candidate identifiers’ relationship in real eMule network. Note that Rainbow has been proved to be convergent and has low time and space complexity. Experimental results show that {userID} is the optimal peer identifier in peer identifier set 2{Kad ID,userID,IP}-{Φ} as {userID} has the largest SF value. Later on, in order to quantify the extent of Kad ID aliasing, the relationship between {userID} and {Kad ID} is discussed. Lastly, the effectiveness of the application of the optimal peer identifier is analyzed. Results show that peers are more accurately determined when using {userID} as the identifier of peers. All in all, the identification of optimal peer identifier provides a basis for future research of eMule network, and Rainbow serves as a useful tool for measuring real eMule network.
文章编号:     中图分类号:    文献标志码:
基金项目:国家自然科学基金(60803085, 60873245) 国家自然科学基金(60803085, 60873245)
Foundation items:
Reference text:

刘祥涛,程学旗,李洋,陈小军,白硕,刘悦.eMule 网络最佳节点标识.软件学报,2011,22(9):2121-2136

LIU Xiang-Tao,CHENG Xue-Qi,LI Yang,CHEN Xiao-Jun,BAI Shuo,LIU Yue.Optimal Peer Identifier in eMule Network.Journal of Software,2011,22(9):2121-2136