无结构P2P网络中一种高效的资源搜索机制

doi:10.3969/j.issn.1000-0801.2012.03.029

摘要/Abstract

摘要：

在众多 P2P 资源搜索技术中，基于语义相关的搜索被重点关注。本文在基于语义分组的P2P网络拓扑下，提出了一种新颖高效的搜索方式 SKIP（search with K-Iteration preference），即 K-层迭代优先选择算法。查询定位到目标节点后，SKIP 系统使用K-层迭代优先选择算法进行搜索。实验表明，SKIP 算法具有高效的搜索效率和较低的搜索开销，与现有的基于语义的搜索策略相比，具有更高的查准率和更低的查询开销。

关键词: K-层迭代, 优先, P2P网络

Abstract:

Among various searching techniques,semantic-based searching has drawn significant attention recently.In this paper,we propose a novel and efficient search mechanism SKIP （search with K-Iteration preference）for P2P networks based on semantic group.In SKIP system,the most relevant part of the target nodes will be preferentially chosen to forward the query and that is called SKIP.Our analysis and simulation results show that the SKIP scheme provides a low overhead on topology maintenance that can be effectively used in P2P searching.Compared with the current semantic-based searching mechanism,we show that the SKIP scheme can outperform in terms of higher precision and lower search cost.

Key words: K-Iteration, preference, P2P network

赵佩章,张同光. 无结构P2P网络中一种高效的资源搜索机制[J]. 电信科学, 2012, 28(3): 110-115.

Peizhang Zhao,Tongguang Zhang. An Efficient Search Mechanism in Unstructured P2P Network[J]. Telecommunications Science, 2012, 28(3): 110-115.

图/表 6

图1

图2

图3

表1

图4

图5

参考文献 19

1	Risson J , Moors T . Survey of research towards robust peer-to-peer networks: search methods. Computer Networks, 2006,50(17): 3485～3521
2	Gnutella 0.6.
3	Yang B , Garcia-Molina H . Improving search in peer-to-peer networks. Proceedings of the ICDCS 2002, Vienna,Austria, 2002: 5～14
4	Lv Q , Cao P , Cohen E . Search and replication in unstructured peer-to-peer networks. Proceedings of 16th ACM Ann Int'l Conf Supercomputing（ICS）, New York,USA, 2002: 84～95
5	Cohen E , Kaplan H , Fiat A . Associative search in peer-to-peer networks: harnessing latent semantics. Proceedings of IEEE INFOCOM, 2003,2(4): 1261～1271
6	Spripanidkulchai K , Maggs B , Zhang H . Efficient content location using interest-based locality in peer-to-peer systems. Proceedings of IEEE INFOCOM, 2003,3(3): 2166～2176
7	Bawa M , Manku G , Raghavan P . SETS: search enhanced by topic segmentation. Proceedings of 26th Ann Int'l ACM SIGIR Conf, Toronto,Canada, 2003: 306～313
8	Zhu Y , Hu Y . Enhancing search performance on gnutella-like P2P systems. IEEE Transactions on Parallel and Distributed Systems, 2006,17(12): 1482～1495
9	Guo L , Jiang S , Xiao L , et al. Exploiting content localities for efficient search in P2P systems. roceedings of 18th Ann Conf Distributed Computing （DISC'04）, Amsterdam,Netherlands, 2004
10	Berry M W , Drmac Z , Jessup E R . Matrices,vector spaces,and information retrieval. SIAM Review, 1999,41(2): 335～362
11	Ratnasamy S , Francis P , Handley M . A scalable content addressable network. Proceedings of ACM SIGCOMM, San Diego,CA,USA, 2001: 161～172
12	Rowstron A , Druschel P . Pastry: scalable,distributed object location and routing for large-scale peer-to-peer systems. Proceedings of the 18th IFIP/ACM International Conference on Distributed System Platforms （Middleware）, Heidelberg,Germany, 2001: 326～350
13	Stoica I , Morris R , Karger D , et al. Chord: a scalable peer-to-peer lookup protocol for internet applications. IEEE/ACM Transactions on Networking, 2003,11(1): 17～32
14	Crespo A , Garcia-Molina H . Routing indices for peer-to-peer systems. Proceedings of the 22nd International Conference on Distributed Computing（IEEE ICDCS'02）, Vienna,Austria, 2002
15	Crespo A , Garcia-Molina H . Semantic Overlay Networks for P2P Systems. Technical Report,University of Stanford, May 2004
16	Risson J , Moors T . Survey of research towards robust peer-to-peer networks: search methods. Computer Networks, 2006,50(17): 3485～3521
17	Huang J , Li X , Wu J . A class-based search system in unstructured P2P networks. Proceedings of the IEEE 21st International Conference on Advanced Information Networking and Applications, 2007: 76～83
18	Guo L , Jiang S , Xiao L , et al. Fast and low cost search schemes by exploiting localities in P2P networks. Parallel and Distributed Computing, 2005,65(6): 729～742
19	Text REtrieval Conference（TREC）.

参数	描述	参数值
MAX_SEM_LINKS	语义邻居的最大个数	4
REL_THRESHOLD	语义相关度门限值	0.45
SRC_THRESHOLD	资源相关度门限值	0.26
M	语义子组数	1～4
TTL	资源搜索定位查询消息的生命周期	1～4
MAX_RESPONSES	最大相关资源数	8，15，20，25

[1]	谢石木林, 白杰, 张翔, 汤泽毅, 粘为帆, 刘旭杰. 基于5G+MEC的电网边缘计算平台任务安全性调度方法[J]. 电信科学, 2022, 38(12): 78-85.
[2]	许晓荣, 朱薇薇, 包建荣, 朱卫平, 冯维, 姚英彪. IRS辅助的SWIPT系统中基于能效优先的波束成形设计与优化[J]. 电信科学, 2022, 38(1): 36-46.
[3]	洪鑫龙,许晓荣,姚英彪. 无线携能通信中一种能效优先的缓存队列机制中继选择方案[J]. 电信科学, 2018, 34(3): 67-75.
[4]	周晓勇,申滨,徐浪,黄晓舸. 基于SRS优先级划分及时移传输机制的SL空口同步方案[J]. 电信科学, 2018, 34(12): 1-9.
[5]	曹燕,金炜,符冉迪. 基于加权优先级和分类匹配的图像修复方法[J]. 电信科学, 2017, 33(4): 94-100.
[6]	马丽芳,陈伟峰,兰世战,陆松,张玉兰,莫晓斌,何昌智. 基于蚁群优化的移动P2P网络路由选择算法[J]. 电信科学, 2016, 32(7): 121-125.
[7]	任红,鲍尧. 边境地区150 MHz/400 MHz陆地移动业务频率协调方法[J]. 电信科学, 2016, 32(12): 104-108.
[8]	曲桦,赵季红,王丽霞,董士奇. 基于路径优先度的VoIP中继选择算法[J]. 电信科学, 2014, 30(5): 75-80.
[9]	孙韩林,刘建华. 一种基于P2P的统一身份服务网络模型[J]. 电信科学, 2013, 29(7): 49-53.
[10]	鲁进,黄铭,杨志军. 基于轮询调度的频谱接入机制研究[J]. 电信科学, 2013, 29(11): 60-65.
[11]	张同光,赵晓莉. P2P网络中基于语义组的自适应资源预测复制算法[J]. 电信科学, 2012, 28(3): 79-82.
[12]	王明伟,李琴,王奇,林建中. 基于分层多播的视频传输拥塞控制算法研究[J]. 电信科学, 2010, 26(5): 78-82.
[13]	武娟,龙斌,庞涛,黄海. 一种可控对等网络流媒体直播系统[J]. 电信科学, 2010, 26(1): 45-50.
[14]	周永刚,钱宗珏,寿国础,胡怡红. EPON系统中基于业务等级的动态带宽算法研究[J]. 电信科学, 2006, 22(3): 68-70.