期刊文献+

基于结构化对等网络的云资源查询算法 被引量:1

Cloud resources search algorithm based on structured peer-to-peer network
下载PDF
导出
摘要 为实现云计算中云资源的快速查询,针对资源查找过程中查询效率较低以及网络维护成本较高等问题,提出一种基于结构化对等网络的云资源查询算法,实现对待查询云资源进行快速有效定位。首先设计一种新型超级节点拓扑结构,对网络拓扑中各节点进行唯一性编码,构造二元组路由信息索引列表,并设计相应的路由算法;然后给出了分层象限超级节点算法的查询效率与稳定性分析。仿真实验结果表明,分层象限超级节点算法查询效率较高,且随着网络规模增加,查询路径长度趋于稳定,同时对于超级节点失效带来的网络维护成本较低。 With the problems as the low query efficiency in the process of resource searching and the high network maintenance cost,in order to achieve the fast query of cloud resources in cloud computing, this paper presented a cloud resources search algorithm based on structured peer-to-peer networks to achieve the fast query of cloud resources in cloud computing for fast and efficient positioning for query cloud resources. Firstly, it designed a new kind of super-peer topology and routing algorithm based on hierarchy, and encoded each node in the network topology uniquely. It constructed bivariate set of routing information indexing list ,and designed the corresponding routing algorithm. Then gave the query efficiency and stability analysis of this algorithm. The simulation results show that the presented algorithm has the higher efficiency, and with the increase of network scale, the query path length tends to be stable, and for the super node failure brought by network maintenance cost is low.
出处 《计算机应用研究》 CSCD 北大核心 2015年第2期532-535,共4页 Application Research of Computers
基金 国家自然科学基金资助项目(61202376 61170277) 上海市教委科研创新重点项目(12zz137)
关键词 云计算 云资源 对等网络 超级节点拓扑 资源搜索 cloud computing cloud resources peer-to-peer network super-peer topology resources searching
  • 相关文献

参考文献6

二级参考文献54

  • 1陈贵海,须成忠,沈海英,叶懋,刘之育.一种新的常数度数的P2P覆盖网络[J].计算机学报,2005,28(7):1084-1095. 被引量:16
  • 2夏启志,谢高岗,闵应骅,李忠诚.IS-P2P:一种基于索引的结构化P2P网络模型[J].计算机学报,2006,29(4):602-610. 被引量:39
  • 3张浩,金海,聂江武,徐婕,章勤.Dual-Chord:一种更加有效的分布式哈希表[J].小型微型计算机系统,2006,27(8):1450-1454. 被引量:9
  • 4李运娣,冯勇.基于DHT的P2P搜索定位技术研究[J].计算机应用研究,2006,23(10):226-228. 被引量:19
  • 5The Gnutella Protocol Specification v0. 4[EB/OL]. http:// www9. limewire. tom/developer/gnutella_protocol_0. 4. pdf.
  • 6Kalogeraki V,Gunopulos D, Zeinalipour-Yazti D. A local search mechanism for peer-to-peer networks[C]//The ACM 11th Int'l Conf. Information and Knowledge Management ( CIKM'02 ). Virginia, USA, 2002 : 300-307.
  • 7Gkantsidis C,Mihail M, Saberi A. Random walks in peer-to-peer networks[C]//Proceedings of the IEEE INFOCOM 2004. New York: IEEE Press, 2004 : 120-130.
  • 8Yang B,Garcia Molina H. Improving search in peer-to-peer networks[C]//Rodrigues L E T,Raynal M,Chen W S E,eds. Proceedings of the 22nd Int'l Conf. on Distributed Computing Systems. Washington: IEEE Computer Society, 2002.
  • 9Crespo A, Garcia-Molina H. Routing indices for peer - to - peer systems[R]. Computer Science Department, Stanford University,2002.
  • 10Tsoumakos D, Roussopoulos N. Adaptive probabilistie search (APS) for peer-to-peer networks[R]. CS-TR-4451. 2003.

共引文献230

同被引文献12

  • 1Bharambe A R, Agrawal M, Seshan S. Mercury:supporting scalable multi - attribute range queries [ C ]. Portland, OR: ACM/SIGCOMM 2004 Conference on Computer Communi- cations,2004.
  • 2YoufuY U, LAI Huanchou. A semi - strucured overlay for multi- attribute range queries in cloud computing [ C]. Hong Kong, China: IEEE 13th International Conference on Computational Science and Engineering ( CSE 2010) ,2010.
  • 3LAI Kuanchou, YU Youfu. A scalable multi - attribute hybrid overlay for range queries on the cloud. [J]. Information Sys- tem Fontier,2012(14) :895 -908.
  • 4Papadakis H, Trunfio P,Talia D, et al. Design and implemen- tation of a hybrid p2p - based grid resource discovery system [ C ]. Heraklion, Greece: Joint Workshop on Making Grids Works, 2007.
  • 5Yang Min, Yang Yuanyuan. An efficient hybrid peer - to - peer system for distributed data sharing [ J ]. IEEE Transac- tions on Computers,2010,59 (9) : 1158 - 1171.
  • 6Schmidt C, Parashar M. Flexible information discovery in de- centralized distributed systems [ C ]. Seattle, WA: 12th IEEE International Symposium on High - Performance Distributed Computing, 2003.
  • 7Memon F, Tiebler D, Tomsu M, et al. OID : Optimized infor- mation discovery using space filling curves in P2P overlay networks [ C ]. Melbourne, Australia: 14th International Con- ference on Parallel and Distributed Systems,2008.
  • 8Lawder J K, King Pjh. Using space - filling curves for multi - dimensional indexing [ C]. Exter, England: 17th British National Conference on Databases (BNCOD 17) ,2000.
  • 9Klemn A, Lindemann C, Vernon K, et al. Characterizing the query behavior in peer - to - peer file sharing systems [ C ]. New York: the 4th ACM SIGCOMM Conference on Internet Measurement, 2004.
  • 10Moon B, Jagadish H V, Faloutsos C, et al. Analysis of the- clustering properties of the hilbert space - filling curve [ J ]. IEEE Transactions on Knowledge and Data Engineering, 2001,13( 1 ) :124 - 141.

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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