云计算环境中虚拟网络功能的布局优化

IF 4.1 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
Imad Eddine Said, Lamri Sayad, Djamil Aissani
{"title":"云计算环境中虚拟网络功能的布局优化","authors":"Imad Eddine Said, Lamri Sayad, Djamil Aissani","doi":"10.1007/s10922-024-09812-0","DOIUrl":null,"url":null,"abstract":"<p>The use of Network Function Virtualization is constantly increasing in Cloud environments, especially for next-generation networks such as 5G. In this context, the definition of a deployment scheme defining for each Virtual Network Function (VNF) the appropriate server in order to meet the quality of service requirements. This problem is known in the literature as virtual fetwork function placement. However, proper deployment of VNFs on servers can minimize the number of servers used, but may increase service latency. In this article, we propose a multi-objective integer linear programming model to solve the problem of network function placement. The objective is to find the best compromise between minimizing end-to-end total latency for users and reducing the number of servers used, while ensuring that the maximum number of VNFs is connected in the network. Our proposal to solve the NP-hard problem involves developing an algorithm based on the Particle Swarm Optimization metaheuristic to obtain a polynomial time resolution. By performing tests on a simple VNF deployment problem, we validated the relevance of our optimization model and demonstrated the effectiveness of our algorithm. The results obtained showed that our method provides feasible solutions very close to the exact optimal solutions.</p>","PeriodicalId":50119,"journal":{"name":"Journal of Network and Systems Management","volume":"34 1","pages":""},"PeriodicalIF":4.1000,"publicationDate":"2024-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Placement Optimization of Virtual Network Functions in a Cloud Computing Environment\",\"authors\":\"Imad Eddine Said, Lamri Sayad, Djamil Aissani\",\"doi\":\"10.1007/s10922-024-09812-0\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>The use of Network Function Virtualization is constantly increasing in Cloud environments, especially for next-generation networks such as 5G. In this context, the definition of a deployment scheme defining for each Virtual Network Function (VNF) the appropriate server in order to meet the quality of service requirements. This problem is known in the literature as virtual fetwork function placement. However, proper deployment of VNFs on servers can minimize the number of servers used, but may increase service latency. In this article, we propose a multi-objective integer linear programming model to solve the problem of network function placement. The objective is to find the best compromise between minimizing end-to-end total latency for users and reducing the number of servers used, while ensuring that the maximum number of VNFs is connected in the network. Our proposal to solve the NP-hard problem involves developing an algorithm based on the Particle Swarm Optimization metaheuristic to obtain a polynomial time resolution. By performing tests on a simple VNF deployment problem, we validated the relevance of our optimization model and demonstrated the effectiveness of our algorithm. The results obtained showed that our method provides feasible solutions very close to the exact optimal solutions.</p>\",\"PeriodicalId\":50119,\"journal\":{\"name\":\"Journal of Network and Systems Management\",\"volume\":\"34 1\",\"pages\":\"\"},\"PeriodicalIF\":4.1000,\"publicationDate\":\"2024-03-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Network and Systems Management\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1007/s10922-024-09812-0\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Network and Systems Management","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s10922-024-09812-0","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

网络功能虚拟化(Network Function Virtualization)在云环境中的使用不断增加,尤其是在 5G 等下一代网络中。在这种情况下,需要定义一种部署方案,为每个虚拟网络功能(VNF)定义合适的服务器,以满足服务质量要求。这个问题在文献中被称为虚拟网络功能部署。然而,在服务器上适当部署 VNF 可以最大限度地减少使用的服务器数量,但可能会增加服务延迟。在本文中,我们提出了一个多目标整数线性规划模型来解决网络功能放置问题。其目标是在确保网络中连接最大数量的 VNF 的同时,在最小化用户端到端总延迟和减少所用服务器数量之间找到最佳折中方案。我们提出的解决 NP 难问题的建议包括开发一种基于粒子群优化元启发式的算法,以获得多项式时间的解决方案。通过对一个简单的 VNF 部署问题进行测试,我们验证了优化模型的相关性,并证明了算法的有效性。结果表明,我们的方法提供了非常接近精确最优解的可行解决方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

Placement Optimization of Virtual Network Functions in a Cloud Computing Environment

Placement Optimization of Virtual Network Functions in a Cloud Computing Environment

The use of Network Function Virtualization is constantly increasing in Cloud environments, especially for next-generation networks such as 5G. In this context, the definition of a deployment scheme defining for each Virtual Network Function (VNF) the appropriate server in order to meet the quality of service requirements. This problem is known in the literature as virtual fetwork function placement. However, proper deployment of VNFs on servers can minimize the number of servers used, but may increase service latency. In this article, we propose a multi-objective integer linear programming model to solve the problem of network function placement. The objective is to find the best compromise between minimizing end-to-end total latency for users and reducing the number of servers used, while ensuring that the maximum number of VNFs is connected in the network. Our proposal to solve the NP-hard problem involves developing an algorithm based on the Particle Swarm Optimization metaheuristic to obtain a polynomial time resolution. By performing tests on a simple VNF deployment problem, we validated the relevance of our optimization model and demonstrated the effectiveness of our algorithm. The results obtained showed that our method provides feasible solutions very close to the exact optimal solutions.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
7.60
自引率
16.70%
发文量
65
审稿时长
>12 weeks
期刊介绍: Journal of Network and Systems Management, features peer-reviewed original research, as well as case studies in the fields of network and system management. The journal regularly disseminates significant new information on both the telecommunications and computing aspects of these fields, as well as their evolution and emerging integration. This outstanding quarterly covers architecture, analysis, design, software, standards, and migration issues related to the operation, management, and control of distributed systems and communication networks for voice, data, video, and networked computing.
×
引用
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学术官方微信