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

doi:10.3724/SP.J.1087.2012.01799

计算机应用 ›› 2012, Vol. 32 ›› Issue (07): 1799-1803.DOI: 10.3724/SP.J.1087.2012.01799

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

吴晓军¹,²,陈霁¹,房佩¹,郭海亮¹

1. 陕西师范大学计算机科学学院，西安710062
2. 西北工业大学自动化学院，西安710072

收稿日期:2012-01-05 修回日期:2012-02-27 发布日期:2012-07-05 出版日期:2012-07-01
通讯作者: 吴晓军
作者简介:吴晓军(1970-)，男，陕西凤翔人，副教授，博士，主要研究方向：模式识别与智能系统、复杂系统与复杂性理论；陈霁(1986-)，男，甘肃陇南人，硕士研究生，主要研究方向：数字信号处理与应用；房佩(1987-)，男，河南邓州人，硕士研究生，主要研究方向：嵌入式计算机系统设计；郭海亮(1986-)，男，陕西宝鸡人，硕士研究生，主要研究方向：数字信号处理与应用。
基金资助:
国家自然科学基金面上项目（11172342）;教育部“新世纪优秀人才支持计划”资助项目（NCET-11-0674）;陕西省自然科学基金资助项目(2012JM8043)

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

WU Xiao-Jun¹,²,CHEN Ji¹,FANG Pei¹,GUO Hai-liang¹

1. College of Automation, Northwestern Polytechnical University, Xi'an Shaanxi 710072, China
2. School of Computer Science, Shaanxi Normal University, Xi'an Shaanxi 710062, China

Received:2012-01-05 Revised:2012-02-27 Online:2012-07-05 Published:2012-07-01
Contact: WU Xiao-Jun

摘要/Abstract

摘要： 通过对非结构化P2P网络资源搜索方法的研究，提出了一种P2P覆盖网络。网络采用多路平衡树形拓扑结构，当新节点加入时在其与根节点的各子树间创建仅参与查询消息第一跳转发的快捷连接，搜索过程中利用快捷连接实现查询消息在根的各子树间并行转发并且不依赖根节点。仿真比较了所提网络同Gnutella和随机漫步网络的性能，所提网络具有低消息冗余率、高搜索成功率和较低的平均搜索时间复杂度。分析结果表明所提网络在资源搜索方面是高效可行的。

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

Abstract: 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.

Key words: unstructured Peer-to-Peer (P2P) network, overlay topology, resource searching, B-Tree, shortcut

中图分类号:

TP393.02

吴晓军陈霁房佩郭海亮. 基于子树间快捷连接的非结构化P2P资源搜索方法[J]. 计算机应用, 2012, 32(07): 1799-1803.

WU Xiao-Jun CHEN Ji FANG Pei GUO Hai-liang. Resources searching method for unstructured peer-to-peer networks based on shortcuts between subtrees[J]. Journal of Computer Applications, 2012, 32(07): 1799-1803.

参考文献

［1］ LIU YUHUA, XIONG NAIXUE, ZHU LONGQUAN, et al. An effective simulation method for search strategy in unstructured P2P network ［J］. Simulation Modelling Practice and Theory, 2010, 18(4): 456-469.

［2］ FURNESS J, KOLBERG M. Considering complex search techniques in DHTs under churn ［C］// Proceedings of the 2011 IEEE Consumer Communications and Networking Conference. Washington, DC: IEEE Computer Society, 2011: 559-564.

［3］陈贵海,李振华.对等网络：结构、应用与设计［M］.北京:清华大学出版社,2007:45-81.

［4］ JIANG SONG, GUO LEI, ZHANG XIAODONG, et al. Light-flood: minimizing redundant messages and maximizing the scope of peer-to-peer search ［J］. IEEE Transactions on Parallel and Distributed Systems, 2008, 19(5): 601-614.

［5］王建勇,龚伏廷,李玉玲.非结构化P2P网络中减少冗余的搜索策略［J］.计算机工程与应用,2010,46(36):122-125.

［6］ GKANTSIDIS C, MIHAIL M, SABERI A. Random walks in peer-to-peer networks: algorithms and evaluation ［J］. P2P Computing Systems, 2006, 63(3): 241-263.

［7］ KANG C. Survey of search and optimization of P2P networks ［J］. Peer-to-Peer Networking and Applications, 2011, 4(3): 211-218.

［8］ YU CUIBO, GOU XUERONG, ZHANG CHUNHONG, et al. Supernode election algorithm in P2P network based upon district partition ［J］. JDCTA: International Journal of Digital Content Technology and Its Applications, 2011, 5(1): 186-194.

［9］黄宇,金蓓弘.非结构化P2P系统Overlay优化技术综述［J］.小型微型计算机系统,2008,29(2):238-244.

［10］ CHAWATHE Y. Scattercast: an adaptable broadcast distribution framework ［J］. ACM Multimedia Systems Journal on Multimedia Distribution, 2002, 9(1): 104-118.

［11］ CASTELLA D, BLANCO H, GINE F, et al. A computing resource discovery mechanism over a P2P tree topology ［C］// Proceedings of the 9th International Conference on High Performance Computing for Computational Science. Berlin: Springer-Verlag, 2010: 366-379.

［12］许松.非结构化P2P网络拓扑结构的改进机制［J］.计算机工程与应用,2009,45(10):110-112.

［13］ GRAEFE G, KUNO H. Modern B-tree techniques ［C］// Proceedings of the IEEE 27th International Conference on Data Engineering. Piscataway: IEEE, 2011: 1370-1373.

［14］ KAZMI I, BUKHARI S F Y. PeerSim: An efficient & scalable testbed for heterogeneous cluster-based P2P network protocols ［C］// Proceedings of the 13th International Conference on Modelling and Simulation. Washington, DC: IEEE Computer Society, 2011: 420-425.

［15］ RAO W, CHEN L, FU A W, et al. Optimal proactive caching in peer-to-peer network: analysis and application ［C］// Proceedings of the 6th ACM Conference on Information and Knowledge Management. New York: ACM Press, 2007: 663-672.

[1]	陈力, 丁世飞, 于文家. 基于跨通道交叉融合和跨模块连接的轻量级卷积神经网络[J]. 计算机应用, 2020, 40(12): 3451-3457.
[2]	高媛, 刘志, 秦品乐, 王丽芳. 基于深度残差生成对抗网络的医学影像超分辨率算法[J]. 计算机应用, 2018, 38(9): 2689-2695.
[3]	安世全高涛丁进标. 非结构对等网络中一种有效的资源搜索策略[J]. 计算机应用, 2009, 29(11): 2881-2883.

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

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

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 3

编辑推荐

Metrics