面向网络功能虚拟化请求的多目标资源优化

Mahmoud Gamal, M. Abolhasan, J. Lipman, R. Liu, Wei Ni
{"title":"面向网络功能虚拟化请求的多目标资源优化","authors":"Mahmoud Gamal, M. Abolhasan, J. Lipman, R. Liu, Wei Ni","doi":"10.1109/ICSENG.2018.8638192","DOIUrl":null,"url":null,"abstract":"Network function vitalization (NFV) as a new research concept, for both academia and industry, faces many challenges to network operators before it can be accepted into mainstream. One challenge addressed in this paper is to find the optimal placement f or a set of incoming requests with VNF service chains to serve in suitable Virtual Machines (VMs) such that a set of conflicting objectives are met. Mainly, focus is placed on maximizing the total saving cost by increasing the total CPU utilization during the processing time and increasing the processing time for every service request in the cloud network. Moreover, we aim to maximize the admitted traffic simultaneously while considering the system constraints. We formulate the problem as a multi-objective optimization problem and use a Resource Utilization Multi-Objective Evolutionary Algorithm based on Decomposition (RU-MOEA/D) algorithm to solve the problem considering the two objectives simultaneously. Extensive simulations are carried out to evaluate the effects of the different network sizes, genetic parameters and the number of server resources on the acceptable ratio of the arrival chains to serve in the available VMs. The empirical results illustrate that the proposed algorithm can solve the problem efficiently and compute the optimal solution for two objectives together within a reasonable running time.","PeriodicalId":356324,"journal":{"name":"2018 26th International Conference on Systems Engineering (ICSEng)","volume":"576 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Multi Objective Resource Optimisation for Network Function Virtualisation Requests\",\"authors\":\"Mahmoud Gamal, M. Abolhasan, J. Lipman, R. Liu, Wei Ni\",\"doi\":\"10.1109/ICSENG.2018.8638192\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Network function vitalization (NFV) as a new research concept, for both academia and industry, faces many challenges to network operators before it can be accepted into mainstream. One challenge addressed in this paper is to find the optimal placement f or a set of incoming requests with VNF service chains to serve in suitable Virtual Machines (VMs) such that a set of conflicting objectives are met. Mainly, focus is placed on maximizing the total saving cost by increasing the total CPU utilization during the processing time and increasing the processing time for every service request in the cloud network. Moreover, we aim to maximize the admitted traffic simultaneously while considering the system constraints. We formulate the problem as a multi-objective optimization problem and use a Resource Utilization Multi-Objective Evolutionary Algorithm based on Decomposition (RU-MOEA/D) algorithm to solve the problem considering the two objectives simultaneously. Extensive simulations are carried out to evaluate the effects of the different network sizes, genetic parameters and the number of server resources on the acceptable ratio of the arrival chains to serve in the available VMs. The empirical results illustrate that the proposed algorithm can solve the problem efficiently and compute the optimal solution for two objectives together within a reasonable running time.\",\"PeriodicalId\":356324,\"journal\":{\"name\":\"2018 26th International Conference on Systems Engineering (ICSEng)\",\"volume\":\"576 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 26th International Conference on Systems Engineering (ICSEng)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICSENG.2018.8638192\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 26th International Conference on Systems Engineering (ICSEng)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSENG.2018.8638192","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

网络功能活化(NFV)作为一种新的研究理念,在学术界和工业界都面临着许多挑战,网络运营商才能接受它成为主流。本文解决的一个挑战是为一组带有VNF服务链的传入请求找到最佳位置,以便在合适的虚拟机(vm)中提供服务,从而满足一组相互冲突的目标。主要是通过增加处理时间内的总CPU利用率和增加云网络中每个服务请求的处理时间来最大限度地节省总成本。此外,我们的目标是在考虑系统约束的同时使允许的流量最大化。我们将该问题表述为一个多目标优化问题,并采用基于分解的资源利用多目标进化算法(RU-MOEA/D)算法同时考虑两个目标进行求解。通过大量的仿真来评估不同网络规模、遗传参数和服务器资源数量对可接受的到达链在可用vm中的服务比率的影响。实证结果表明,该算法能够在合理的运行时间内有效地求解两个目标的最优解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Multi Objective Resource Optimisation for Network Function Virtualisation Requests
Network function vitalization (NFV) as a new research concept, for both academia and industry, faces many challenges to network operators before it can be accepted into mainstream. One challenge addressed in this paper is to find the optimal placement f or a set of incoming requests with VNF service chains to serve in suitable Virtual Machines (VMs) such that a set of conflicting objectives are met. Mainly, focus is placed on maximizing the total saving cost by increasing the total CPU utilization during the processing time and increasing the processing time for every service request in the cloud network. Moreover, we aim to maximize the admitted traffic simultaneously while considering the system constraints. We formulate the problem as a multi-objective optimization problem and use a Resource Utilization Multi-Objective Evolutionary Algorithm based on Decomposition (RU-MOEA/D) algorithm to solve the problem considering the two objectives simultaneously. Extensive simulations are carried out to evaluate the effects of the different network sizes, genetic parameters and the number of server resources on the acceptable ratio of the arrival chains to serve in the available VMs. The empirical results illustrate that the proposed algorithm can solve the problem efficiently and compute the optimal solution for two objectives together within a reasonable running time.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Essential Skill of Enterprise Architect Practitioners for Digital Era Power usage optimization in multi-UAV common-mission cooperative UAS systems A New Novel Improved Technique for PAPR Reduction in OFDM System Performance Investigation of a PV Emulator Using Current Source and Diode String ICSEng 2018 Preface
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1