期刊文献+

具有位置感知和语义特征的P2P网络模型 被引量:1

Semantic and Location-Aware Based Unstructured P2P Network
下载PDF
导出
摘要 非结构化P2P网络中常用的泛洪搜索方法造成了严重的通信消耗.提出一种基于位置感知和语义的P2P网络模型,在覆盖网络的构建过程中考虑底层的物理网络拓扑,同时兼顾拓扑结构与共享资源之间的相关性.该网格模型基础上,给出了语义搜索算法.实验结果表明,提出的网络模型能够减少覆盖网络与底层物理网络拓扑不匹配带来的网络开销,并且在查找性能和网络开销之间取得了良好的平衡. Unstructured P2P networks are widely used and popular due to their small maintenance overhead.However these systems suffer from the significant network overhead on flooding-based search.This paper proposes a Semantic and Location-aware based Unstructured P2P network(SLUP) taking advantage of the heterogeneous characters of nodes to cluster the nodes according to similar shared resources and physical distance.SLUP can not only alleviate the topology mismatch problem between the P2P overlay networks and the physical network,but also construct the relationship between resources and topology to increase the chances of finding the matching resources.Furthermore,semantic-based search algorithm is presented.Comparing the search performance in various overlay networks,simulation experiments show that SLUP and semantic-based search algorithm can significantly shorten the latency of the searching process and reduce the searching overhead.
出处 《电子学报》 EI CAS CSCD 北大核心 2010年第11期2606-2610,共5页 Acta Electronica Sinica
基金 国防预研项目(No.104080402) 北京市重点学科建设项目 北京理工大学科研基地科技支撑计划项目
关键词 P2P 覆盖网络 位置感知 资源搜索 P2P overlay network location-aware resource search
  • 相关文献

参考文献15

  • 1Rongmei Zhang,Y Charlie Hu.Assisted peer-to-peer search with partial indexing[J].IEEE Transactions on Parallel and Distributed Systems,2007,18(8):1146-58.
  • 2CHEN S P,ZHANG Z.Efficient file search in non-DHT P2P networks[J].Computer Communications,2008,31(2):304-317.
  • 3M Ripeanu,A Iamnitchi,I Foster.Mapping the Gnutella network[J].IEEE Internet Computing,2002,6(1):50-57.
  • 4Xiaofei Liao,Hai Jin,Yunhao Liu,Ni L M,Dafu Deng.AnySee:Peer-to-peer live streaming.Proceedings of 25th IEEE INFOCOM Conference.Piscataway:IEEE,2006.2411-2420.
  • 5Christos Doulkeridis,Norvag Kjetil,Michalis Vazirgiannis.DESENT:Decentralized and distributed semantic overlay generation in P2P networks[J].IEEE Journal on Selected Areas in Communications,2007,25(1):25-34.
  • 6Iamnitchi Adriana,Ripeanu Matei,Foster Ian.Small-world file-sharing communities.Proceedings of IEEE INFOCOM 2004.Hongkong:Institute of Electrical and Electronics Engineers Inc,2004.952-963.
  • 7Hamada T,Chujo K,Chujo T,Yang X.Peer-to-peer traffic in metro networks:analysis,modeling,and policies.Proceedings of the IEEE Symposium on Network Operations and Management.Seoul:Institute of Electrical and Electronics Engineers Inc,2004.425-438.
  • 8Xu Zhichen,Tang Chunqiang,Zhang Zheng.Building topology-aware overlays using global soft-state.Proceedings of the 23rd Int’l Conf.Distributed Computing Systems (ICDCS 2003).New York:IEEE Press,2003.500-508.
  • 9雍兴辉,黄永峰.P2P流媒体系统中层次化网络拓扑推断技术的研究[J].电子学报,2010,38(1):1-5. 被引量:4
  • 10Yunhao Liu.A two-hop solution to solving topology mismatch[J].IEEE Transactions on Parallel and Distributed Systems,2008,19(11):1591-1600.

二级参考文献39

  • 1Y Vardi. Network tomography: estimating source-destination traffic intensities from link data [J]. J. Artier. Stat. Assoc., 1996,91(433) :365 - 377.
  • 2Multicast based inference of network-internal characteristics (MINC) [OL] http://gaia, cs. umass, edu/minc.
  • 3R Caceres, N Duffield, J Horowitz, and D Towsley. Multicast based inference of network-internal loss characteristics [J]. IEEE Trans. Inform. Theory, Nov. 1999,45: 2462 - 2480.
  • 4M Coates, R Nowak. Network loss inference using unicast end-to-end measurement [A]. ITC Seminar on IP Traffic, Measurement and Modeling [C]. Monterey, CA, Sep. 2000, 28:1 -9.
  • 5J Cao,S VanderWiel, B Yu, and Z Zhu.A scalable method for estimating network traffic matrices from link counts [ OL ]. http://www. stat. berkeley, edu/binyu/publ-ications, html, 2000.
  • 6R J Vanderbei, J Iannone. An EM approach to OD matrix estimarion[ R ]. Princeton University, Princeton, NJ, Tech. Pep. SOR94-04,1994.
  • 7Lopresfi F, Duffield N, Horowitz J, Towsley D. Multicast- based inference of network-internal delay distributions [ J ]. IEEE/ACM Transactions on Networldng, 2002,10( 6 ) : 761 - 775.
  • 8M F Shihand, A O Hero. Unicast inference of network link delay distributions from edge measurements[ A]. Proc. IEEE Int. Conf. Acoust., Speech, and Signal Processing [C]. Salt Lake City,UT,May 2001.3421 - 3424.
  • 9A Bestavros, K Harfoush, and J Byers. Robust identification of share losses using end-to-end unicast probes[A] .Proc.IEEE Int. Conf. Network Protocols[C]. Osaka, Japan, Nov.ZE0.22 - 33.
  • 10Y Tsang,M Coates,R Nowak. Passive unicast network tornog- raphy based on tcp monitoring[R].Rice Univ. ,Houston, TX, Tech. Rep TREE-05,2000.

共引文献7

同被引文献19

  • 1ipoqu[OL], http://www. alexa. com/siteinfo/ipoqu.com.
  • 2Kalogeraki V,Gunopulos D, Zeinalipour-Yazti D. A local search mechanism for peer-to-peer networks[C]//Proc, of the 11th ACM Conf on Information and Knowledge Management. New York: ACM Press, 2002: 300-307.
  • 3Bloom B H. Space/time trade-offs in hash coding with allowable errors[J]. Communications of the ACM, 1970, 13(7): 422-426.
  • 4Rhea S C, Kubiatowicz J. Probabilistic location and routing[C]// Proc. of the IEEE INFOCOM 2002. Washington: IEEE Computer Society, 2002 : 1248-1257.
  • 5Hebden P, Pearce A R. Data-centric routing using bloom filters in wireless sensor networks[C]//Proc, of the 4th Int'l Conf on Intelligent Sensing and Information Processing. Washington: IEEE Compu-ter Society, 2006 : 72-77.
  • 6Kumar A, Xu J, Zegura E W. Efficient and scalable query routing for unstructured peer-to-peer networks [C]//Proc. of the IEEE INFOCOM 2005. Washington: IEEE Computer Society, 2005:1162-1173.
  • 7Tsoumakos D, Roussopoulos N. Adaptive probabilistic search for peer-to-peer networks[C]//Proc, of the Third International Conference on Peer-to-Peer Computing. Sweden: IEEE Computer Society, 2003 : 102 109.
  • 8Shavitt Y, Tankel T. Big-bang simulation for embedding net work distances in Euclidean space[J]. IEEE/ACM Transactions on Networking (TON), 2004,12(6) : 993-1006.
  • 9Zaharia M A, Chandel A, Saroiu S. Finding content in file-sharing networks when you can't even spell[OL], http://research, microsoft, com/workshops/PTPS2007/paper/Zaharia-ChandelSaroiuKeshav. pdf, 2007.
  • 10Gaeta R, Sereno M. Generalized Probabilistic Flooding in Unstructured Peer-to-Peer Networks[J]. IEEE Transactions on Parallel and Distributed Systems, 2011,22(12): 1-8.

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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