IEEE Journal on Selected Areas in Communications最新文献

{"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}

{"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}

{"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}

{"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}

{"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}

{"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}

{"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}

{"title":"5G RAN: Functional Split Orchestration Optimization","authors":"Salma Matoussi, Ilhem Fajjari, Salvatore Costanzo, N. Aitsaadi, R. Langar","doi":"10.1109/JSAC.2020.2999685","DOIUrl":"https://doi.org/10.1109/JSAC.2020.2999685","url":null,"abstract":"5G RAN aims to evolve new technologies spanning the Cloud infrastructure, virtualization techniques and Software Defined Network capabilities. Advanced solutions are introduced to split the functions of the Radio Access Network (RAN) between centralized and distributed locations. Such paradigms improve RAN flexibility and reduce the infrastructure deployment cost without impacting the user quality of service. We propose a novel functional split orchestration scheme that aims at minimizing the RAN deployment cost, while considering the requirements of its processing network functions and the capabilities of the Cloud infrastructure. With a fine grained approach on user basis, we show that the proposed solution optimizes both processing and bandwidth resource usage, while minimizing the overall energy consumption compared to i) cell-centric, ii) distributed and iii) centralized Cloud-RAN approaches. Moreover, we evaluate the effectiveness of our proposal in a 5G experimental prototype, based on Open Air Interface (OAI). We show that our solution achieves good performance in terms of total deployment cost and resolution time.","PeriodicalId":13243,"journal":{"name":"IEEE Journal on Selected Areas in Communications","volume":"38 1","pages":"1448-1463"},"PeriodicalIF":16.4,"publicationDate":"2020-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/JSAC.2020.2999685","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47327244","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}

{"title":"Market Driven Multidomain Network Service Orchestration in 5G Networks","authors":"Mouhamad Dieye, Wael Jaafar, H. Elbiaze, R. Glitho","doi":"10.1109/JSAC.2020.2986692","DOIUrl":"https://doi.org/10.1109/JSAC.2020.2986692","url":null,"abstract":"The advent of a new breed of enhanced multimedia services has put network operators into a position where they must support innovative services while ensuring both end-to-end Quality of Service requirements and profitability. Recently, Network Function Virtualization (NFV) has been touted as a cost-effective underlying technology in 5G networks to efficiently provision novel services. These NFV-based services have been increasingly associated with multi-domain networks. However, several orchestration issues, linked to cross-domain interactions and emphasized by the heterogeneity of underlying technologies and administrative authorities, present an important challenge. In this paper, we tackle the cross-domain interaction issue by proposing an intelligent and profitable auction-based approach to allow inter-domains resource allocation.","PeriodicalId":13243,"journal":{"name":"IEEE Journal on Selected Areas in Communications","volume":"38 1","pages":"1417-1431"},"PeriodicalIF":16.4,"publicationDate":"2020-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/JSAC.2020.2986692","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47969730","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}

{"title":"User-Centric Edge Sharing Mechanism in Software-Defined Ultra-Dense Networks","authors":"D. Wu, Junjie Yan, Honggang Wang, Ruyang Wang","doi":"10.1109/JSAC.2020.2986871","DOIUrl":"https://doi.org/10.1109/JSAC.2020.2986871","url":null,"abstract":"The emerging mobile edge computing (MEC) evolutionarily extends the cloud services to the network edge. In order to efficiently coordinate distributed edge resources, software defined networking (SDN) at the network edge has been explored to realize the integrated management of communication, computation, and cache (3C) resources. However, many research efforts, in software-defined edge networks, are mainly devoted to 1C or 2C resource sharing. Motivated by high service performance and user demands, we propose a user-centric edge resource sharing model for software-defined ultra-dense network (SD-UDN) where multiple MEC servers around small base stations (SBSs) can share their 3C resources through OpenFlow-enabled switches. In particular, the service models of MEC servers and users are formulated to optimize the service process by minimizing the service delay, which is NP-hard. To address this NP-hard issue, a service association model is constructed based on design structure matrix (DSM), and a simulated annealing algorithm is employed to further optimize the service association model for reducing time complexity and offering a nearoptimal solution. Compared with traditional 1C or 2C resource sharing, the proposed edge resource sharing model can guarantee lower service delay for users.","PeriodicalId":13243,"journal":{"name":"IEEE Journal on Selected Areas in Communications","volume":"38 1","pages":"1531-1541"},"PeriodicalIF":16.4,"publicationDate":"2020-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/JSAC.2020.2986871","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44104257","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}