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}
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.