Pub Date : 2022-06-27DOI: 10.1109/NetSoft54395.2022.9844025
Simone Bussa, R. Sisto, Fulvio Valenza
he growing trend towards network “softwarization” allows the creation and deployment of even complex network environments in a few minutes or seconds, rather than days or weeks as required by traditional methods. This revolutionary approach made it necessary to seek automatic processes to solve network security problems. One of the main issues in the automation of network security concerns the proper and efficient modeling of network traffic. In this paper, we describe two optimized Traffic Flows representation models, called Atomic Flows and Maximal Flows. In addition to the description, we have validated and evaluated the proposed models to solve two key network security problems - security verification and automatic configuration - showing the advantages and limitations of each solution.
{"title":"Security Automation using Traffic Flow Modeling","authors":"Simone Bussa, R. Sisto, Fulvio Valenza","doi":"10.1109/NetSoft54395.2022.9844025","DOIUrl":"https://doi.org/10.1109/NetSoft54395.2022.9844025","url":null,"abstract":"he growing trend towards network “softwarization” allows the creation and deployment of even complex network environments in a few minutes or seconds, rather than days or weeks as required by traditional methods. This revolutionary approach made it necessary to seek automatic processes to solve network security problems. One of the main issues in the automation of network security concerns the proper and efficient modeling of network traffic. In this paper, we describe two optimized Traffic Flows representation models, called Atomic Flows and Maximal Flows. In addition to the description, we have validated and evaluated the proposed models to solve two key network security problems - security verification and automatic configuration - showing the advantages and limitations of each solution.","PeriodicalId":125799,"journal":{"name":"2022 IEEE 8th International Conference on Network Softwarization (NetSoft)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115591665","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-06-27DOI: 10.1109/NetSoft54395.2022.9844041
A. Kattepur, S. David, S. Mohalik
5G Radio Access Network (RAN) slicing concerns strategies to share radio resources while guaranteeing differentiated service requirements. Current state of the art approaches make use of strict isolation or dedicated RAN physical resource block (PRB) partitioning among slices to ensure differentiated services. However, spectrum multiplexing may be rendered suboptimal due to isolation of resources; it further cannot handle variations in traffic patterns or intents in a dynamic way. In this paper, we propose a flexible multi-service partitioning strategy that can balance functional isolation and optimal sharing of resources. This system, called Muesli: Multi-objective Radio Resource Slice Management, makes use of model-based reinforcement learning techniques to dynamically modify PRB partitions. The reinforcement learning reward structure ensures that the system is trained to meet multiple objectives such as network slice Service Level Agreement (SLA) compliance, spectrum usage efficiency and fairness among customer classes. On a real use case from Ericsson, the throughput levels for individual services are shown to be optimized with accurate PRB partitioning.
{"title":"MUESLI: Multi-objective Radio Resource Slice Management via Reinforcement Learning","authors":"A. Kattepur, S. David, S. Mohalik","doi":"10.1109/NetSoft54395.2022.9844041","DOIUrl":"https://doi.org/10.1109/NetSoft54395.2022.9844041","url":null,"abstract":"5G Radio Access Network (RAN) slicing concerns strategies to share radio resources while guaranteeing differentiated service requirements. Current state of the art approaches make use of strict isolation or dedicated RAN physical resource block (PRB) partitioning among slices to ensure differentiated services. However, spectrum multiplexing may be rendered suboptimal due to isolation of resources; it further cannot handle variations in traffic patterns or intents in a dynamic way. In this paper, we propose a flexible multi-service partitioning strategy that can balance functional isolation and optimal sharing of resources. This system, called Muesli: Multi-objective Radio Resource Slice Management, makes use of model-based reinforcement learning techniques to dynamically modify PRB partitions. The reinforcement learning reward structure ensures that the system is trained to meet multiple objectives such as network slice Service Level Agreement (SLA) compliance, spectrum usage efficiency and fairness among customer classes. On a real use case from Ericsson, the throughput levels for individual services are shown to be optimized with accurate PRB partitioning.","PeriodicalId":125799,"journal":{"name":"2022 IEEE 8th International Conference on Network Softwarization (NetSoft)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116586235","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-06-27DOI: 10.1109/NetSoft54395.2022.9844032
Irene Vilà Muñoz, J. Pérez-Romero, O. Sallent
Reinforcement Learning (RL)-based algorithmic solutions have been profusely proposed in recent years for addressing multiple problems in the Radio Access Network (RAN). However, how RL algorithms have to be trained for a successful exploitation has not received sufficient attention. To address this limitation, which is particularly relevant given the peculiarities of wireless communications, this paper proposes a functional framework for training RL strategies in the RAN. The framework is aligned with the O-RAN Alliance machine learning workflow and introduces specific functionalities for RL, such as the way of specifying the training datasets, the mechanisms to monitor the performance of the trained policies during inference in the real network, and the capability to conduct a retraining if necessary. The proposed framework is illustrated with a relevant use case in 5G, namely RAN slicing, by considering a Deep Q-Network algorithm for capacity sharing. Finally, insights on other possible applicability examples of the proposed framework are provided.
{"title":"On the Training of Reinforcement Learning-based Algorithms in 5G and Beyond Radio Access Networks","authors":"Irene Vilà Muñoz, J. Pérez-Romero, O. Sallent","doi":"10.1109/NetSoft54395.2022.9844032","DOIUrl":"https://doi.org/10.1109/NetSoft54395.2022.9844032","url":null,"abstract":"Reinforcement Learning (RL)-based algorithmic solutions have been profusely proposed in recent years for addressing multiple problems in the Radio Access Network (RAN). However, how RL algorithms have to be trained for a successful exploitation has not received sufficient attention. To address this limitation, which is particularly relevant given the peculiarities of wireless communications, this paper proposes a functional framework for training RL strategies in the RAN. The framework is aligned with the O-RAN Alliance machine learning workflow and introduces specific functionalities for RL, such as the way of specifying the training datasets, the mechanisms to monitor the performance of the trained policies during inference in the real network, and the capability to conduct a retraining if necessary. The proposed framework is illustrated with a relevant use case in 5G, namely RAN slicing, by considering a Deep Q-Network algorithm for capacity sharing. Finally, insights on other possible applicability examples of the proposed framework are provided.","PeriodicalId":125799,"journal":{"name":"2022 IEEE 8th International Conference on Network Softwarization (NetSoft)","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128389917","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-06-27DOI: 10.1109/NetSoft54395.2022.9844081
Arif Ishaq, D. Ronzani, Andrea Spinato, N. Pietro, Marco Centenaro, Arturo Bellin, D. Munaretto
The management of a 5G system comprises Operation and Management aspects defined by 3GPP, including Network Slicing, and the Management and Orchestration aspects specified in ETSI’s Network Function Virtualization framework. Our Proof-of-Concept demonstrates the implementation of an on-demand provisioning procedure of a Network Slice Subnet composed of Virtual Network Functions from potentially different vendors. The demonstration includes a Network Management System conforming to the 3GPP Service-Based Management Architecture, an ETSI MANO orchestrator, and a Network Function Virtualization Infrastructure.
{"title":"Service-Based Management Architecture for On-Demand Creation, Configuration, and Control of a Network Slice Subnet","authors":"Arif Ishaq, D. Ronzani, Andrea Spinato, N. Pietro, Marco Centenaro, Arturo Bellin, D. Munaretto","doi":"10.1109/NetSoft54395.2022.9844081","DOIUrl":"https://doi.org/10.1109/NetSoft54395.2022.9844081","url":null,"abstract":"The management of a 5G system comprises Operation and Management aspects defined by 3GPP, including Network Slicing, and the Management and Orchestration aspects specified in ETSI’s Network Function Virtualization framework. Our Proof-of-Concept demonstrates the implementation of an on-demand provisioning procedure of a Network Slice Subnet composed of Virtual Network Functions from potentially different vendors. The demonstration includes a Network Management System conforming to the 3GPP Service-Based Management Architecture, an ETSI MANO orchestrator, and a Network Function Virtualization Infrastructure.","PeriodicalId":125799,"journal":{"name":"2022 IEEE 8th International Conference on Network Softwarization (NetSoft)","volume":"182 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132083281","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-06-27DOI: 10.1109/NetSoft54395.2022.9844029
Arled Papa, Polina Kutsevol, Fidan Mehmeti, W. Kellerer
Next generation radio access networks (RANs) en-vision softwarization and programmability as the main tools to provide the quality of service (QoS) requirements of emerging applications. Consequently, software-defined radio access networks (SD-RANs) have gained increased traction as a technology to foster network management and alleviate orchestration. While there exist SD-RAN architecture concepts both with single and multiple SD-RAN controllers, currently developed prototypes only include a single controller. Such a design may be sufficient for a low number of managed devices, for instance below 50. When the number of devices increases beyond 300, the controller performance deteriorates. A distributed control plane provides a solution, but renders the management in the control plane complex and incurs additional overhead, for instance control handover. In this way, both single controller and distributed control plane approaches may have a negative impact on a user’s QoS. Yet, proper evaluations are missing and therefore the performance remains unclear. In order to investigate the effect of SD-RAN control plane on the user performance, in this work, we provide an extensive evaluation based on a 5G simulator, compliant with 3GPP standardization, as well as measurements with open-source SD-RAN controllers. Based on our simulator, we are able to demystify the user QoS depending on the control plane design choices. Our results demonstrate that having a distributed control plane with control handovers improves the user performance by at least 20% in terms of throughput, 5x regarding the packet loss ratio and 140% in terms of delay compared to a single controller approach. This confirms that the benefits of multiple controllers surpass the overhead caused by more complicated management.
{"title":"Effects of SD-RAN Control Plane Design on User Quality of Service","authors":"Arled Papa, Polina Kutsevol, Fidan Mehmeti, W. Kellerer","doi":"10.1109/NetSoft54395.2022.9844029","DOIUrl":"https://doi.org/10.1109/NetSoft54395.2022.9844029","url":null,"abstract":"Next generation radio access networks (RANs) en-vision softwarization and programmability as the main tools to provide the quality of service (QoS) requirements of emerging applications. Consequently, software-defined radio access networks (SD-RANs) have gained increased traction as a technology to foster network management and alleviate orchestration. While there exist SD-RAN architecture concepts both with single and multiple SD-RAN controllers, currently developed prototypes only include a single controller. Such a design may be sufficient for a low number of managed devices, for instance below 50. When the number of devices increases beyond 300, the controller performance deteriorates. A distributed control plane provides a solution, but renders the management in the control plane complex and incurs additional overhead, for instance control handover. In this way, both single controller and distributed control plane approaches may have a negative impact on a user’s QoS. Yet, proper evaluations are missing and therefore the performance remains unclear. In order to investigate the effect of SD-RAN control plane on the user performance, in this work, we provide an extensive evaluation based on a 5G simulator, compliant with 3GPP standardization, as well as measurements with open-source SD-RAN controllers. Based on our simulator, we are able to demystify the user QoS depending on the control plane design choices. Our results demonstrate that having a distributed control plane with control handovers improves the user performance by at least 20% in terms of throughput, 5x regarding the packet loss ratio and 140% in terms of delay compared to a single controller approach. This confirms that the benefits of multiple controllers surpass the overhead caused by more complicated management.","PeriodicalId":125799,"journal":{"name":"2022 IEEE 8th International Conference on Network Softwarization (NetSoft)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134560396","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-06-27DOI: 10.1109/NetSoft54395.2022.9844086
Ziqiang Wang, Abdullah Bittar, Changcheng Huang, Chung-Horng Lung, Gauravdeep Shami
The research community has been moving attention from Virtual Network Function (VNF) to Cloud-native Network Function (CNF) since cloudification has brought the Network Function Virtualization (NFV) to an advanced level. It has already been demonstrated that cloud-native technology brings high flexibility and efficiency to large-scale network service deployment compared to the traditional VNF with Virtual Machines (VMs). However, more work is needed to provide a flexible and reliable Service Function Chaining (SFC) development solution in a cloud-native environment. This paper proposes a web-based orchestrator system to deploy an SFC use case consisting of multiple CNFs in a multi-node Kubernetes cluster using Network Service Mesh (NSM). We demonstrate a cloud-native SFC framework that allows users to dynamically create container-based SFC rather than the traditional VMs with NFV/SDN controller approach. Further, additional work is presented with the support of an open-source monitoring system, Prometheus, to validate the SFC path.
自从云化将网络功能虚拟化(NFV)提升到一个高级水平以来，研究界一直将注意力从虚拟网络功能(VNF)转移到云原生网络功能(CNF)。实践证明，云原生技术相比传统的VNF(虚拟机)，能够为大规模网络业务部署带来更高的灵活性和效率。但是，要在云原生环境中提供灵活可靠的SFC (Service Function chains)开发解决方案，还需要做更多的工作。本文提出了一个基于web的编排系统，使用网络服务网格(Network Service Mesh, NSM)在多节点Kubernetes集群中部署由多个cnf组成的SFC用例。我们演示了一个云原生SFC框架，允许用户动态创建基于容器的SFC，而不是使用NFV/SDN控制器方法的传统虚拟机。此外，在开源监控系统Prometheus的支持下，还提供了额外的工作来验证SFC路径。
{"title":"A Web-based Orchestrator for Dynamic Service Function Chaining Development with Kubernetes","authors":"Ziqiang Wang, Abdullah Bittar, Changcheng Huang, Chung-Horng Lung, Gauravdeep Shami","doi":"10.1109/NetSoft54395.2022.9844086","DOIUrl":"https://doi.org/10.1109/NetSoft54395.2022.9844086","url":null,"abstract":"The research community has been moving attention from Virtual Network Function (VNF) to Cloud-native Network Function (CNF) since cloudification has brought the Network Function Virtualization (NFV) to an advanced level. It has already been demonstrated that cloud-native technology brings high flexibility and efficiency to large-scale network service deployment compared to the traditional VNF with Virtual Machines (VMs). However, more work is needed to provide a flexible and reliable Service Function Chaining (SFC) development solution in a cloud-native environment. This paper proposes a web-based orchestrator system to deploy an SFC use case consisting of multiple CNFs in a multi-node Kubernetes cluster using Network Service Mesh (NSM). We demonstrate a cloud-native SFC framework that allows users to dynamically create container-based SFC rather than the traditional VMs with NFV/SDN controller approach. Further, additional work is presented with the support of an open-source monitoring system, Prometheus, to validate the SFC path.","PeriodicalId":125799,"journal":{"name":"2022 IEEE 8th International Conference on Network Softwarization (NetSoft)","volume":"23 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131526664","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-06-27DOI: 10.1109/NetSoft54395.2022.9844097
Hao-Jen Fu, T. O’Farrell
As radio access networks (RANs) are becoming more densified, their design has shifted from considering capacity and coverage only to considering capacity, coverage and energy efficiency (EE). Also, sleep modes are an effective approach for enhancing the EE of densified RANs. This paper investigates the EE of a densified RAN for an Internet-of-Things (IoT) use case by employing a 3-dimensional (3D) Homogeneous Poisson Point Process (HPPP) to model the IoT base station (BS) distribution, which accounts for variation in BS height z as well as its x, y position. The EE performance of an IoT RAN is evaluated as the ratio of RAN throughput to RAN power consumption with the number of base stations varied as a parameter. The results demonstrate that sleep mode has the potential to make dense IoT networks energy efficient providing base stations serving only inactive or unconnected IoT devices are completely turned off, including the backhaul.
{"title":"The Spectral and Energy Efficiency of Ultra-Dense IoT Networks","authors":"Hao-Jen Fu, T. O’Farrell","doi":"10.1109/NetSoft54395.2022.9844097","DOIUrl":"https://doi.org/10.1109/NetSoft54395.2022.9844097","url":null,"abstract":"As radio access networks (RANs) are becoming more densified, their design has shifted from considering capacity and coverage only to considering capacity, coverage and energy efficiency (EE). Also, sleep modes are an effective approach for enhancing the EE of densified RANs. This paper investigates the EE of a densified RAN for an Internet-of-Things (IoT) use case by employing a 3-dimensional (3D) Homogeneous Poisson Point Process (HPPP) to model the IoT base station (BS) distribution, which accounts for variation in BS height z as well as its x, y position. The EE performance of an IoT RAN is evaluated as the ratio of RAN throughput to RAN power consumption with the number of base stations varied as a parameter. The results demonstrate that sleep mode has the potential to make dense IoT networks energy efficient providing base stations serving only inactive or unconnected IoT devices are completely turned off, including the backhaul.","PeriodicalId":125799,"journal":{"name":"2022 IEEE 8th International Conference on Network Softwarization (NetSoft)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131625374","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-06-27DOI: 10.1109/NetSoft54395.2022.9844094
A. Hölscher, Mikael Asplund, Felipe Boeira
Microservice architectures decompose applications into individual components for enhanced maintainability and horizontal scaling, but also comes with an increased cost for orchestrating the services. Software-Defined Networks (SDNs) enables the dynamic configuration of network switches using controllers. In this paper we propose a microservice architecture that leverages SDN to orchestrate the microservices with the goal of reducing the orchestration latency cost. We perform a set of experiments using Mininet in which we implement a tailor-made microservice application that uses SDN for orchestration in combination with a set of different controllers and load balancers. Our results show that our proposed architecture performs in the same order of magnitude as a corresponding monolithic system.
{"title":"Evaluation of an SDN-based Microservice Architecture","authors":"A. Hölscher, Mikael Asplund, Felipe Boeira","doi":"10.1109/NetSoft54395.2022.9844094","DOIUrl":"https://doi.org/10.1109/NetSoft54395.2022.9844094","url":null,"abstract":"Microservice architectures decompose applications into individual components for enhanced maintainability and horizontal scaling, but also comes with an increased cost for orchestrating the services. Software-Defined Networks (SDNs) enables the dynamic configuration of network switches using controllers. In this paper we propose a microservice architecture that leverages SDN to orchestrate the microservices with the goal of reducing the orchestration latency cost. We perform a set of experiments using Mininet in which we implement a tailor-made microservice application that uses SDN for orchestration in combination with a set of different controllers and load balancers. Our results show that our proposed architecture performs in the same order of magnitude as a corresponding monolithic system.","PeriodicalId":125799,"journal":{"name":"2022 IEEE 8th International Conference on Network Softwarization (NetSoft)","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131984951","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-06-27DOI: 10.1109/NetSoft54395.2022.9844120
Matthew Buckley, Sepehr Abbasi Zadeh, M. A. Beiruti, Soheil Abbasloo, Y. Ganjali
Due to the dynamic nature of traffic, networks must rapidly adapt to changing conditions. This is especially true in the context of the control plane which must ensure continuous and seamless operation. Switch migration, the process of changing the controller associated with a switch, is an important tool in facilitating this goal. In this work, we study the problem of minimizing the overall time to migrate a set of switches. We examine the problem subject to constraints on controller resources and QoS groups. We show that the problem is NP-hard and provide heuristic algorithms for solving large instances in practice. Through extensive experiments, we demonstrate that the heuristics achieve performance close to optimal while reducing the running time by several orders of magnitude.
{"title":"Switch Migration Scheduling in Distributed SDN Controllers","authors":"Matthew Buckley, Sepehr Abbasi Zadeh, M. A. Beiruti, Soheil Abbasloo, Y. Ganjali","doi":"10.1109/NetSoft54395.2022.9844120","DOIUrl":"https://doi.org/10.1109/NetSoft54395.2022.9844120","url":null,"abstract":"Due to the dynamic nature of traffic, networks must rapidly adapt to changing conditions. This is especially true in the context of the control plane which must ensure continuous and seamless operation. Switch migration, the process of changing the controller associated with a switch, is an important tool in facilitating this goal. In this work, we study the problem of minimizing the overall time to migrate a set of switches. We examine the problem subject to constraints on controller resources and QoS groups. We show that the problem is NP-hard and provide heuristic algorithms for solving large instances in practice. Through extensive experiments, we demonstrate that the heuristics achieve performance close to optimal while reducing the running time by several orders of magnitude.","PeriodicalId":125799,"journal":{"name":"2022 IEEE 8th International Conference on Network Softwarization (NetSoft)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131585028","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-06-27DOI: 10.1109/NetSoft54395.2022.9844115
H. U. Adoga, Yehia El-khatib, D. Pezaros
As the adoption of softwarized network functions (NFs) keeps growing, we evaluate the performance benefits of SDN-aware data-plane implementations when compared to diverse acceleration and process-based NFV frameworks. Typical network functions have been implemented using four alternative frameworks scenarios, an SDN-aware software switch (data-plane), a virtual machine (VM), a Data-Plane Development Kit (DPDK) NF, and a containerized NF. Results from our experiments show that the data-plane NF implementation yields much higher bandwidth and packets per second (pps) rates. The bandwidth obtained is 14% more than the user-space scenario while retaining CPU utilization. The DPDK NFs in our evaluation can process packets at a much higher rate for 64B packets, on a single CPU core, which is 7 times higher than the containerized NF implementations, also tied to a single core. Our results also show the performance gains from deploying virtual network functions on heterogeneous frameworks.
{"title":"On the Performance Benefits of Heterogeneous Virtual Network Function Execution Frameworks","authors":"H. U. Adoga, Yehia El-khatib, D. Pezaros","doi":"10.1109/NetSoft54395.2022.9844115","DOIUrl":"https://doi.org/10.1109/NetSoft54395.2022.9844115","url":null,"abstract":"As the adoption of softwarized network functions (NFs) keeps growing, we evaluate the performance benefits of SDN-aware data-plane implementations when compared to diverse acceleration and process-based NFV frameworks. Typical network functions have been implemented using four alternative frameworks scenarios, an SDN-aware software switch (data-plane), a virtual machine (VM), a Data-Plane Development Kit (DPDK) NF, and a containerized NF. Results from our experiments show that the data-plane NF implementation yields much higher bandwidth and packets per second (pps) rates. The bandwidth obtained is 14% more than the user-space scenario while retaining CPU utilization. The DPDK NFs in our evaluation can process packets at a much higher rate for 64B packets, on a single CPU core, which is 7 times higher than the containerized NF implementations, also tied to a single core. Our results also show the performance gains from deploying virtual network functions on heterogeneous frameworks.","PeriodicalId":125799,"journal":{"name":"2022 IEEE 8th International Conference on Network Softwarization (NetSoft)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125551683","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：