期刊文献+

基于SkipNet支持多属性范围查询的云资源共享设计 被引量:1

Cloud resource sharing design supporting multi-attribute range query based on SkipNet
下载PDF
导出
摘要 在云资源共享服务模式中,针对云资源多属性范围查询的问题,提出一种改进的E-SkipNet网络。首先,E-SkipNet在传统分布式哈希表(DHT)网络SkipNet的基础上将数据属性引入到节点Name ID的设置中,将物理节点加入到单个属性域中,以支持多属性范围查询;其次,在原E-SkipNet网络的基础上,将物理节点同时映射成多个逻辑节点;同时加入多个属性域,并将资源按照不同的属性发布到不同逻辑节点上;最后,采用均匀位置保留哈希函数对资源进行映射存储,从而在各个属性域中保留属性值的顺序关系,从而支持范围查询。仿真结果表明,改进后的E-SkipNet网络与改进前的E-SkipNet和多属性可寻址网络(MAAN)相比,在路由效率方面分别提高了18.09%和20.47%。结果表明,改进后的E-SkipNet网络能支持更加高效的云资源多属性范围查询,在异构环境中能较好地实现负载均衡。 In cloud resource sharing service model, in order to realize the multi-attribute range query of cloud resources,an improved E-SkipNet network was proposed. Firstly, based on the traditional Distributed Hash Table( DHT) network SkipNet, data attributes were added to the setting of Name ID and physical nodes were added to single attribute domain to support multi-attribute range queries in E-SkipNet. Secondly, on the basis of the original E-SkipNet network, the physical nodes were simultaneously mapped into multiple logical nodes and added to multiple attribute domains, and the resources were released in accordance with different attributes to different logical nodes in the improved E-SkipNet. Finally, the resources were mapped to logical nodes utilizing uniform locality preserving hashing function, which was the key to support efficient range query. The simulation results show that the routing efficiency of improved E-SkipNet network was respectively increased by 18. 09% and 20. 47% compared with E-SkipNet and Multi-Attribute Addressable Network( MAAN). The results show that the improved E-SkipNet can support more efficient cloud resource multi-attribute range queries and achieve load balancing in heterogeneous environment.
出处 《计算机应用》 CSCD 北大核心 2016年第1期72-76,共5页 journal of Computer Applications
基金 国家自然科学基金资助项目(61170277 61472256) 上海市教委科研创新重点项目(12zz137) 上海市一流学科建设项目(S1201YLXK) 沪江基金资助项目(A14006)~~
关键词 E-SkipNet 云资源共享 多属性 区间查询 属性域 均匀位置保留哈希函数 E-SkipNet cloud resource sharing multi-attribute range query attribute domain uniform locality preserving hashing function
  • 相关文献

参考文献17

  • 1HUANG L. Semantic P2P networks: future architecture of cloud computing [C]// Proceedings of the 2nd International Conference on Networking and Distributed Computing. Washington, D.C.: IEEE Computer Society, 2011: 336-339.
  • 2YU Y F, LAI K C. A semi-structured overlay for multi-attribute range queries in cloud computing [C]// Proceedings of the 13th IEEE International Conference on Computational Science and Engineering. Piscataway, NJ: IEEE, 2010: 88-95.
  • 3TANG Y, XU J, SHOU S, et al. A lightweight multidimensional index for complex queries over DHTs [J]. IEEE transactions on parallel and distributed systems, 2011, 22(12): 2046-2054.
  • 4HARVEY N, JONES M B, SAROIU S, et al. SkipNet: a scalable overlay network with practical locality properties [C]// Proceedings of the 4th USENIX Symposium on Internet Technologies and Systems. Berkeley, CA: USENIX Association, 2003: 184-188.
  • 5方启明,杨广文.E-SkipNet:一种支持多属性范围查询的DHT网络[J].小型微型计算机系统,2014,35(10):2308-2312. 被引量:2
  • 6CAI M, FRANK M, CHEN J, et al. MAAN: a multi-attribute addressable network for grid information services [C]// Proceedings of the 4th International Workshop on Grid Computing. Piscataway, NJ: IEEE, 2003: 184-191.
  • 7BHARAMBE A R, AGRAWAL M, SESHAN S. Mercury: supporting scalable multi-attribute range queries [C]// Proceedings of the 2004 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications. New York: ACM, 2004: 353-366.
  • 8余星,胡德敏.基于P2P网络的云资源多维查询算法[J].计算机应用研究,2014,31(10):3061-3064. 被引量:4
  • 9TRANA D A, NGUYENB T. Hierarchical multidimensional search in peer-to-peer networks [J]. Computer communications, 2008, 31(2): 346-357.
  • 10邵一川,申德荣,赵宏伟.HilbertChord: A P2P Framework for Service Resources Management[J].微计算机信息,2009,25(15):105-106. 被引量:3

二级参考文献84

  • 1段世惠,王劲林.基于有限范围组播的Chord路由算法[J].计算机应用,2009,29(2):514-517. 被引量:6
  • 2徐林昊,钱卫宁,周傲英.非结构化对等计算系统中多维范围搜索[J].软件学报,2007,18(6):1443-1455. 被引量:3
  • 3侯祥松,曹元大.一种支持结构化P2P的多维范围查找方法[J].北京理工大学学报,2007,27(6):517-520. 被引量:3
  • 4Ratnasamy S, Francis P, Handley M, et al. A scalable eontent-addressable network [C]//Proc of ACM Annual Conf of the Special Interest Group on Data Communication. New York: ACM, 2001:161-172
  • 5Bentley J L. Multidimensional binary search trees used for associative searching [J]. Communications of the ACM, 1975, 18(9): 509-517
  • 6Hinrichs K, Nievergelt J. The grid file: A data structure designed to support proximity queries on spatial objects [C] //Proc of the Int Workshop on Graphtheoretic Concepts in Computer Science. New York: ACM, 1983:100-113
  • 7Tang Chunqiang, Xu Zhichen, Dwarkadas S. Peer-to-peer information retrieval using self-organizing semantic overlay networks [C] //Proc of the ACM SIGCOMM 2003, New York: ACM, 2003:175-186
  • 8Andrzejak A, Xu Zhichen. Scalable, efficient range queries for grid information services [C] //Proc of IEEE P2P. Piscataway, NJ : IEEE, 2002 : 33-40
  • 9Sahin O D, Gupta A, Agrawal D, et al. A peer-to-peer framework for caching range queries [C] //Proc of ICDE. Piscataway, NJ: IEEE, 2004:165-176
  • 10Shu Yanfeng, Tan Klan-Lee, Zhou Aoying. Adapting the content native space for load balanced indexing [G] //LNCS 3367 : Proc of DBISP2P. Berlin:Springer, 2004 : 122-135

共引文献23

同被引文献9

引证文献1

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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