期刊文献+

基于复杂云资源查询的HChord索引机制

HChord index mechanism based on query of complex cloud resources
下载PDF
导出
摘要 为了研究复杂云资源在巨大资源池中快速定位和查找问题,结合分布式对等技术资源定位的优势,提出分层的HChord云对等模型,通过提取云资源多维属性特征向量构建资源查询索引和相似资源聚类,建立全局与局部索引及缓存机制,并独到地提出依赖备份超级节点数来控制索引缓存率的方法。仿真实验表明,HChord模型比HTC-Chord模型在资源定位时需要更短的平均路径长度;验证HChord模型下不同索引缓存率对资源定位路径不同的有利影响。结果表明,分层HChord模型下构建的资源聚类和索引缓存机制,以牺牲少数节点维护开销能使资源在非常有效的路径范围内被定位。 In order to research the problem how to locate and find the complex cloud resources in a huge resource pool quickly,considering distributed peer-to-peer technology’s advantages locating resources rapidly,this paper established a layered HChord equivalent model of cloud,by extracting cloud resources multidimensional attributes vector,it built resource’s searching index and clustered the similar cloud resources to build the global indexes and local indexes and caching-mechanism. At the same time,it put forward the special method controlling the index buffer rate relying on candidate super nodes’ number.The simulation experiments show that HChord model needed the shorter average path length than HTC-Chord when locating resources,and it also verified the HChord’s index-caching rate brought beneficial effects to resource location path. Results show that the HChord model building the index of resource clustering and caching mechanism,can make resources be located within a very effective path by sacrificing a few nodes’ routing overhead.
出处 《计算机应用研究》 CSCD 北大核心 2014年第12期3818-3821,共4页 Application Research of Computers
基金 国家自然科学基金资助项目(61170277) 上海市教委科研创新重点项目(12zz137) 上海市一流学科建设项目(S1201YLXK) 上海市研究生创新基金项目(JWCXSL1202)
关键词 资源定位 云对等模型 索引缓存 resource location cloud peer-to-peer model index caching
  • 相关文献

参考文献18

  • 1ZHAO Peng,HUANG Ting-lei, LIU Cai-xia, et al. Research of P2P architecture based on cloud computing [ C]//Proc of Intelligent Com- puting and Integrated Systems. 2010: 652-655.
  • 2HUANG Li-can. Semantic P2P networks : future architecture of cloud computing [ C]//Porc of the 2nd International Conference on Networ- king and Distributed Computing. 2011:336-339.
  • 3HIDALGO N, ROSES E, ARANTES L,et al. Optimized range que- ries for large scale networks[ C ]//Proc of the 26th IEEE International Conference on Advanced Information Networking and applications. 2012:438-445.
  • 4李璞,陈世平,李剑锋.一种基于对等网络的云资源定位算法[J].计算机应用研究,2013,30(2):570-573. 被引量:11
  • 5TANG Yu-zhe, XU Jian-liang, ZHOU Shui-geng, et al. A light- weight multidimensional index for complex queries over DHTs [ J ]. IEEE Trans on Parallel and Distributed Systems, 2011, 22 (12) : 2046-2054.
  • 6STOICA I, MORRIS R, KARGER D,et al. Chord: a scalable peer- to-peer lookup service for Internet applications [ J ]. IEEE/ACM Trans on Networking, 2003, 11 ( 1 ) : 17-32.
  • 7ROWSTRON A, DRUSCHEL P. Pastry: scalable distributed object location and routing for large scale peer-to-peer systems [ C ]//Proc of ACM International Conference on Distributed Systems. 2001: 329- 350.
  • 8RATNASAMY S,FRANCIS P,HANDLEY M,et al. A scalable con- tent-addressable network[ J ]. ACM SIGCOMM Computer Commu- nication Review,2001,31 (4) : 161-172.
  • 9GUPTA I, BIRMAN K, LNGA P. Kelips: building an efficient and stable P2P DHT through increased memory and background overhead [ C ]//Proc of the 2rid International Workshop on Peer-to-Peer Sys- tem. 2003 : 160-169.
  • 10GUPTA A, LISKOV B, RODRIGUSE R. One-hop lookups for peer-to peer overlays [ C ]//Proc of the 1 st Symposium on Networked Systems Design and Implementation. 2004 : 113-126.

二级参考文献56

  • 1段世惠,王劲林.基于有限范围组播的Chord路由算法[J].计算机应用,2009,29(2):514-517. 被引量:6
  • 2张震,王晓明.对等网中Chord资源查找算法研究[J].计算机工程与应用,2006,42(11):147-152. 被引量:16
  • 3Doudane S, Agoulmine N. Enhancing the P2P protocols to support advanced multi-keyword queries [J].Lecture Notes in Computer Science, 2006,3976: 630-641.
  • 4Shen D R,Shao Y C,Nie T Z,et al. HilbertChord:a P2P framework for service resources management [J]. Lecture Notes in Computer Science, 2008,5036 : 331-342.
  • 5Shu Y, Ooi C B, Tan K. Supporting multi-dimensional range queries in peer-to-peer systems[C]//Proc, of the 5th IEEE International Conference on Peer-to Peer Computing. Washington, 2005 : 173-180.
  • 6Cai M, Frank M, Chen J, et al. MAAN: a multi-attribute addressable network for grid information servies [J]. Journal of Grid Computing, 2004,2 (1) : 3-14.
  • 7Matteo V, Christophe D, Ernst B. A Walkable Kademlia Network for Virtual Worlds[C]//Proc. of the 28^th IEEE International Conference on Computer Communications Workshops. Piscataway, 2009.
  • 8Tang Y Z,Xu J L, Zhou S G, et al. m-LIGHT: Indexing Multi- dimensional Data over DHTs[C]ffProe. of the 29^th IEEE International Conference on Distributed Computing Systems. Montreal, 2009 : 191-198.
  • 9Schutt T, Schintke F, Reinefeld A. Range queries on structured overlay networks [J]. Computer Communications, 2008,31: 280-291.
  • 10Zhou M Q, Zhang R, Qian Q N, et al. Gchord: indexing for multi- attribute query in P2P system with low maintenance cost [J]. Lecture Notes in Computer Science, 2010,4443 : 55-66.

共引文献28

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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