基于自改进飞蛾火焰的云中容器资源优化配置

K. Vhatkar, G. Bhole
{"title":"基于自改进飞蛾火焰的云中容器资源优化配置","authors":"K. Vhatkar, G. Bhole","doi":"10.1002/cpe.7200","DOIUrl":null,"url":null,"abstract":"Resource allocation in the cloud is becoming more complicated and challenging due to the rising necessities of cloud services. Effective management of virtual resources in the cloud is of large significance since it has a great impact on both the operational cost and scalability of the cloud environment. Nowadays, containers are becoming more popular in this regard due to their characteristics like reduced overhead and portability. Conventional resource allocation schemes are usually modeled for the migration and allocation of virtual machines (VM), as a result; the question may arise on, “how these strategies can be adapted for the management of a containerized cloud”. This work evolves the solution to this issue by introducing a new fitness oriented moth flame algorithm (F‐MFA) for optimizing the allocation of containers. Further in this work, the optimal allocation relies on certain constraints like balanced cluster use, system failure, total network distance (TND), security and threshold distance, and credibility factor as well. In the end, the supremacy of the presented model is computed to the conventional models in terms of cost and convergence analysis.","PeriodicalId":10584,"journal":{"name":"Concurrency and Computation: Practice and Experience","volume":"172 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2022-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Self‐improved moth flame for optimal container resource allocation in cloud\",\"authors\":\"K. Vhatkar, G. Bhole\",\"doi\":\"10.1002/cpe.7200\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Resource allocation in the cloud is becoming more complicated and challenging due to the rising necessities of cloud services. Effective management of virtual resources in the cloud is of large significance since it has a great impact on both the operational cost and scalability of the cloud environment. Nowadays, containers are becoming more popular in this regard due to their characteristics like reduced overhead and portability. Conventional resource allocation schemes are usually modeled for the migration and allocation of virtual machines (VM), as a result; the question may arise on, “how these strategies can be adapted for the management of a containerized cloud”. This work evolves the solution to this issue by introducing a new fitness oriented moth flame algorithm (F‐MFA) for optimizing the allocation of containers. Further in this work, the optimal allocation relies on certain constraints like balanced cluster use, system failure, total network distance (TND), security and threshold distance, and credibility factor as well. In the end, the supremacy of the presented model is computed to the conventional models in terms of cost and convergence analysis.\",\"PeriodicalId\":10584,\"journal\":{\"name\":\"Concurrency and Computation: Practice and Experience\",\"volume\":\"172 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-07-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Concurrency and Computation: Practice and Experience\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1002/cpe.7200\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Concurrency and Computation: Practice and Experience","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1002/cpe.7200","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

由于云服务需求的增加,云中的资源分配变得更加复杂和具有挑战性。对云中虚拟资源的有效管理具有重要意义,因为它对云环境的运营成本和可扩展性都有很大影响。如今,由于其降低开销和可移植性等特点,容器在这方面变得越来越流行。因此,传统的资源分配方案通常是为虚拟机(VM)的迁移和分配建模的;可能会出现这样的问题:“这些策略如何适用于容器化云的管理”。这项工作通过引入一种新的面向适应度的蛾焰算法(F‐MFA)来优化容器的分配,从而解决了这个问题。在本工作中,最优分配依赖于一定的约束,如均衡集群使用、系统故障、总网络距离(TND)、安全和阈值距离以及可信度因素。最后,从成本和收敛性分析两方面计算了该模型相对于传统模型的优越性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Self‐improved moth flame for optimal container resource allocation in cloud
Resource allocation in the cloud is becoming more complicated and challenging due to the rising necessities of cloud services. Effective management of virtual resources in the cloud is of large significance since it has a great impact on both the operational cost and scalability of the cloud environment. Nowadays, containers are becoming more popular in this regard due to their characteristics like reduced overhead and portability. Conventional resource allocation schemes are usually modeled for the migration and allocation of virtual machines (VM), as a result; the question may arise on, “how these strategies can be adapted for the management of a containerized cloud”. This work evolves the solution to this issue by introducing a new fitness oriented moth flame algorithm (F‐MFA) for optimizing the allocation of containers. Further in this work, the optimal allocation relies on certain constraints like balanced cluster use, system failure, total network distance (TND), security and threshold distance, and credibility factor as well. In the end, the supremacy of the presented model is computed to the conventional models in terms of cost and convergence analysis.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信