期刊文献+

云计算环境下基于非均匀窗口蚁群行为的负载平衡算法 被引量:4

Load balancing algorithm based on non-uniform window ant colony behavior in cloud computing environment
下载PDF
导出
摘要 针对云计算环境下可能面临请求过载和较长响应时间的问题,在非均匀窗口蚁群行为思想的启发下,提出一种负载平衡算法。假设云环境下任何时候虚拟机都处于过载状态,即服务提供者不得不分配资源。根据该假设,对可利用的资源合理优化,优化过程中动态代理和静态代理同时进行,其中蚁群行为被用于负载平衡,通过加载资源到所有的虚拟机上来实现系统平衡。利用Cloud Sim仿真器模拟云计算环境进行实验分析,实验结果表明,与容错分簇的负载均衡感知(tolerant cluster-aware,TCLB)、基于博弈论的负载均衡算法(scheduling strategy on load balancing,SSLB)和基于蜜蜂行为的负载均衡算法(honey bee behavior inspired load balancing,HBB-LB)相比,提出的算法分别节省了37%,8%和4%的响应时间,最大完成时间也大幅度降低,整体性能有所提高。 In view of request overloading and high response time in cloud computing environments, inspired by the idea of the non-uniform window ant colony behavior, a new load balancing algorithm is proposed. We introduce a working hypothesis that any virtual machine is under the condition of overloading, that is, the service provider has to allocate resources.According to the assumption, the available resources are optimized, where the dynamic and static agents are processed at the same time, and the ant colony behavior is used for load balance. System balance is achieved by means of loading resources into all virtual machines. The CloudSim simulation is used to emulator cloud environment for experiment analysis.Experimental results show that compared with load balancing of fault-tolerant cluster-aware ( TCLB) , scheduling strateg}^ on load balancing( SSLB) and honey bee behavior inspired load balancing( H BB-LB) ,the responsible time of the proposed algorithm is less than that of TCLB, SSLB and HBB-LB by 37% , 8 % and 4 % respectively. And the maximum completion time is also reduced significantly with overall improved performance.
作者 张少辉 崔仲远 韩秋英 ZHANG Shaohui;CUI Zhongyuan;HAN Qiuying(College of Computer Science and Technology, Zhoukou Normal University, Zhoukou 466001, P. R. China)
出处 《重庆邮电大学学报(自然科学版)》 CSCD 北大核心 2016年第4期567-574,共8页 Journal of Chongqing University of Posts and Telecommunications(Natural Science Edition)
基金 河南省科技厅软科学研究计划项目(142400411213) 河南省高等学校重点科研项目(15A520118)~~
关键词 云计算 负载平衡 代理 蚁群行为 响应时间 最大完成时间 cloud computing load balancing agents ant colony behavior responsible tim e maximum completion time
  • 相关文献

参考文献17

二级参考文献53

  • 1Armbrust M, Fox A, Griffith R et al. A view of cloud computing. Communications of the ACM, 2010, 53(4): 50 58. 被引量:1
  • 2Patterson D, Brown A, BroadweIl P et al. Recovery oriented computing (ROC).. Motivation, definition, techniques, and case studies. Berkeley: UC Berkeley, Technical Report: UCB/CSD-02-1175 , 2002. 被引量:1
  • 3Clark C, Fraser K, Hand Set al. Live migration of virtual machines//Proceedings of the 2nd USENIX Symposium on Networked Systems Design and Implementation (NSDI'05). Boston, 2005: 273-286. 被引量:1
  • 4Zhu X, Young D, Watson B.J, Wang Z et al. 1000 lslands: An integrated approach to resource management forvirtualized data centers. Cluster Computing, 2008, 12(1): 45-57. 被引量:1
  • 5Li Bo, Li Jian Xin, Huai Jin-Peng et al. EnaCloud: An energy saving application live placement approach for cloud computing environments//Proceedings of the International Conference on Cloud Computing. Bangalore, 2009:17-24. 被引量:1
  • 6Ajiro Y, Tanaka A. Improving packing algorithms for server consolidation//Proceedings of the 33rd International Computer Measurement Group Conference. San Diego, 2007:399-406. 被引量:1
  • 7Gupta R, Bose S. K, Sundarrajan Set al. A two stage heuristic algorithm for solving server consolidation problem with item-item and bin-item incompatibility constraints//Proceedings of the 2008 IEEE International Conference on Services Computing (SCC'08). Hawaii, 2008:39-46. 被引量:1
  • 8Agrawal S, Bose S K, Sundarrajan S. Grouping genetic algorithm for solving the server consolidation with conflicts// Proceedings of the 1st ACM/SIGEVO Summit Genetic and Evolutionary Computation. New York, 2009:1-8. 被引量:1
  • 9Wood T, Sbenoy P J, Venkataramani A. Black-box and gray-box strategies for virtual machine migration//Proceedings of the 4th USENIX Symposium on Networked Systems Design and Implementation (NSDI' 07). Cambridge, MA, 2007 : 229-242. 被引量:1
  • 10Coffman J, Garey M R, Johnson D S. Approximation algorithms for bin packing: A survey. Approximation algorithms for NP-Hard problems. Boston: PWS Publishing, 1997: 46 93. 被引量:1

共引文献260

同被引文献28

引证文献4

二级引证文献49

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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