| 注册
首页|期刊导航|计算机与数字工程|一种基于改进最大最小蚁群算法的虚拟机放置策略∗

一种基于改进最大最小蚁群算法的虚拟机放置策略∗

刘晋西

计算机与数字工程Issue(9):2262-2264,2294,4.
计算机与数字工程Issue(9):2262-2264,2294,4.DOI:10.3969/j.issn.1672-9722.2019.09.030

一种基于改进最大最小蚁群算法的虚拟机放置策略∗

A Virtual Machine Placement Strategy Based on Improved Max-min Ant Colony Algorithm

刘晋西1

作者信息

  • 1. 武汉数字工程研究所 武汉 430074
  • 折叠

摘要

Abstract

Cloud computing is a business model to distribute scalable virtualized resources to users by using the network. The data center,made up by the physics server,plays an important role in cloud computing,because those virtual resources are provid?ed by the physics server. With the expansion of the data center,the cost of energy and the waste of resources become more and more neglected. In this paper,an improved max-min ant colony algorithm is applied to the initialization placement of virtual machines. The cost of physical resources and network resources are minimized while satisfying customer service quality.

关键词

云计算/最大最小蚁群算法/数据中心

Key words

cloud computing/max-min ant colony algorithm/data center

分类

信息技术与安全科学

引用本文复制引用

刘晋西..一种基于改进最大最小蚁群算法的虚拟机放置策略∗[J].计算机与数字工程,2019,(9):2262-2264,2294,4.

计算机与数字工程

OACSTPCD

1672-9722

访问量0
|
下载量0
段落导航相关论文