{"title":"一种基于强化学习的虚拟网络功能灵活部署方案","authors":"J. Yao, Meijuan Chen","doi":"10.1109/ICCC51575.2020.9344881","DOIUrl":null,"url":null,"abstract":"Network function virtualization (NFV) technology is widely used in network slicing in 5G networks and traffic processing in wide area network. However, with the increasing of service requests during the life cycle of a virtual network function (VNF), how to flexibly deploy the VNF becomes a key problem to make maximum use of the limited capacity of the physical network resources, and meanwhile satisfy the requirements of quality of service (QoS) in NFV scenario. In this paper, aiming to solve whether and how to scale VNF on demand, we formulated this problem as a non-convex linear mathematical optimization model where the optimization goal is to minimize the delay and energy consumption of the service function chain (SFC). Specifically, we propose a VNF flexible deployment scheme based on Reinforcement Learning (RL). Moreover, we train the agent by interacting with the physical network environment and take action according to the state of physical node to find the optimal physical resource allocation strategy of the VNF scaling. In addition, the state space, action space and the reward function are defined as available resource, migration or scaling decision and the reciprocal of total cost respectively. Extensive simulation results demonstrate that the proposed algorithm outperforms the comparison algorithm in terms of reducing the delay and increasing the ratio of successful scaling request.","PeriodicalId":386048,"journal":{"name":"2020 IEEE 6th International Conference on Computer and Communications (ICCC)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A Flexible Deployment Scheme for Virtual Network Function Based on Reinforcement Learning\",\"authors\":\"J. Yao, Meijuan Chen\",\"doi\":\"10.1109/ICCC51575.2020.9344881\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Network function virtualization (NFV) technology is widely used in network slicing in 5G networks and traffic processing in wide area network. However, with the increasing of service requests during the life cycle of a virtual network function (VNF), how to flexibly deploy the VNF becomes a key problem to make maximum use of the limited capacity of the physical network resources, and meanwhile satisfy the requirements of quality of service (QoS) in NFV scenario. In this paper, aiming to solve whether and how to scale VNF on demand, we formulated this problem as a non-convex linear mathematical optimization model where the optimization goal is to minimize the delay and energy consumption of the service function chain (SFC). Specifically, we propose a VNF flexible deployment scheme based on Reinforcement Learning (RL). Moreover, we train the agent by interacting with the physical network environment and take action according to the state of physical node to find the optimal physical resource allocation strategy of the VNF scaling. In addition, the state space, action space and the reward function are defined as available resource, migration or scaling decision and the reciprocal of total cost respectively. Extensive simulation results demonstrate that the proposed algorithm outperforms the comparison algorithm in terms of reducing the delay and increasing the ratio of successful scaling request.\",\"PeriodicalId\":386048,\"journal\":{\"name\":\"2020 IEEE 6th International Conference on Computer and Communications (ICCC)\",\"volume\":\"23 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-12-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 IEEE 6th International Conference on Computer and Communications (ICCC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCC51575.2020.9344881\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE 6th International Conference on Computer and Communications (ICCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCC51575.2020.9344881","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Flexible Deployment Scheme for Virtual Network Function Based on Reinforcement Learning
Network function virtualization (NFV) technology is widely used in network slicing in 5G networks and traffic processing in wide area network. However, with the increasing of service requests during the life cycle of a virtual network function (VNF), how to flexibly deploy the VNF becomes a key problem to make maximum use of the limited capacity of the physical network resources, and meanwhile satisfy the requirements of quality of service (QoS) in NFV scenario. In this paper, aiming to solve whether and how to scale VNF on demand, we formulated this problem as a non-convex linear mathematical optimization model where the optimization goal is to minimize the delay and energy consumption of the service function chain (SFC). Specifically, we propose a VNF flexible deployment scheme based on Reinforcement Learning (RL). Moreover, we train the agent by interacting with the physical network environment and take action according to the state of physical node to find the optimal physical resource allocation strategy of the VNF scaling. In addition, the state space, action space and the reward function are defined as available resource, migration or scaling decision and the reciprocal of total cost respectively. Extensive simulation results demonstrate that the proposed algorithm outperforms the comparison algorithm in terms of reducing the delay and increasing the ratio of successful scaling request.