VRMap:地理分布式基础设施上虚拟数据中心的成本和时间意识重映射

Anurag Satpathy, M. N. Sahoo, Lipsa Chottray, B. Majhi, Ashutosh Mishra, Sambit Bakshi
{"title":"VRMap:地理分布式基础设施上虚拟数据中心的成本和时间意识重映射","authors":"Anurag Satpathy, M. N. Sahoo, Lipsa Chottray, B. Majhi, Ashutosh Mishra, Sambit Bakshi","doi":"10.1109/COMSNETS48256.2020.9027406","DOIUrl":null,"url":null,"abstract":"A virtual data center (VDC) comprises multiple correlated virtual machines (VMs) with communication dependencies. Provisioning VDC requests across Geo-distributed data centres (DCs) offer benefits to service providers (SPs) in the form of improved revenue, enhanced performance and increased survivability. On the way to achieve such salient objectives, SPs often face the concomitant challenge of dynamic reconfiguration/remapping of multiple VDCs. Remapping VDCs introduces two arduous challenges: (A.) finding a minimum cost remap for VMs' and virtual links (VLs), (b.) migrating VMs image and memory contents across DC networks with minimum overheads and service disruption. In this paper, we propose a model called VRMap that finds an optimal remapping plan that aims to balance the remapping cost and migration overheads without compromising the service quality. VRMap makes use of genetic-metaheuristic to achieve the optimal solution. The performance of VRMap is compared with greedy and random heuristics. Simulation results show that VRMap achieves comparable performance with regards to remapping cost but attains significant gain in terms of miaration time and downtime.","PeriodicalId":265871,"journal":{"name":"2020 International Conference on COMmunication Systems & NETworkS (COMSNETS)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"VRMap: A Cost and Time Aware Remapping of Virtual Data Centres Over a Geo-distributed Infrastructure\",\"authors\":\"Anurag Satpathy, M. N. Sahoo, Lipsa Chottray, B. Majhi, Ashutosh Mishra, Sambit Bakshi\",\"doi\":\"10.1109/COMSNETS48256.2020.9027406\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A virtual data center (VDC) comprises multiple correlated virtual machines (VMs) with communication dependencies. Provisioning VDC requests across Geo-distributed data centres (DCs) offer benefits to service providers (SPs) in the form of improved revenue, enhanced performance and increased survivability. On the way to achieve such salient objectives, SPs often face the concomitant challenge of dynamic reconfiguration/remapping of multiple VDCs. Remapping VDCs introduces two arduous challenges: (A.) finding a minimum cost remap for VMs' and virtual links (VLs), (b.) migrating VMs image and memory contents across DC networks with minimum overheads and service disruption. In this paper, we propose a model called VRMap that finds an optimal remapping plan that aims to balance the remapping cost and migration overheads without compromising the service quality. VRMap makes use of genetic-metaheuristic to achieve the optimal solution. The performance of VRMap is compared with greedy and random heuristics. Simulation results show that VRMap achieves comparable performance with regards to remapping cost but attains significant gain in terms of miaration time and downtime.\",\"PeriodicalId\":265871,\"journal\":{\"name\":\"2020 International Conference on COMmunication Systems & NETworkS (COMSNETS)\",\"volume\":\"54 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 International Conference on COMmunication Systems & NETworkS (COMSNETS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/COMSNETS48256.2020.9027406\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 International Conference on COMmunication Systems & NETworkS (COMSNETS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COMSNETS48256.2020.9027406","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

一个VDC (virtual data center)是由多个相互关联、具有通信依赖关系的虚拟机组成的。跨地理分布式数据中心(dc)提供VDC请求为服务提供商(sp)带来了收益的提高、性能的增强和生存能力的提高。在实现这些显著目标的过程中,服务提供商经常面临多个vdc的动态重新配置/重新映射的挑战。重新映射vdc带来了两个艰巨的挑战:(a)为虚拟机和虚拟链路(vl)找到一个成本最低的重新映射,(b)以最小的开销和服务中断在数据中心网络中迁移虚拟机映像和内存内容。在本文中,我们提出了一个称为VRMap的模型,该模型找到了一个最佳的重映射计划,旨在平衡重映射成本和迁移开销,而不影响服务质量。VRMap利用遗传-元启发式算法来获得最优解。将VRMap算法的性能与贪婪启发式算法和随机启发式算法进行了比较。仿真结果表明,VRMap在重映射成本方面取得了相当的性能,但在迁移时间和停机时间方面取得了显着的增益。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
VRMap: A Cost and Time Aware Remapping of Virtual Data Centres Over a Geo-distributed Infrastructure
A virtual data center (VDC) comprises multiple correlated virtual machines (VMs) with communication dependencies. Provisioning VDC requests across Geo-distributed data centres (DCs) offer benefits to service providers (SPs) in the form of improved revenue, enhanced performance and increased survivability. On the way to achieve such salient objectives, SPs often face the concomitant challenge of dynamic reconfiguration/remapping of multiple VDCs. Remapping VDCs introduces two arduous challenges: (A.) finding a minimum cost remap for VMs' and virtual links (VLs), (b.) migrating VMs image and memory contents across DC networks with minimum overheads and service disruption. In this paper, we propose a model called VRMap that finds an optimal remapping plan that aims to balance the remapping cost and migration overheads without compromising the service quality. VRMap makes use of genetic-metaheuristic to achieve the optimal solution. The performance of VRMap is compared with greedy and random heuristics. Simulation results show that VRMap achieves comparable performance with regards to remapping cost but attains significant gain in terms of miaration time and downtime.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信