基于子树间快捷连接的非结构化P2P资源搜索方法  

Resources searching method for unstructured peer-to-peer networks based on shortcuts between subtrees

作　　者：吴晓军[1,2] 陈霁[1] 房佩[1] 郭海亮[1] 

机构地区：[1]陕西师范大学计算机科学学院,西安710062 [2]西北工业大学自动化学院,西安710072

出　　处：《计算机应用》2012年第7期1799-1803,共5页journal of Computer Applications

基　　金：国家自然科学基金面上项目(11172342);教育部"新世纪优秀人才支持计划"资助项目(NCET-11-0674);陕西省自然科学基金资助项目(2012JM8043)

摘　　要：通过对非结构化P2P网络资源搜索方法的研究,提出了一种P2P覆盖网络。网络采用多路平衡树形拓扑结构,当新节点加入时在其与根节点的各子树间创建仅参与查询消息第一跳转发的快捷连接,搜索过程中利用快捷连接实现查询消息在根的各子树间并行转发并且不依赖根节点。仿真比较了所提网络同Gnutella和随机漫步网络的性能,所提网络具有低消息冗余率、高搜索成功率和较低的平均搜索时间复杂度。分析结果表明所提网络在资源搜索方面是高效可行的。Through studying resources searching methods of unstructured Peer-to-Peer（P2P） network,a new P2P overlay network was proposed.Using a multi-way balanced tree topology,the network created shortcuts between the added node and each subtree of the root when a new node inserted,which forwarded first-hop of a query message only,and then query messages could be forwarded in parallel in each subtree of the root without relying on the root.Compared with the performance of Gnutella and Random Walks network in simulation,the proposed network had lower messages redundancy ratio,higher resource searching success ratio and lower average searching time complexity.The analytical results show that the proposed network is efficient and feasible for searching resources.

关 键 词：非结构化P2P网络 覆盖网络拓扑 资源搜索 B-TREE 快捷连接 

分 类 号：TP393.02[自动化与计算机技术—计算机应用技术]