虚拟网络功能重构问题的一种有效启发式算法

Hanane Biallach, M. Bouhtou, D. Nace, Mohamed Salah Mimouna
{"title":"虚拟网络功能重构问题的一种有效启发式算法","authors":"Hanane Biallach, M. Bouhtou, D. Nace, Mohamed Salah Mimouna","doi":"10.1109/RNDM55901.2022.9927661","DOIUrl":null,"url":null,"abstract":"In this paper, we propose an efficient heuristic for the Virtual Network Function (VNF) reconfiguration problem in the context of 5G network slicing. This problem consists in reallocating the VNFs to fit the network changes, by transforming the current state of deployed services, e.g., the current placement of Virtual Machines (VM) that host VNFs, to another state that updates providers’ objectives. We rely on the topological sorting algorithm and the Feedback Arc Set (FAS) problem to build our heuristic which is an alternative of an Integer Linear Programming (ILP) solution that we have already proposed in [1]. Experimental results show that our heuristic solves the problem in a few seconds even for large network infrastructures.","PeriodicalId":386500,"journal":{"name":"2022 12th International Workshop on Resilient Networks Design and Modeling (RNDM)","volume":"657 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"An Efficient Heuristic for the Virtual Network Function Reconfiguration Problem\",\"authors\":\"Hanane Biallach, M. Bouhtou, D. Nace, Mohamed Salah Mimouna\",\"doi\":\"10.1109/RNDM55901.2022.9927661\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we propose an efficient heuristic for the Virtual Network Function (VNF) reconfiguration problem in the context of 5G network slicing. This problem consists in reallocating the VNFs to fit the network changes, by transforming the current state of deployed services, e.g., the current placement of Virtual Machines (VM) that host VNFs, to another state that updates providers’ objectives. We rely on the topological sorting algorithm and the Feedback Arc Set (FAS) problem to build our heuristic which is an alternative of an Integer Linear Programming (ILP) solution that we have already proposed in [1]. Experimental results show that our heuristic solves the problem in a few seconds even for large network infrastructures.\",\"PeriodicalId\":386500,\"journal\":{\"name\":\"2022 12th International Workshop on Resilient Networks Design and Modeling (RNDM)\",\"volume\":\"657 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-09-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 12th International Workshop on Resilient Networks Design and Modeling (RNDM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/RNDM55901.2022.9927661\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 12th International Workshop on Resilient Networks Design and Modeling (RNDM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RNDM55901.2022.9927661","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

在本文中,我们提出了一种有效的启发式方法来解决5G网络切片背景下的虚拟网络功能(VNF)重构问题。这个问题包括重新分配VNFs以适应网络变化,通过转换已部署服务的当前状态,例如,托管VNFs的虚拟机(VM)的当前位置,到更新提供商目标的另一状态。我们依靠拓扑排序算法和反馈弧集(FAS)问题来构建我们的启发式算法,这是我们已经在[1]中提出的整数线性规划(ILP)解决方案的替代方案。实验结果表明,即使对于大型网络设施,我们的启发式算法也能在几秒钟内解决问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An Efficient Heuristic for the Virtual Network Function Reconfiguration Problem
In this paper, we propose an efficient heuristic for the Virtual Network Function (VNF) reconfiguration problem in the context of 5G network slicing. This problem consists in reallocating the VNFs to fit the network changes, by transforming the current state of deployed services, e.g., the current placement of Virtual Machines (VM) that host VNFs, to another state that updates providers’ objectives. We rely on the topological sorting algorithm and the Feedback Arc Set (FAS) problem to build our heuristic which is an alternative of an Integer Linear Programming (ILP) solution that we have already proposed in [1]. Experimental results show that our heuristic solves the problem in a few seconds even for large network infrastructures.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信