返回
Modified Dragonfly Algorithm for Optimal Virtual Machine Placement in Cloud Computing
DOI:10.1007/s10922-020-09538-9.png)
摘要
En 中文
The ease and affordability offered by the cloud computing has attracted large number of customers towards it. Cloud service providers offer its services, to the cloud customers, usually in form of Virtual Machines (VMs). With the growth in the number of customers, cloud data centers encounter overwhelming number of VM requests. These requests need to be mapped on the real cloud hardware and therefore, VM placement has been an important research area in the cloud research community. Virtual machine placement, being an NP hard problem, is modelled as an optimization problem with the objective to optimize resource wastage. Dragonfly Algorithm (DA), a nature inspired technique, originates from static and dynamic swarming behavior of dragonfly and is well suited to solve VM placement problem. Therefore, in the proposed work, a modified dragonfly algorithm is applied for VM placement for better resource utilization at cloud data centers. The performance of the proposed model is analyzed through simulation and comparative study. Observations, obtained from the experiments, exhibit the superiority of the proposed model in solving VM placement problem.
Keyword:
Binary dragonfly algorithm (BDA)
Virtual machine (VM)
Cloud data center (CDC)
Cloud service provider (CSP)
NP-hard problem
Resource utilization
Information technology (IT)
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.9
论文数:
1.0K
被引数:
1.3K
机构
引用论文
Binary dragonfly optimization for feature selection using time-varying transfer functions使用时变传递函数进行特征选择的二进制蜻蜓优化

