A Robust Unstructured Mobile Peer-to-Peer Files Sharing System under Higher Peer Churn Rate

被引:0
作者
Zhang, Xin [1 ]
Xia, Yinghu [2 ]
Lin, Chunqing [3 ]
机构
[1] CNPC, Res Inst Petr Explorat & Dev, Beijing 100083, Peoples R China
[2] CNPC, Supervis Stn, Downhole Operat Dept Shanshan Oilfield, Beijing 839000, Peoples R China
[3] CNPC, Oil Prod Engn Res Inst Huabei Oilfield, Renqiu 062550, Hebei, Peoples R China
来源
PROCEEDINGS OF THE 2016 4TH INTERNATIONAL CONFERENCE ON SENSORS, MECHATRONICS AND AUTOMATION (ICSMA 2016) | 2016年 / 136卷
关键词
Mobil peer-to-peer; Churn; Files sharing; Machine learning; EFFICIENT; NETWORKS;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In the unstructured Peer-to-Peer systems, a core operation is efficient location of resources. Conventional informative searching algorithms, however, always cannot perform well under peer churn rate network environments. In this paper, we designed a robust unstructured peer-to-peer files sharing system. When forwarding query, we usually choose the peer with the highest forward probability. But in this paper we didn't compute the forward probability according to the current neighbor node's individual search history but to a leaning model based on machine learning technologies. We proposed a more robust way for searching. The experimental results show that our methods are more effective and efficient under higher peer churn environment.
引用
收藏
页码:227 / 234
页数:8
相关论文
共 15 条
[1]  
Beverly R., 2007, SYSML 07, P1
[2]  
Gatani L., 2005, P INT WORKSH COMP AR
[3]  
Gkantsidis C, 2005, IEEE INFOCOM SER, P1526
[4]  
GKANTSIDIS C, 2004, P IEEE C COMP COMM, P7
[5]  
Imen Filali, 2010, CLUST CLOUD GRID COM, P438
[6]  
Kalogeraki V., 2002, Proceedings of the Eleventh International Conference on Information and Knowledge Management. CIKM 2002, P300, DOI 10.1145/584792.584842
[7]  
Kumar A, 2005, IEEE INFOCOM SER, P1162
[8]  
Li X., 2006, P 26 IEEE INT C WORK
[9]  
Liau C. Y., 2003, P DEXA C
[10]  
LV Q, 2002, P ACM SIGMETRICS 02, P258