Computer Science ›› 2015, Vol. 42 ›› Issue (5): 251-254.doi: 10.11896/j.issn.1002-137X.2015.05.050

Previous Articles     Next Articles

Research on Service Dynamic Selection Algorithm in Cloud Computing

ZHANG Heng-wei, HAN Ji-hong, KOU Guang and WEI Bo   

  • Online:2018-11-14 Published:2018-11-14

Abstract: To solve the service dynamic selection problem in cloud computing environment,a fitness function which considers both the response time and the cost was designed,and an estimation of distribution-shuffled frog leaping algorithm was proposed to solve the problem of service dynamic selection.On the basis of leapfrog algorithm,evolutionary operators of leapfrog algorithm was redefined by drawing crossover operation of genetic algorithm,and distribution estimation evolutionary strategy was introduced to improve frog update mode of the leapfrog algorithms,so that the new improved algorithm has a more comprehensive learning ability and it can effectively avoid the local optimum.Simulation results demonstrate the feasibility and effectiveness of the proposed algorithm,and compared with the leapfrog algorithm and estimation of distribution algorithms,the convergence performance and optimization capabilities of the proposed algorithm are improved,and it can better solve the service dynamic selection problem in cloud computing environment.

Key words: Cloud computing,Service dynamic selection,QoS,Evolutionary operators,Fitness function,Probabilistic model

[1] Buyya R,Yeo C S,Venugopal S,et al.Cloud computing andemerging IT platforms:vision,hype,and reality for delivering computing as the 5th utility [J].Future Generation Computer Systems,2012,25(6):599-616
[2] 罗军舟,金嘉晖,宋爱波,等.云计算:体系架构与关键技术[J].通信学报,2011,32(7):3-21
[3] Majithia S,Walker D W,Gray W A.A Framework for Automated Service Composition in Service-oriented Architectures[C]∥ESWS 2008 Congress.Berlin,Germany:Springer Verlag,2012:269-283
[4] Yu Tao,Lin K J.Service Selection Algorithms for Composing Complex Services with Multiple QoS Constraints[C]∥The 3rd International Conference on Service Oriented Computing Congress.Amsterdam,Holland:Springer Verlag,2010:130-143
[5] 董元元,倪宏,邓浩江,等.Qos全局最优的服务选择策略[J].中南大学学报:自然科学版,2013,2(10):3086-3094
[6] 刘旋,廖明潮.基于人工鱼群算法的 QoS 全局最优Web服务最优Web服务选择的研究[J].计算机应用与软件,2013,30(8):87-90
[7] 孙黎阳,林剑柠,毛少杰.基于改进粒子群优化算法的网络化仿真任务共同体服务选择[J].兵工学报,2012,33(11):1393-1403
[8] Elbeltagi E,Hegazy Grierson D.A modified shuffled frog-lea-ping optimization algorithm.Applications to project management [J].Structure and Infrastructure Engineering,2012,3(1):53-60
[9] Antariksha B.A clonal selection based shuffled frog leaping algorithm[C]∥IEEE Advance Computing Congress.New York:IEEE,2013:125-130
[10] 张恒巍,卫波.基于分布估计蛙跳算法的云资源调度方法[J].计算机应用研究,2014,31(10):30-34
[11] 罗雪晖,杨烨,李霞.改进混合蛙跳算法求解旅行商问题[J].通信学报,2013,30(7):130-135
[12] 王尚广,孙其博,杨放春.基于全局QoS约束分解的Web服务动态选择[J].软件学报,2011,18(3):646-656
[13] Xu Y,Wang L,Zhou G,et al.An effective shuffled frog leaping algorithm for solving hybrid flow-shop scheduling problem[C]∥Proceedings of the 9th International Conference on Advanced Intelligent Computing.Berlin:Springer Verlag,2013:560-567
[14] Dong W S,Yao X.Unified eigen analysis on multivariate Gaussian based estimation of distribution algorithms [J].Information Sciences,2011,178(15):3000-3023
[15] Muhlenbein H.The equation for response to selection and itsuse for prediction [J].Evolutionary Computation,2012,5(3):303-346
[16] Kastegar R.On the optimal convergence probability of univaria-te estimation of distribution algorithms [J].Evolutionary Computation,2013,19(2):225-248
[17] The Cloud Lab.Cloudsim [EB/OL].[2012-08-15].http://www.cloudbus.org/cloudsim

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!