{"title":"Virtual Network Function Embedding under Nodal Outage using Reinforcement Learning","authors":"S. B. Chetty, H. Ahmadi, A. Nag","doi":"10.1109/ANTS50601.2020.9342803","DOIUrl":null,"url":null,"abstract":"With the emergence of various types of applications such as delay-sensitive applications, future communication networks are expected to be increasingly complex and dynamic. Network Function Virtualization (NFV) provides the necessary support towards efficient management of such complex networks, by disintegrating the dependency on the hardware devices via virtualizing the network functions and placing them on shared data centres. However, one of the main challenges of the NFV paradigm is the resource allocation problem which is known as NFV-Resource Allocation (NFV-RA). NFV-RA is a method of deploying software-based network functions on the substrate nodes, subject to the constraints imposed by the underlying infrastructure and the agreed Service Level Agreement (SLA). This work investigates the potential of Reinforcement Learning (RL) as a fast yet accurate means (as compared to integer linear programming) for deploying the softwarized network functions onto substrate networks under several Quality of Service (QoS) constraints. In addition to the regular resource constraints and latency constraints, we introduced the concept of a complete outage of certain nodes in the network. This outage can be either due to a disaster or unavailability of network topology information due to proprietary and ownership issues. We have analyzed the network performance on different network topologies, different capacities of the nodes and the links, and different degrees of the nodal outage. The computational time escalated with the increase in the network density to achieve the optimal solutions; this is because Q-Learning is an iterative process which results in a slow exploration. Our results also show that for certain topologies and a certain combination of resources, we can achieve between 7090% service acceptance rate even with a 40% nodal outage.","PeriodicalId":426651,"journal":{"name":"2020 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"82 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ANTS50601.2020.9342803","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5
Abstract
With the emergence of various types of applications such as delay-sensitive applications, future communication networks are expected to be increasingly complex and dynamic. Network Function Virtualization (NFV) provides the necessary support towards efficient management of such complex networks, by disintegrating the dependency on the hardware devices via virtualizing the network functions and placing them on shared data centres. However, one of the main challenges of the NFV paradigm is the resource allocation problem which is known as NFV-Resource Allocation (NFV-RA). NFV-RA is a method of deploying software-based network functions on the substrate nodes, subject to the constraints imposed by the underlying infrastructure and the agreed Service Level Agreement (SLA). This work investigates the potential of Reinforcement Learning (RL) as a fast yet accurate means (as compared to integer linear programming) for deploying the softwarized network functions onto substrate networks under several Quality of Service (QoS) constraints. In addition to the regular resource constraints and latency constraints, we introduced the concept of a complete outage of certain nodes in the network. This outage can be either due to a disaster or unavailability of network topology information due to proprietary and ownership issues. We have analyzed the network performance on different network topologies, different capacities of the nodes and the links, and different degrees of the nodal outage. The computational time escalated with the increase in the network density to achieve the optimal solutions; this is because Q-Learning is an iterative process which results in a slow exploration. Our results also show that for certain topologies and a certain combination of resources, we can achieve between 7090% service acceptance rate even with a 40% nodal outage.
随着各种类型的应用,如延迟敏感应用的出现,未来的通信网络将越来越复杂和动态。网络功能虚拟化(Network Function Virtualization, NFV)通过虚拟化网络功能并将其放置在共享数据中心上,从而瓦解对硬件设备的依赖,从而为有效管理此类复杂网络提供了必要的支持。然而,NFV模式的主要挑战之一是资源分配问题,即NFV-资源分配(NFV- ra)。NFV-RA是一种在底层节点上部署基于软件的网络功能的方法,受底层基础设施和商定的服务水平协议(SLA)的约束。这项工作研究了强化学习(RL)作为一种快速而准确的方法(与整数线性规划相比)的潜力,用于在几种服务质量(QoS)约束下将软件网络功能部署到基板网络上。除了常规的资源约束和延迟约束之外,我们还引入了网络中某些节点完全中断的概念。这种中断可能是由于灾难或由于专有和所有权问题导致的网络拓扑信息不可用。我们分析了不同网络拓扑结构下的网络性能、不同节点和链路的容量以及不同程度的节点中断。计算时间随着网络密度的增加而增加,以达到最优解;这是因为Q-Learning是一个迭代的过程,导致缓慢的探索。我们的结果还表明,对于某些拓扑和某些资源组合,即使在40%的节点中断情况下,我们也可以实现7090%之间的服务接受率。