计算机工程Issue(9)：111-116,123,7.DOI:10.3969/j.issn.1000-3428.2014.09.023
非结构化P2 P网络中基于节点的MQR算法设计与实现
Design and Implementation of Node-based MQR Alogorithm in Unstructured P2 P Networks
谢晃 1张昱 1王云凯2
作者信息
- 1. 中国科学技术大学软件学院，江苏 苏州215123
- 2. 西南财经大学经济信息工程学院，成都611130
- 折叠
摘要
Abstract
Due to the lack of global governance mechanisms in the unstructured Peer-to-Peer( P2P) network,network nodes do not know the entire network topology and target data location information. So the query message routing process has a high randomness, not only query performance is low, but also bandwidth consumption is large. Based upon the analysis of two typical categories of unstructured P2P routing alogorithms,this paper proposes a node-based Mixed Query Routing( MQR) alogorithm to deal with the scale problem of redundant messages and to improve the search scope of data. By means of the status information about the nodes and the TTL values of the queries,it can improve the search performance both in the aspect of data’ s search scope and network efficiency. Simulation experimental results show that compared with the typical alogorithms APS and Random Walk,the MQR alogorithm can reach higher accuracy rate,better network efficiency and recall rate.关键词
对等网络/资源定位/路由算法/非结构化/MQR算法Key words
Peer-to-Peer ( P2 P ) network/resource location/routing alogorithm/unstructured/Mixed Query Routing ( MQR) alogorithm分类
信息技术与安全科学引用本文复制引用
谢晃,张昱,王云凯..非结构化P2 P网络中基于节点的MQR算法设计与实现[J].计算机工程,2014,(9):111-116,123,7.
