Laaziz Lahlou, Amina Bounas, H. E. Mohamadi, N. Kara
{"title":"RAFALE: smaRt and scalable orchestrAtion system For virtuAL network sErvices","authors":"Laaziz Lahlou, Amina Bounas, H. E. Mohamadi, N. Kara","doi":"10.1109/HPSR52026.2021.9481840","DOIUrl":"https://doi.org/10.1109/HPSR52026.2021.9481840","url":null,"abstract":"Time-efficient and scalable mechanisms have a significant role in aiding cloud providers to deploy their increasingly complex virtual network services in a seamless manner thanks to Network Function Virtualization (NFV) and Software Defined Networking (SDN) paradigms. Unfortunately, existing state-of-the-art techniques suffer from non-scalability aptitude and often do not converge rapidly towards feasible solutions, although they provide competetive solutions in acceptable execution time for small-scale scenarios.In this paper, we propose RAFALE, a novel approach that formulates the orchestration problem as a graph matching problem and solves it using two exact algorithms. To the best of our knowledge, this is the first work that attempts to tackle the placement and chaining of the VNFs from a different perspective. Experimental results indicate that RAFALE outperforms, in terms of scalability and time-complexity, the well-known VF2 graph matching algorithm and two existing heuristic-based approaches for the placement and chaining of the VNFs.","PeriodicalId":158580,"journal":{"name":"2021 IEEE 22nd International Conference on High Performance Switching and Routing (HPSR)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115136085","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}
R. Bolla, R. Bruschi, Kay Burow, F. Davoli, Z. Ghrairi, P. Gouvas, C. Lombardo, Jane Frances Pajo, A. Zafeiropoulos
{"title":"From Cloud-Native to 5G-Ready Vertical Applications: An Industry 4.0 Use Case","authors":"R. Bolla, R. Bruschi, Kay Burow, F. Davoli, Z. Ghrairi, P. Gouvas, C. Lombardo, Jane Frances Pajo, A. Zafeiropoulos","doi":"10.1109/HPSR52026.2021.9481826","DOIUrl":"https://doi.org/10.1109/HPSR52026.2021.9481826","url":null,"abstract":"This paper aims to showcase the ability of the MATILDA Platform to enable vertical applications fully utilizing the capabilities offered by the fifth generation of mobile networks (5G). Although 5G, powered by network slicing and edge computing, promises to flexibly support radically new and extremely heterogeneous vertical applications, vertical stakeholders generally lack both the skills to exploit the full potentials of 5G networks and the vision of the underlying resources, owned by Telecom providers that are reluctant to expose them in an unmediated way. The MATILDA platform bridges the gap between the vertical application and the network service domains. This paper presents the case of an Industry 4.0 application, and highlights the role played by the MATILDA solution in its successful deployment and orchestration.","PeriodicalId":158580,"journal":{"name":"2021 IEEE 22nd International Conference on High Performance Switching and Routing (HPSR)","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115992400","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}
{"title":"C2RTL: A High-level Synthesis System for IP Lookup and Packet Classification","authors":"Md Iftakharul Islam, J. Khan","doi":"10.1109/HPSR52026.2021.9481810","DOIUrl":"https://doi.org/10.1109/HPSR52026.2021.9481810","url":null,"abstract":"IP lookup and packet classification are two core functions of a router. IP lookup involves performing the longest prefix match (LPM) of the destination IP address. Packet classification involves finding the best match in a multi-field ruleset where each field needs an exact or prefix match. ASIC based IP lookup and packet classification are traditionally designed in a register transfer level (RTL) hardware description language (HDL) such as Verilog or VHDL. However, manually writing hardware logic is notoriously complicated and painful. This paper presents a High Level Synthesis (HLS) system named C2RTL. C2RTL generates hardware logic in Verilog RTL directly from IP lookup or packet classification algorithm implemented in C. C2RTL is implemented as a plugin of GCC compiler. It takes an IP lookup or packet classification algorithm (in C) as an input and generates corresponding synthesizable Verilog RTL code for pipelined ASIC. We developed several IP lookup and packet classification algorithms in C2RTL and generated corresponding Verilog RTL. We evaluated the resulting RTL code with OpenROAD EDA.","PeriodicalId":158580,"journal":{"name":"2021 IEEE 22nd International Conference on High Performance Switching and Routing (HPSR)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122527931","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}
{"title":"Delay-Aware Backup Resource Allocation with Probabilistic Protection for Network Services","authors":"Shinya Horimoto, Fujun He, E. Oki","doi":"10.1109/HPSR52026.2021.9481815","DOIUrl":"https://doi.org/10.1109/HPSR52026.2021.9481815","url":null,"abstract":"This paper proposes a backup resource allocation model for virtual network functions (VNFs) to minimize the total required backup computing capacity with considering the service delay. If random failures occur to primary hosts, the VNFs in failed hosts are recovered by backup hosts, where the allocation is determined in advance. We introduce the probabilistic protection, where the probability that the protection provided by a backup host fails is limited within a given value; it allows backup resource sharing to reduce the total required computing capacity. The previous work formulated the backup resource allocation problem without considering the service delay as a mixed integer linear programming (MILP) problem by adopting the robust optimization. We consider the delay of services, which consists of networking delay between hosts and processing delay in each requested VNF. The probability that the total delay of a service exceeds its threshold is constrained within a given value. To solve the problem with the delay constraint, we introduce an algorithm with two methods to make the MILP problem be aware of the service delay. The results observe that, compared to the baseline, the proposed model can reduce the total required backup capacity of computing resource.","PeriodicalId":158580,"journal":{"name":"2021 IEEE 22nd International Conference on High Performance Switching and Routing (HPSR)","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126230448","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}
Hussein Chour, Djamel Eddine Kouicem, Azade Fotouhi, Mouna Ben Mabrouk
{"title":"Toward an autonomous Smart Home: a three-layer Edge-Fog-Cloud architecture with latency analysis","authors":"Hussein Chour, Djamel Eddine Kouicem, Azade Fotouhi, Mouna Ben Mabrouk","doi":"10.1109/HPSR52026.2021.9481821","DOIUrl":"https://doi.org/10.1109/HPSR52026.2021.9481821","url":null,"abstract":"Due to the rapid evolution of smart devices, recently, the smart home (SH) sector has attracted attention and faced a fast expansion. However, the current cloud-based SH architecture and the ever-growth of the smart-things number and applications have brought several challenges to SH like the user-dependent automation tasks, the user-dependent SH management system, and the relatively large delay response time. These challenges create a gap between the actual SH and the envisioned autonomous SH that can control the SH objects independently and automate the home intelligently. Reducing this gap became the main target of the current SH research works. This paper builds on the network softwarization and virtualization techniques along with the edge, fog, and cloud computing to propose a three-layer Edge-Fog-Cloud SH (EFC-SH) intelligence architecture that can enable the autonomous SH. Then, it derives the optimal trade-off between the workload and the latency at each layer. Simulation results show that the proposed EFC-SH architecture achieves lower latency compared to the cloud-only or fog-only architectures.","PeriodicalId":158580,"journal":{"name":"2021 IEEE 22nd International Conference on High Performance Switching and Routing (HPSR)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128452678","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}
{"title":"Foresighted Resource Provisioning for Network Slicing","authors":"Q. Luu, S. Kerboeuf, M. Kieffer","doi":"10.1109/HPSR52026.2021.9481832","DOIUrl":"https://doi.org/10.1109/HPSR52026.2021.9481832","url":null,"abstract":"Network slicing has emerged as a pivotal concept in 5G systems, allowing mobile operators to build isolated logical networks (slices) on top of shared infrastructure networks. Within a network slice, several Service Function Chains are usually deployed on a best-effort premise. Nevertheless, this approach does not guarantee the availability of enough infrastructure resources to accommodate the uncertain and time-varying slice resource demands.This paper investigates two adaptive slice resource provisioning methods accounting for the evolution with time of the slice resource demands. A probabilistic guarantee of meeting the slice resource requirements can be obtained, while being robust against uncertainties. The myopic approach accounts for the past demands when provisioning the current demands, while the foresighted approach accounts for both past and future demands. These two methods lead to MILP problems. Their performance is compared with a quasi-static method, where provisioning is agnostic of the past and future demands.","PeriodicalId":158580,"journal":{"name":"2021 IEEE 22nd International Conference on High Performance Switching and Routing (HPSR)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129233050","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}
{"title":"Scalability analysis of a blockchain-based security strategy for complex IoT systems","authors":"M. Martínez, E. Marín-Tordera, X. Masip-Bruin","doi":"10.1109/HPSR52026.2021.9481865","DOIUrl":"https://doi.org/10.1109/HPSR52026.2021.9481865","url":null,"abstract":"Supply chains constitute a type of IoT system that is becoming increasingly complex today. Providing supply chains with cybersecurity guarantees is becoming a highly topic in current research. This interest is mainly rooted on the fact that supply chains may include different vulnerable components, such as those residing in factories, distribution centres, logistics, or transportation, just to name a few. Moreover, most of these components are controlled by different IoT devices, such as sensors and actuators, also becoming well-known sources of vulnerabilities, easing attackers access to the whole system. In this scenario, cyberattacks that use this weak link in a supply chain are increasing in the last years, as it has been largely reported in the literature. In this heterogeneous scenario, the key trend to facilitate cybersecurity provisioning sits on guaranteeing cyber-security in the entire supply chain, handled as a whole, that is, not separately for each individual component of the chain. In this paper, we propose an authentication/access mechanism for the weaker elements in a supply chain, i.e., the IoT devices, leveraging blockchain as the baseline technology, based on considering the generation of temporal tickets to have a higher access control.","PeriodicalId":158580,"journal":{"name":"2021 IEEE 22nd International Conference on High Performance Switching and Routing (HPSR)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132284841","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}
{"title":"ML-based Incast Performance Optimization in Software-Defined Data Centers","authors":"Kokouvi Bénoît Nougnanke, Y. Labit, M. Bruyère","doi":"10.1109/HPSR52026.2021.9481836","DOIUrl":"https://doi.org/10.1109/HPSR52026.2021.9481836","url":null,"abstract":"Traffic optimization is fundamental to achieve both great application performance and resource efficiency in data centers with heterogeneous workloads, including incast. However, general performance models, providing insights on how various factors affect a certain performance metric used in the network optimization process, are missing. For the special case of incast, the existing models are analytical models, either tightly coupled with a particular protocol version or specific to certain empirical data. This paper proposes an SDN-enabled machine-learning-based optimization framework for incast performance optimization in data center networks that leverages learning-based performance modeling. Evaluations based on intensive NS-3 simulations show that we can achieve accurate performance predictions that enable finding the efficient switch buffer space to achieve optimal incast completion time in different configurations. We expect this framework to be a building block for autonomous data center network management.","PeriodicalId":158580,"journal":{"name":"2021 IEEE 22nd International Conference on High Performance Switching and Routing (HPSR)","volume":"196 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132684122","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}
{"title":"InterS: Towards Inter-Slice Bandwidth Resource Sharing","authors":"Mohammed Chahbar, G. Diaz, Abdulhalim Dandoush","doi":"10.1109/HPSR52026.2021.9481833","DOIUrl":"https://doi.org/10.1109/HPSR52026.2021.9481833","url":null,"abstract":"A network slice (NS) is an isolated end-to-end (E2E) virtual and logical network created upon a customer request to fulfil the diverse requirements of a specific business use case. A fundamental issue in network slicing is the efficient share of the underlying physical network resources between network slices. This paper presents a proof of concept (PoC) of the inter-slice bandwidth resources sharing approach initially introduced by the IETF COMS information model. To the best of our knowledge, our PoC, so-called InterS, is the first to implement the data model and evaluate the performance of the concept via realistic intensive experiments in a Software Defined Network (SDN). Thus, InterS allows a congested NS to acquire temporary the free bandwidth resources of a neighbor slice and use them to serve its own traffic. Experiments have shown that InterS can significantly improves the operator’s network bandwidth usage as well as the flow acceptance rates under some specific network conditions.","PeriodicalId":158580,"journal":{"name":"2021 IEEE 22nd International Conference on High Performance Switching and Routing (HPSR)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129849406","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}