云计算中支持SLA的低成本虚拟机布局

Jiangtao Zhang, Zhixiang He, Hejiao Huang, Xuan Wang, Chonglin Gu, Lingmin Zhang
{"title":"云计算中支持SLA的低成本虚拟机布局","authors":"Jiangtao Zhang, Zhixiang He, Hejiao Huang, Xuan Wang, Chonglin Gu, Lingmin Zhang","doi":"10.1109/PCCC.2014.7017101","DOIUrl":null,"url":null,"abstract":"Servers and network contribute about 60% to the total cost of data center in cloud computing. How to efficiently place virtual machines so that the cost can be saved as much as possible, while guaranteeing the quality of service plays a critical role in enhancing the competitiveness of service cloud provider. Considering the heterogeneous servers and the random property of multiple resources requirements of virtual machines, the problem is formulated as a multi-objective nonlinear programming in this paper. Virtual machine cluster with higher traffic is made staying together. This reduces the communication delay while saving the inter-server bandwidth consumption, especially the relatively scarce higher level bandwidth, by exploiting the topology information of data center. At the same time, statistic multiplex and newly defined “similarity” techniques are leveraged to consolidate virtual machines. The violation of resource capacity is kept at any designated minimal probability. Thus the quality of service will not be deteriorated while saving servers and network cost. An offline and an online algorithms are proposed to address this problem. Experiments compared with several baseline algorithms show the validity of the new algorithms: more cost is cut down at less computation effort.","PeriodicalId":105442,"journal":{"name":"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)","volume":"248 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"21","resultStr":"{\"title\":\"SLA aware cost efficient virtual machines placement in cloud computing\",\"authors\":\"Jiangtao Zhang, Zhixiang He, Hejiao Huang, Xuan Wang, Chonglin Gu, Lingmin Zhang\",\"doi\":\"10.1109/PCCC.2014.7017101\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Servers and network contribute about 60% to the total cost of data center in cloud computing. How to efficiently place virtual machines so that the cost can be saved as much as possible, while guaranteeing the quality of service plays a critical role in enhancing the competitiveness of service cloud provider. Considering the heterogeneous servers and the random property of multiple resources requirements of virtual machines, the problem is formulated as a multi-objective nonlinear programming in this paper. Virtual machine cluster with higher traffic is made staying together. This reduces the communication delay while saving the inter-server bandwidth consumption, especially the relatively scarce higher level bandwidth, by exploiting the topology information of data center. At the same time, statistic multiplex and newly defined “similarity” techniques are leveraged to consolidate virtual machines. The violation of resource capacity is kept at any designated minimal probability. Thus the quality of service will not be deteriorated while saving servers and network cost. An offline and an online algorithms are proposed to address this problem. Experiments compared with several baseline algorithms show the validity of the new algorithms: more cost is cut down at less computation effort.\",\"PeriodicalId\":105442,\"journal\":{\"name\":\"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)\",\"volume\":\"248 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"21\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PCCC.2014.7017101\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PCCC.2014.7017101","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 21

摘要

在云计算中,服务器和网络成本约占数据中心总成本的60%。如何高效地放置虚拟机,在保证服务质量的同时,尽可能地节省成本,对于提升服务云提供商的竞争力具有至关重要的作用。考虑到服务器的异构性和虚拟机多资源需求的随机性,本文将该问题表述为多目标非线性规划问题。使高流量的虚拟机集群保持在一起。利用数据中心的拓扑信息,在减少通信延迟的同时,节省了服务器间带宽的消耗,特别是相对稀缺的高层带宽。同时,利用统计复用和新定义的“相似性”技术来整合虚拟机。对资源容量的违反被保持在任何指定的最小概率。这样既不会降低服务质量,又节省了服务器和网络成本。提出了一种离线算法和一种在线算法来解决这一问题。通过与几种基准算法的对比实验,证明了新算法的有效性:以更少的计算量降低了成本。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
SLA aware cost efficient virtual machines placement in cloud computing
Servers and network contribute about 60% to the total cost of data center in cloud computing. How to efficiently place virtual machines so that the cost can be saved as much as possible, while guaranteeing the quality of service plays a critical role in enhancing the competitiveness of service cloud provider. Considering the heterogeneous servers and the random property of multiple resources requirements of virtual machines, the problem is formulated as a multi-objective nonlinear programming in this paper. Virtual machine cluster with higher traffic is made staying together. This reduces the communication delay while saving the inter-server bandwidth consumption, especially the relatively scarce higher level bandwidth, by exploiting the topology information of data center. At the same time, statistic multiplex and newly defined “similarity” techniques are leveraged to consolidate virtual machines. The violation of resource capacity is kept at any designated minimal probability. Thus the quality of service will not be deteriorated while saving servers and network cost. An offline and an online algorithms are proposed to address this problem. Experiments compared with several baseline algorithms show the validity of the new algorithms: more cost is cut down at less computation effort.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信