Pub Date : 2020-07-01DOI: 10.1109/JSAC.2020.2999686
M. T. Raza, Songwu Lu
Network function virtualization (NFV) of IP Multimedia Subsystem (IMS) pose promise to service increasing multimedia traffic demand. In this paper, we show that virtualized IMS (vIMS) is unable to provide session-level resilience under faults and becomes the bottleneck to high service availability. We propose a design to provide fault-tolerance for vIMS operations. In control-plane, our system decomposes single IMS operation into different atomic actions, and partition these actions into critical and non-critical actions. Only the critical actions are then monitored in real time and the system can easily resume IMS operations after failure. In data-plane, we decompose multimedia traffic flows and partition each multimedia service as a separate Virtualized Network Function (VNF). Through data-plane partitioning, our design restricts the damage from faults to only failed VNF. Thereafter, impacted service flow is merged with other ongoing service flows. We build our system prototype of open source IMS over virtualized platform. Our results show that we can achieve session-level resilience by performing fail-over procedure within tens of milliseconds under different combinations of IMS failures in both control-plane and data-plane operations.
{"title":"Uninterruptible IMS: Maintaining Users Access During Faults in Virtualized IP Multimedia Subsystem","authors":"M. T. Raza, Songwu Lu","doi":"10.1109/JSAC.2020.2999686","DOIUrl":"https://doi.org/10.1109/JSAC.2020.2999686","url":null,"abstract":"Network function virtualization (NFV) of IP Multimedia Subsystem (IMS) pose promise to service increasing multimedia traffic demand. In this paper, we show that virtualized IMS (vIMS) is unable to provide session-level resilience under faults and becomes the bottleneck to high service availability. We propose a design to provide fault-tolerance for vIMS operations. In control-plane, our system decomposes single IMS operation into different atomic actions, and partition these actions into critical and non-critical actions. Only the critical actions are then monitored in real time and the system can easily resume IMS operations after failure. In data-plane, we decompose multimedia traffic flows and partition each multimedia service as a separate Virtualized Network Function (VNF). Through data-plane partitioning, our design restricts the damage from faults to only failed VNF. Thereafter, impacted service flow is merged with other ongoing service flows. We build our system prototype of open source IMS over virtualized platform. Our results show that we can achieve session-level resilience by performing fail-over procedure within tens of milliseconds under different combinations of IMS failures in both control-plane and data-plane operations.","PeriodicalId":13243,"journal":{"name":"IEEE Journal on Selected Areas in Communications","volume":"38 1","pages":"1464-1477"},"PeriodicalIF":16.4,"publicationDate":"2020-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/JSAC.2020.2999686","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48962257","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-07-01DOI: 10.1109/JSAC.2020.2986870
Prajwal Keshavamurthy, E. Pateromichelakis, D. Dahlhaus, Chan Zhou
Co-operative automated driving (CAD) is a key fifth generation mobile networks (5G) use case in which autonomous vehicles communicate over vehicle-to-vehicle (V2V) links requiring a wide range of rate-reliability-delay performance. One key 5G enabler for CAD sidelink radio resource management (RRM) in a multi-operator environment is the virtualization of RRM at the cloud server. This, however, is challenging due to an increase in control plane delay, signaling overhead and complexity. This paper introduces an edge cloud-enabled end-to-end vehicle-to-everything (V2X) architecture to support sidelink RRM in CAD scenarios. Analyzing the problem of a cloud-based sidelink resource allocation for CAD, a utility-based multi-objective optimization problem is described and is translated to three tasks: 1) a vehicle cluster formation as a solution to the clique partitioning problem ensuring vehicle reachability on the control plane, 2) an inter-cluster resource block pool (RB-pool) allocation as a solution to a max-min fairness problem and 3) an intra-cluster resource allocation. The proposed solution framework aims to achieve high modularity, low complexity and decouples cluster formation and RB-pool assignment from the intra-cluster optimum resource allocation, which may be performed on different time scales at different edge cloud entities. Simulation results in a realistic vehicular deployment show significant gains in terms of sidelink throughput and delay while maintaining high link quality.
{"title":"Edge Cloud-Enabled Radio Resource Management for Co-Operative Automated Driving","authors":"Prajwal Keshavamurthy, E. Pateromichelakis, D. Dahlhaus, Chan Zhou","doi":"10.1109/JSAC.2020.2986870","DOIUrl":"https://doi.org/10.1109/JSAC.2020.2986870","url":null,"abstract":"Co-operative automated driving (CAD) is a key fifth generation mobile networks (5G) use case in which autonomous vehicles communicate over vehicle-to-vehicle (V2V) links requiring a wide range of rate-reliability-delay performance. One key 5G enabler for CAD sidelink radio resource management (RRM) in a multi-operator environment is the virtualization of RRM at the cloud server. This, however, is challenging due to an increase in control plane delay, signaling overhead and complexity. This paper introduces an edge cloud-enabled end-to-end vehicle-to-everything (V2X) architecture to support sidelink RRM in CAD scenarios. Analyzing the problem of a cloud-based sidelink resource allocation for CAD, a utility-based multi-objective optimization problem is described and is translated to three tasks: 1) a vehicle cluster formation as a solution to the clique partitioning problem ensuring vehicle reachability on the control plane, 2) an inter-cluster resource block pool (RB-pool) allocation as a solution to a max-min fairness problem and 3) an intra-cluster resource allocation. The proposed solution framework aims to achieve high modularity, low complexity and decouples cluster formation and RB-pool assignment from the intra-cluster optimum resource allocation, which may be performed on different time scales at different edge cloud entities. Simulation results in a realistic vehicular deployment show significant gains in terms of sidelink throughput and delay while maintaining high link quality.","PeriodicalId":13243,"journal":{"name":"IEEE Journal on Selected Areas in Communications","volume":"38 1","pages":"1515-1530"},"PeriodicalIF":16.4,"publicationDate":"2020-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/JSAC.2020.2986870","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44544585","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-07-01DOI: 10.1109/jsac.2020.2986960
T. Taleb
5G is raising high expectations, offering new avenues for research, and paving the way to a safer and highperforming set of innovative use-cases. For use-cases related for instance to Internet of Things (IoT), self-driving vehicles, or unmanned aerial vehicles (UAVs), the programming and management of the underlying network resources will be carried out in a dynamic and scalable manner. In this vein, many enabling technologies are adopted by service providers, cloud providers and enterprises, such as Software Defined Networking (SDN) and Network Function Virtualization (NFV).
{"title":"Guest Editorial: Seventh Edition of the IEEE JSAC Series on Network Softwarization and Enablers","authors":"T. Taleb","doi":"10.1109/jsac.2020.2986960","DOIUrl":"https://doi.org/10.1109/jsac.2020.2986960","url":null,"abstract":"5G is raising high expectations, offering new avenues for research, and paving the way to a safer and highperforming set of innovative use-cases. For use-cases related for instance to Internet of Things (IoT), self-driving vehicles, or unmanned aerial vehicles (UAVs), the programming and management of the underlying network resources will be carried out in a dynamic and scalable manner. In this vein, many enabling technologies are adopted by service providers, cloud providers and enterprises, such as Software Defined Networking (SDN) and Network Function Virtualization (NFV).","PeriodicalId":13243,"journal":{"name":"IEEE Journal on Selected Areas in Communications","volume":"191 1","pages":"1281-1284"},"PeriodicalIF":16.4,"publicationDate":"2020-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77757038","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-07-01DOI: 10.1109/JSAC.2020.2999683
Arslan Ahmad, Alessandro Floris, L. Atzori
In this paper, we present an open source Software-Defined Networking (SDN) based emulation platform called Timber. We aim to provide the research community with an experimental tool for the design and evaluation of the new Quality of Experience (QoE) management and monitoring procedures for video streaming. To this aim, the main functionalities of Timber include: i) an SDN application for taking QoE-aware management decisions; ii) an SDN controller to monitor the network’s QoS (Quality of Service) and implement network management actions, such as network slicing and Multiprotocol Label Switching (MPLS) based prioritization operations; iii) a complete video streaming application including a multimedia server and a DASH-based client video player; iv) a user-end probe at the client video player to monitor QoE-related video application parameters, which are stored in a database that can be accessed by the SDN application; v) data analysis tools, which enable easy data visualization of measured QoS and QoE metrics as well as execution of statistical analysis of experimental results. In this article, we introduce and describe the main characteristics and functionalities of Timber as well as the implementation details. Finally, we provide experimental results of a video streaming scenario to demonstrate the capability of Timber to implement and test QoE-aware management approaches.
{"title":"Timber: An SDN-Based Emulation Platform for Experimental Research on Video Streaming","authors":"Arslan Ahmad, Alessandro Floris, L. Atzori","doi":"10.1109/JSAC.2020.2999683","DOIUrl":"https://doi.org/10.1109/JSAC.2020.2999683","url":null,"abstract":"In this paper, we present an open source Software-Defined Networking (SDN) based emulation platform called Timber. We aim to provide the research community with an experimental tool for the design and evaluation of the new Quality of Experience (QoE) management and monitoring procedures for video streaming. To this aim, the main functionalities of Timber include: i) an SDN application for taking QoE-aware management decisions; ii) an SDN controller to monitor the network’s QoS (Quality of Service) and implement network management actions, such as network slicing and Multiprotocol Label Switching (MPLS) based prioritization operations; iii) a complete video streaming application including a multimedia server and a DASH-based client video player; iv) a user-end probe at the client video player to monitor QoE-related video application parameters, which are stored in a database that can be accessed by the SDN application; v) data analysis tools, which enable easy data visualization of measured QoS and QoE metrics as well as execution of statistical analysis of experimental results. In this article, we introduce and describe the main characteristics and functionalities of Timber as well as the implementation details. Finally, we provide experimental results of a video streaming scenario to demonstrate the capability of Timber to implement and test QoE-aware management approaches.","PeriodicalId":13243,"journal":{"name":"IEEE Journal on Selected Areas in Communications","volume":"38 1","pages":"1374-1387"},"PeriodicalIF":16.4,"publicationDate":"2020-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/JSAC.2020.2999683","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43478989","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-07-01DOI: 10.1109/JSAC.2020.2986935
Wenjun Li, Tong Yang, Ori Rottenstreich, Xianfeng Li, Gaogang Xie, Hui Li, Balajee Vamanan, Dagang Li, Huiping Lin
Software switches are being deployed in SDN to enable a wide spectrum of non-traditional applications. The popular Open vSwitch uses a variant of Tuple Space Search (TSS) for packet classifications. Although it has good performance on rule updates, it is less efficient than decision trees on lookups. In this paper, we propose a two-stage framework consisting of heterogeneous algorithms to adaptively exploit different characteristics of the rule sets at different scales. In the first stage, partial decision trees are constructed from several rule subsets grouped with respect to their small fields. This grouping eliminates rule replications at large scales, thereby enabling very efficient pre-cuttings. The second stage handles packet classification at small scales for non-leaf terminal nodes, where rule replications within each subspace may lead to inefficient cuttings. A salient fact is that small space means long address prefixes or less nesting levels of ranges, both indicating a very limited tuple space. To exploit this favorable property, we employ a TSS-based algorithm for these subsets following tree constructions. Experimental results show that our work has comparable update performance to TSS in Open vSwitch, while achieving almost an order-of-magnitude improvement on classification performance over TSS.
{"title":"Tuple Space Assisted Packet Classification With High Performance on Both Search and Update","authors":"Wenjun Li, Tong Yang, Ori Rottenstreich, Xianfeng Li, Gaogang Xie, Hui Li, Balajee Vamanan, Dagang Li, Huiping Lin","doi":"10.1109/JSAC.2020.2986935","DOIUrl":"https://doi.org/10.1109/JSAC.2020.2986935","url":null,"abstract":"Software switches are being deployed in SDN to enable a wide spectrum of non-traditional applications. The popular Open vSwitch uses a variant of Tuple Space Search (TSS) for packet classifications. Although it has good performance on rule updates, it is less efficient than decision trees on lookups. In this paper, we propose a two-stage framework consisting of heterogeneous algorithms to adaptively exploit different characteristics of the rule sets at different scales. In the first stage, partial decision trees are constructed from several rule subsets grouped with respect to their small fields. This grouping eliminates rule replications at large scales, thereby enabling very efficient pre-cuttings. The second stage handles packet classification at small scales for non-leaf terminal nodes, where rule replications within each subspace may lead to inefficient cuttings. A salient fact is that small space means long address prefixes or less nesting levels of ranges, both indicating a very limited tuple space. To exploit this favorable property, we employ a TSS-based algorithm for these subsets following tree constructions. Experimental results show that our work has comparable update performance to TSS in Open vSwitch, while achieving almost an order-of-magnitude improvement on classification performance over TSS.","PeriodicalId":13243,"journal":{"name":"IEEE Journal on Selected Areas in Communications","volume":"38 1","pages":"1555-1569"},"PeriodicalIF":16.4,"publicationDate":"2020-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/JSAC.2020.2986935","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43607681","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-07-01DOI: 10.1109/JSAC.2020.2999684
B. Sonkoly, R. Szabó, Balázs Németh, János Czentye, Dávid Haja, Márk Szalay, János Dóka, B. P. Gero, Dávid Jocha, László Toka
Envisioned 5G applications and services, such as Tactile Internet, Industry 4.0 use-cases, remote control of drone swarms, pose serious challenges to the underlying networks and cloud platforms. On the one hand, evolved cloud infrastructures provide the IT basis for future applications. On the other hand, networking is in the middle of a momentous revolution and important changes are mainly driven by Network Function Virtualization (NFV) and Software Defined Networking (SDN). A diverse set of cloud and network resources, controlled by different technologies and owned by cooperating or competing providers, should be coordinated and orchestrated in a novel way in order to enable future applications and fulfill application level requirements. In this paper, we propose a novel cross domain orchestration system which provides wholesale XaaS (Anything as a Service) services over multiple administrative and technology domains. Our goal is threefold. First, we design a novel orchestration system exploiting a powerful information model and propose a versatile embedding algorithm with advanced capabilities as a key enabler. The main features of the architecture include $i$ ) efficient and multi-purpose service embedding algorithms which can be implemented based on graph models, $ii$ ) inherent multi-domain support, $iii$ ) programmable aggregation of different resources, $iv$ ) information hiding together with flexible delegation of certain requirements enabling multi-operator use-cases, and $v$ ) support for legacy technologies. Second, we present our proof-of-concept prototype implementing the proposed system. Third, we establish a dedicated test environment spanning across multiple European sites encompassing sandbox environments from both operators and the academia in order to evaluate the operation of the system. Dedicated experiments confirm the feasibility and good scalability of the whole framework.
设想中的5G应用和服务，如触觉互联网、工业4.0用例、无人机群的远程控制，对底层网络和云平台构成了严重挑战。一方面，演进的云基础设施为未来的应用程序提供了IT基础。另一方面，网络正处于一场重大革命之中，重要的变革主要由网络功能虚拟化（NFV）和软件定义网络（SDN）驱动。由不同技术控制、由合作或竞争提供商拥有的一组不同的云和网络资源应该以一种新颖的方式进行协调和编排，以实现未来的应用程序并满足应用程序级别的要求。在本文中，我们提出了一种新的跨域编排系统，该系统在多个管理和技术领域提供批发XaaS（Anything as a Service）服务。我们的目标有三个。首先，我们利用强大的信息模型设计了一个新的编排系统，并提出了一种通用的嵌入算法，该算法具有先进的功能。该体系结构的主要特征包括$i$）可以基于图模型实现的高效和多用途服务嵌入算法，$ii$）固有的多域支持，$iii$）不同资源的可编程聚合，$iv$）信息隐藏以及某些需求的灵活委托，实现多运营商用例，以及$v$）对遗留技术的支持。其次，我们给出了实现所提出的系统的概念验证原型。第三，我们建立了一个横跨多个欧洲站点的专用测试环境，包括运营商和学术界的沙箱环境，以评估系统的运行情况。专门的实验验证了整个框架的可行性和良好的可扩展性。
{"title":"5G Applications From Vision to Reality: Multi-Operator Orchestration","authors":"B. Sonkoly, R. Szabó, Balázs Németh, János Czentye, Dávid Haja, Márk Szalay, János Dóka, B. P. Gero, Dávid Jocha, László Toka","doi":"10.1109/JSAC.2020.2999684","DOIUrl":"https://doi.org/10.1109/JSAC.2020.2999684","url":null,"abstract":"Envisioned 5G applications and services, such as Tactile Internet, Industry 4.0 use-cases, remote control of drone swarms, pose serious challenges to the underlying networks and cloud platforms. On the one hand, evolved cloud infrastructures provide the IT basis for future applications. On the other hand, networking is in the middle of a momentous revolution and important changes are mainly driven by Network Function Virtualization (NFV) and Software Defined Networking (SDN). A diverse set of cloud and network resources, controlled by different technologies and owned by cooperating or competing providers, should be coordinated and orchestrated in a novel way in order to enable future applications and fulfill application level requirements. In this paper, we propose a novel cross domain orchestration system which provides wholesale XaaS (Anything as a Service) services over multiple administrative and technology domains. Our goal is threefold. First, we design a novel orchestration system exploiting a powerful information model and propose a versatile embedding algorithm with advanced capabilities as a key enabler. The main features of the architecture include <inline-formula> <tex-math notation=\"LaTeX\">$i$ </tex-math></inline-formula>) efficient and multi-purpose service embedding algorithms which can be implemented based on graph models, <inline-formula> <tex-math notation=\"LaTeX\">$ii$ </tex-math></inline-formula>) inherent multi-domain support, <inline-formula> <tex-math notation=\"LaTeX\">$iii$ </tex-math></inline-formula>) programmable aggregation of different resources, <inline-formula> <tex-math notation=\"LaTeX\">$iv$ </tex-math></inline-formula>) information hiding together with flexible delegation of certain requirements enabling multi-operator use-cases, and <inline-formula> <tex-math notation=\"LaTeX\">$v$ </tex-math></inline-formula>) support for legacy technologies. Second, we present our proof-of-concept prototype implementing the proposed system. Third, we establish a dedicated test environment spanning across multiple European sites encompassing sandbox environments from both operators and the academia in order to evaluate the operation of the system. Dedicated experiments confirm the feasibility and good scalability of the whole framework.","PeriodicalId":13243,"journal":{"name":"IEEE Journal on Selected Areas in Communications","volume":"38 1","pages":"1401-1416"},"PeriodicalIF":16.4,"publicationDate":"2020-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/JSAC.2020.2999684","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49518946","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-07-01DOI: 10.1109/JSAC.2020.2986869
Hernani D. Chantre, Nelson Luis Saldanha da Fonseca
The support of stringent requirements such as ultra-low latency and ultra-reliability of the forthcoming 5G services poses several challenges to telecommunications infrastructure providers. Network Function Virtualization, multi-access edge computing (MEC), and network slicing capabilities can help the support of such requirements. However, a trade-off between the cost of resource deployment and the support of service requirements needs to be taken into account in the design of NFV-based 5G networks. In this paper, we investigate the MEC location problem, which aims at selecting locations to place MECs hosting protected slices. We propose a MEC location problem enhanced with 1: 1 and $1:N$ protection schemes for the provisioning of protected slices. In the 1: 1 scheme, protection is assured by reserving a backup slice for each tenant, whereas in the $1:N$ scheme, a backup slice is shared among $N$ tenants. The problem is modeled as a multi-criteria optimization problem and solved by the employment of a multi-objective evolutionary non-dominated sorting genetic algorithm. A comparison between the 1: 1 and $1:N$ protection schemes is carried out in the context of 5G network slicing. Results show that the protection scheme 1: 1 can reduce the response time, at a higher deployment cost when compared to the $1:N$ scheme.
{"title":"The Location Problem for the Provisioning of Protected Slices in NFV-Based MEC Infrastructure","authors":"Hernani D. Chantre, Nelson Luis Saldanha da Fonseca","doi":"10.1109/JSAC.2020.2986869","DOIUrl":"https://doi.org/10.1109/JSAC.2020.2986869","url":null,"abstract":"The support of stringent requirements such as ultra-low latency and ultra-reliability of the forthcoming 5G services poses several challenges to telecommunications infrastructure providers. Network Function Virtualization, multi-access edge computing (MEC), and network slicing capabilities can help the support of such requirements. However, a trade-off between the cost of resource deployment and the support of service requirements needs to be taken into account in the design of NFV-based 5G networks. In this paper, we investigate the MEC location problem, which aims at selecting locations to place MECs hosting protected slices. We propose a MEC location problem enhanced with 1: 1 and <inline-formula> <tex-math notation=\"LaTeX\">$1:N$ </tex-math></inline-formula> protection schemes for the provisioning of protected slices. In the 1: 1 scheme, protection is assured by reserving a backup slice for each tenant, whereas in the <inline-formula> <tex-math notation=\"LaTeX\">$1:N$ </tex-math></inline-formula> scheme, a backup slice is shared among <inline-formula> <tex-math notation=\"LaTeX\">$N$ </tex-math></inline-formula> tenants. The problem is modeled as a multi-criteria optimization problem and solved by the employment of a multi-objective evolutionary non-dominated sorting genetic algorithm. A comparison between the 1: 1 and <inline-formula> <tex-math notation=\"LaTeX\">$1:N$ </tex-math></inline-formula> protection schemes is carried out in the context of 5G network slicing. Results show that the protection scheme 1: 1 can reduce the response time, at a higher deployment cost when compared to the <inline-formula> <tex-math notation=\"LaTeX\">$1:N$ </tex-math></inline-formula> scheme.","PeriodicalId":13243,"journal":{"name":"IEEE Journal on Selected Areas in Communications","volume":"38 1","pages":"1505-1514"},"PeriodicalIF":16.4,"publicationDate":"2020-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/JSAC.2020.2986869","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41973010","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-06-04DOI: 10.1109/JSAC.2020.2986693
Peng Zheng, Theophilus A. Benson, Chengchen Hu
Programmable data planes, PDPs, enable an unprecedented level of flexibility and have emerged as a promising alternative to existing data planes. Despite the rapid development and prototyping cycles that PDPs promote, the existing PDP ecosystem lacks appropriate abstractions and algorithms to support these rapid testing and deployment life-cycles. In this paper, we propose P4Visor, a lightweight virtualization abstraction that provides testing primitives as a first-order citizen of the PDP ecosystem. P4Visor can efficiently support multiple PDP programs through a combination of compiler optimizations and program analysis-based algorithms. P4Visor’s algorithm improves over state-of-the-art techniques by significantly reducing the resource overheads associated with embedding numerous versions of a PDP program into hardware. To demonstrate the efficiency and viability of P4Visor, we implemented and evaluated P4Visor on both a software switch and an FPGA-based hardware switch using fourteen of different PDP programs. Our results demonstrate that P4Visor introduces minimal overheads and is one order of magnitude more efficient than existing PDPs primitives for concurrently supporting multiple programs.
{"title":"Building and Testing Modular Programs for Programmable Data Planes","authors":"Peng Zheng, Theophilus A. Benson, Chengchen Hu","doi":"10.1109/JSAC.2020.2986693","DOIUrl":"https://doi.org/10.1109/JSAC.2020.2986693","url":null,"abstract":"Programmable data planes, PDPs, enable an unprecedented level of flexibility and have emerged as a promising alternative to existing data planes. Despite the rapid development and prototyping cycles that PDPs promote, the existing PDP ecosystem lacks appropriate abstractions and algorithms to support these rapid testing and deployment life-cycles. In this paper, we propose P4Visor, a lightweight virtualization abstraction that provides testing primitives as a first-order citizen of the PDP ecosystem. P4Visor can efficiently support multiple PDP programs through a combination of compiler optimizations and program analysis-based algorithms. P4Visor’s algorithm improves over state-of-the-art techniques by significantly reducing the resource overheads associated with embedding numerous versions of a PDP program into hardware. To demonstrate the efficiency and viability of P4Visor, we implemented and evaluated P4Visor on both a software switch and an FPGA-based hardware switch using fourteen of different PDP programs. Our results demonstrate that P4Visor introduces minimal overheads and is one order of magnitude more efficient than existing PDPs primitives for concurrently supporting multiple programs.","PeriodicalId":13243,"journal":{"name":"IEEE Journal on Selected Areas in Communications","volume":"38 1","pages":"1432-1447"},"PeriodicalIF":16.4,"publicationDate":"2020-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/JSAC.2020.2986693","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44954565","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-06-03DOI: 10.1109/JSAC.2020.2999682
A. Mondal, S. Misra
In this paper, we study the problem of data flow management in the presence of heterogeneous flows — elephant and mice flows — in software-defined networks (SDNs). Most of the researchers considered the homogeneous flows in SDN in the existing literature. The optimal data flow management in the presence of heterogeneous flows is NP-hard. Hence, we propose a game theory-based heterogeneous data flow management scheme, named FlowMan. In FlowMan, initially, we use a generalized Nash bargaining game to obtain a sub-optimal problem, which is NP-complete in nature. By solving it, we get the Pareto optimal solution for data-rate associated with each switch. Thereafter, we use a heuristic method to decide the flow-association with the switches, distributedly, which, in turn, helps to get a Pareto optimal solution. Extensive simulation results depict that FlowMan is capable of ensuring quality-of-service (QoS) for data flow management in the presence of heterogeneous flows. In particular, FlowMan is capable of reducing network delay by 77.8–98.7%, while ensuring 24.6–47.8% increase in network throughput, compared to the existing schemes such as FlowStat and CURE. Additionally, FlowMan ensures that per-flow delay is reduced by 27.7% with balanced load distribution among the SDN switches.
{"title":"FlowMan: QoS-Aware Dynamic Data Flow Management in Software-Defined Networks","authors":"A. Mondal, S. Misra","doi":"10.1109/JSAC.2020.2999682","DOIUrl":"https://doi.org/10.1109/JSAC.2020.2999682","url":null,"abstract":"In this paper, we study the problem of data flow management in the presence of heterogeneous flows — elephant and mice flows — in software-defined networks (SDNs). Most of the researchers considered the homogeneous flows in SDN in the existing literature. The optimal data flow management in the presence of heterogeneous flows is NP-hard. Hence, we propose a game theory-based heterogeneous data flow management scheme, named FlowMan. In FlowMan, initially, we use a generalized Nash bargaining game to obtain a sub-optimal problem, which is NP-complete in nature. By solving it, we get the Pareto optimal solution for data-rate associated with each switch. Thereafter, we use a heuristic method to decide the flow-association with the switches, distributedly, which, in turn, helps to get a Pareto optimal solution. Extensive simulation results depict that FlowMan is capable of ensuring quality-of-service (QoS) for data flow management in the presence of heterogeneous flows. In particular, FlowMan is capable of reducing network delay by 77.8–98.7%, while ensuring 24.6–47.8% increase in network throughput, compared to the existing schemes such as FlowStat and CURE. Additionally, FlowMan ensures that per-flow delay is reduced by 27.7% with balanced load distribution among the SDN switches.","PeriodicalId":13243,"journal":{"name":"IEEE Journal on Selected Areas in Communications","volume":"38 1","pages":"1366-1373"},"PeriodicalIF":16.4,"publicationDate":"2020-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/JSAC.2020.2999682","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45151488","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-06-03DOI: 10.1109/JSAC.2020.2999654
K. Gao, Taishi Nojima, Haitao Yu, Y. Yang
Software-Defined Networking (SDN) enables more dynamic and fine-grained network control. In particular, network operators can route traffic not only based on packet header fields, but also higher-level parameters such as user settings, traffic characteristics, and application-layer information extracted by virtualized network functions such as DPI, firewall and authentication servers. Integrating these higher-level parameters into an SDN programming framework brings substantial benefits but is still missing in the SDN community. In this paper, we articulate the challenges and then propose Trident, a novel unified SDN programming framework. Trident extends algorithmic SDN programming with a new abstraction called stream attribute, which integrates meta parameters into the match-action programming paradigm. Further, Trident adopts the idea of reactive value from function reactive programming, eliminating the complexity of manually handling dynamicity. To effectively and efficiently realize these novel ideas, Trident introduces reactive table as the basic processing unit and develops a domain-specific distributed update protocol to maintain consistency during updates. Evaluations show that Trident puts very little overhead on integrating existing network management tools and network functions, and can handle up to $O(10^{5})$ routing requests per second with $O(100)$ milliseconds latency.
{"title":"Trident: Toward Distributed Reactive SDN Programming With Consistent Updates","authors":"K. Gao, Taishi Nojima, Haitao Yu, Y. Yang","doi":"10.1109/JSAC.2020.2999654","DOIUrl":"https://doi.org/10.1109/JSAC.2020.2999654","url":null,"abstract":"Software-Defined Networking (SDN) enables more dynamic and fine-grained network control. In particular, network operators can route traffic not only based on packet header fields, but also higher-level parameters such as user settings, traffic characteristics, and application-layer information extracted by virtualized network functions such as DPI, firewall and authentication servers. Integrating these higher-level parameters into an SDN programming framework brings substantial benefits but is still missing in the SDN community. In this paper, we articulate the challenges and then propose Trident, a novel unified SDN programming framework. Trident extends algorithmic SDN programming with a new abstraction called <italic>stream attribute</italic>, which integrates meta parameters into the match-action programming paradigm. Further, Trident adopts the idea of <italic>reactive value</italic> from function reactive programming, eliminating the complexity of manually handling dynamicity. To effectively and efficiently realize these novel ideas, Trident introduces <italic>reactive table</italic> as the basic processing unit and develops a domain-specific distributed update protocol to maintain consistency during updates. Evaluations show that Trident puts very little overhead on integrating existing network management tools and network functions, and can handle up to <inline-formula> <tex-math notation=\"LaTeX\">$O(10^{5})$ </tex-math></inline-formula> routing requests per second with <inline-formula> <tex-math notation=\"LaTeX\">$O(100)$ </tex-math></inline-formula> milliseconds latency.","PeriodicalId":13243,"journal":{"name":"IEEE Journal on Selected Areas in Communications","volume":"38 1","pages":"1322-1334"},"PeriodicalIF":16.4,"publicationDate":"2020-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/JSAC.2020.2999654","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45277094","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：