On the Design of Large-Sized Cloud Networks Optimized for Live Migration Using Tabu Search Algorithms

Salah-Eddine Benbrahim, A. Quintero, M. Bellaiche
{"title":"On the Design of Large-Sized Cloud Networks Optimized for Live Migration Using Tabu Search Algorithms","authors":"Salah-Eddine Benbrahim, A. Quintero, M. Bellaiche","doi":"10.1109/AMS.2014.47","DOIUrl":null,"url":null,"abstract":"This work, based on the paper [1], presents and develops a tabu search (TS) algorithm for the planning of interdependent virtual machines (VMs) with regards to data exchange deadline concern between their interdependent hosted applications. The main contribution of this research is the use of a tabu search (TS) heuristic to find near-optimal node positions in a virtual network having interdependent VMs and shared resources. This TS is an interesting solution regarding its precision and feasibility for large-sized virtual networks. The results of the TS proposed in this paper show that it is possible to reduce the planning costs of a virtual network while respecting interdependency constraints of its shared and distributed resources.","PeriodicalId":198621,"journal":{"name":"2014 8th Asia Modelling Symposium","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 8th Asia Modelling Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AMS.2014.47","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

This work, based on the paper [1], presents and develops a tabu search (TS) algorithm for the planning of interdependent virtual machines (VMs) with regards to data exchange deadline concern between their interdependent hosted applications. The main contribution of this research is the use of a tabu search (TS) heuristic to find near-optimal node positions in a virtual network having interdependent VMs and shared resources. This TS is an interesting solution regarding its precision and feasibility for large-sized virtual networks. The results of the TS proposed in this paper show that it is possible to reduce the planning costs of a virtual network while respecting interdependency constraints of its shared and distributed resources.
基于禁忌搜索算法的大规模云网络实时迁移优化设计
本工作基于论文[1],提出并开发了一种禁忌搜索(TS)算法,用于规划相互依赖的虚拟机(vm),考虑它们相互依赖的托管应用程序之间的数据交换截止日期问题。本研究的主要贡献是使用禁忌搜索(TS)启发式方法在具有相互依赖的vm和共享资源的虚拟网络中找到接近最优的节点位置。对于大型虚拟网络来说,TS的精度和可行性是一个有趣的解决方案。本文提出的TS结果表明,在尊重其共享和分布式资源的相互依赖约束的同时,可以降低虚拟网络的规划成本。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信