点对点
计算机科学
同行评审
文件共享
移动电话技术
移动计算
万维网
计算机网络
移动无线电
互联网
法学
政治学
作者
Xin Zhang,Yinghu Xia,Chunqing Lin
标识
DOI:10.2991/icsma-16.2016.42
摘要
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 peerto-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.
科研通智能强力驱动
Strongly Powered by AbleSci AI