{"title":"融合NFV和SDN技术的5G核心网资源优化算法","authors":"Chunxue Xu","doi":"10.1016/j.ijin.2025.04.001","DOIUrl":null,"url":null,"abstract":"<div><div>The growth in network demand has driven the development of new network technologies. However, traditional network architecture cannot meet the huge traffic of transportation and different business needs. To address this issue, a specific network service function chain is formed based on the network function virtualization. Dynamic resource awareness algorithms are introduced to construct an adaptive migration model based on network function virtualization. Based on the Multi-Armed Bandit (MAB) algorithm, a dynamic routing model based on MAB is constructed by using a greedy algorithm to search for random actions. When the nodes were 200 and 500, the migration costs of the adaptive migration model based on network function virtualization were 1000 and 3000, respectively. The average migration was 350 and 900 respectively, while destination nodes' average resource occupancy rates were 52 % and 58 %, respectively. When the path failure rates were 4 % and 20 %, the algorithm's safe path rates were 96.25 % and 92.75 %. For fixed and mobile nodes, the link load rate of the dynamic routing model based on the MAB algorithm was low and the load growth was relatively stable. This dynamic routing model's link delay is significantly less than the Dijkstra algorithm. These two models can maximize server resource utilization, reduce cost consumption, and achieve maximum overall benefits.</div></div>","PeriodicalId":100702,"journal":{"name":"International Journal of Intelligent Networks","volume":"6 ","pages":"Pages 36-46"},"PeriodicalIF":0.0000,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Resource optimization algorithm for 5G core network integrating NFV and SDN technologies\",\"authors\":\"Chunxue Xu\",\"doi\":\"10.1016/j.ijin.2025.04.001\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>The growth in network demand has driven the development of new network technologies. However, traditional network architecture cannot meet the huge traffic of transportation and different business needs. To address this issue, a specific network service function chain is formed based on the network function virtualization. Dynamic resource awareness algorithms are introduced to construct an adaptive migration model based on network function virtualization. Based on the Multi-Armed Bandit (MAB) algorithm, a dynamic routing model based on MAB is constructed by using a greedy algorithm to search for random actions. When the nodes were 200 and 500, the migration costs of the adaptive migration model based on network function virtualization were 1000 and 3000, respectively. The average migration was 350 and 900 respectively, while destination nodes' average resource occupancy rates were 52 % and 58 %, respectively. When the path failure rates were 4 % and 20 %, the algorithm's safe path rates were 96.25 % and 92.75 %. For fixed and mobile nodes, the link load rate of the dynamic routing model based on the MAB algorithm was low and the load growth was relatively stable. This dynamic routing model's link delay is significantly less than the Dijkstra algorithm. These two models can maximize server resource utilization, reduce cost consumption, and achieve maximum overall benefits.</div></div>\",\"PeriodicalId\":100702,\"journal\":{\"name\":\"International Journal of Intelligent Networks\",\"volume\":\"6 \",\"pages\":\"Pages 36-46\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2025-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Intelligent Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S2666603025000041\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Intelligent Networks","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2666603025000041","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Resource optimization algorithm for 5G core network integrating NFV and SDN technologies
The growth in network demand has driven the development of new network technologies. However, traditional network architecture cannot meet the huge traffic of transportation and different business needs. To address this issue, a specific network service function chain is formed based on the network function virtualization. Dynamic resource awareness algorithms are introduced to construct an adaptive migration model based on network function virtualization. Based on the Multi-Armed Bandit (MAB) algorithm, a dynamic routing model based on MAB is constructed by using a greedy algorithm to search for random actions. When the nodes were 200 and 500, the migration costs of the adaptive migration model based on network function virtualization were 1000 and 3000, respectively. The average migration was 350 and 900 respectively, while destination nodes' average resource occupancy rates were 52 % and 58 %, respectively. When the path failure rates were 4 % and 20 %, the algorithm's safe path rates were 96.25 % and 92.75 %. For fixed and mobile nodes, the link load rate of the dynamic routing model based on the MAB algorithm was low and the load growth was relatively stable. This dynamic routing model's link delay is significantly less than the Dijkstra algorithm. These two models can maximize server resource utilization, reduce cost consumption, and achieve maximum overall benefits.