期刊文献+

无结构P2P网络中的混合式搜索方法 被引量:2

Hybrid Search Method in Unstructured P2P Networks
下载PDF
导出
摘要 针对轻洪泛冗余查询消息数多、对稀有资源搜索延迟大的问题,提出一种结合无结构P2P搜索技术和双向Chord环的混合式搜索方法。该方法利用节点的异构性,在k-walker随机走的基础上,根据邻居节点的查询能力,对查询请求的转发方式进行改进,在双向Chord环中对无结构P2P未搜索到的资源进行结构化P2P搜索。仿真结果证明,与轻洪泛相比,混合式搜索方法的冗余查询消息数较少,对稀有资源的搜索延迟较小。 Aiming at the problems of redundant query messages and long search delay on rare resources in LightFlooding,this paper proposes a hybrid search method which combines unstructured P2P search with bidirectional Chord ring.Based on the k-walker random walk,it utilizes the node heterogeneity to modify the query request-forward manner by considering the ability of neighbor nodes.Resources that can not be found by unstructured P2P search are searched along bidirectional Chord ring.Simulation results show that the method has better performance on redundant query messages and search delay on rare resources compared to LightFlooding.
作者 王双 禹继国
出处 《计算机工程》 CAS CSCD 北大核心 2011年第7期109-111,共3页 Computer Engineering
基金 国家自然科学基金资助项目(60373012) 山东省自然科学基金资助项目(ZR2009GM009 ZR2009AM013) 山东省高校科技计划基金资助项目(J10LG09)
关键词 P2P网络 混合式搜索 种子节点 双向Chord环 超节点 P2P networks hybrid search seed node bidirectional Chord ring super peer
  • 相关文献

参考文献6

  • 1Yang B,Hector G M.Improving Search in Peer-to-Peer Net-works[C]//Proc.of the 22nd IEEE International Conference on Distributed Computing Systems.[S.l.]:IEEE Press,2002.
  • 2Lv Qin,Cao Pei,Cohen E,et al.Search and Replication in Unstructured Peer-to-Peer Networks[C]//Proc.of the 16th International Conference on Supercomputing.New York,USA:ACM Press,2002:84-95.
  • 3庞庆元,林亚平.在非结构化P2P网络中的搜索算法研究[J].计算机工程与设计,2006,27(21):4049-4051. 被引量:7
  • 4Song Jiang,Lei Guo,Zhang Xiaodong.LightFlooding:Minimizing Redundant Message 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].计算机工程,2009,35(11):95-97. 被引量:6
  • 6Liang Jian,Kumar R,Ross K W.The KaZaA Overlay:A Measurement StudyfJ].Computer Networks,2005,50(6):842-858.

二级参考文献16

  • 1董健全,武雪丽,李智昕.P2P网络中应用移动Agent进行资源搜索的研究[J].计算机工程与设计,2005,26(1):27-30. 被引量:11
  • 2Marti S, Garcia-Molina H. Limited Reputation Sharing in P2P Systems[C]//Proc. of the 5th ACM Conference on Electronic Commerce. New York, USA:[s. n.], 1994.
  • 3Seleuk A A, Uzun E, Pariente M R. A Reputation-based Trust Management System for P2P Networks[C]//Proc. of IEEE International Symposium on Cluster Computing and the Grid. New York, USA: [s. n.], 2004.
  • 4Guo Leitao, Yang Shoubao, Wang Jing. Trust Model Based on Similarity Measure of Vectors in P2P Networks[C]//Proc. of the 4th International Conf. on Grid and Cooperative Computing. Beijing, China: Is. n.], 2005.
  • 5Xue Guangtao, You Jinyuan, Jia Zhaoqing. An Interest Group Model for Content Location in Peer-to-Peer Systems[C]//Proc. of CEC- East'04. [S. l.]: IEEE Computer Society Press, 2004.
  • 6Stefan Saroiu,Krishna P Gummadi.An analysis of Internet content delivery systems[C].Proceeding of the 5th Symp on Operaing Systems Design and Implementation,2002.86-90.
  • 7Dimitrios Tsoumakos,Nick Roussopoulos.A comparison of peer-to-peer search methods[C].International Workshop on the Web and Databases,2003.
  • 8罗杰文.peer-to-peer计算综述[M].北京:中科院计算技术研究所,2005.
  • 9Yang B,Garcia-Molina H.Designing a super-peer network[C].Proc of the 19th International Conf on Data Engi-neering,2003.
  • 10Kalogeraki V,Gunopulos D,ZeinalIDour-Yazti D.A local search mechanism for peer-to-peer networks[C].CIKM,2002.

共引文献11

同被引文献24

  • 1张宏科,苏伟.新网络体系基础研究——一体化网络与普适服务[J].电子学报,2007,35(4):593-598. 被引量:126
  • 2董平,秦雅娟,张宏科.支持普适服务的一体化网络研究[J].电子学报,2007,35(4):599-606. 被引量:59
  • 3Mathy L, Lancaster U, Iannone L, et al. LISP-DHT: Towards a DHT to Map Identifiers onto Locators[EB/OL]. (2008-05-12). http://inl.info.ucl.ac.be/system/files/draft-mathy-lisp-dht-00.txt.
  • 4Luo Hongbin, Qin Yajuan. A DHT-based Identifier-to-locator Mapping Approach for a Scalable Internet[J]. IEEE Trans. on Parallel and Distributed Systems, 2009, 20(12): 1790-1802.
  • 5Zhang Jianwei, Zhan Xiaosu, Zou Dongyao. A Network Locality Aware Algorithm Based on Identity Mapping[C] //Proc. of the 2nd International Conference on Signal Processing Systems. Dalian, China: [s. n.] , 2010.
  • 6Dorigo M, Gambardella L M. Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem[J]. IEEE Trans. on Evolutionary Computation, 1997, 1(1): 53-66.
  • 7Wu Weiyu, Chen Yang, Zhang Xinyi, et al. LDHT: Locality-aware Distributed Hash Tables[C] //Proc. of the International Conference on Information Networking. Busan, Korea: [s. n.] , 2008.
  • 8Dabek F, Li J, Sit E, et al. Designing a DHT for Low Latency and High Throughput[C] //Proc. of the 1st Symposium on Networked System Design and Implementation. [S. l.] : IEEE Press, 2004: 85-98.
  • 9Feng Hong, Li Minglu. PChord: Improvement on Chord to Ach- ieve Better Routing Efficiency by Exploiting Proximity[C] //Proc. of International Conference on Distributed Computing Systems Workshops. [S. l.] : IEEE Press, 2005: 806-811.
  • 10Xiong Jiping, Zhang Youwei, Hong P, et al. Chord6: IPv6 Based Topology-aware Chord[C] //Proc. of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services. Papeete, Tahiti: [s. n.] , 2005: 19-23.

引证文献2

二级引证文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部