G. Marchetto, R. Sisto, Jalolliddin Yusupov, A. Ksentini
{"title":"Formally verified latency-aware VNF placement in industrial Internet of things","authors":"G. Marchetto, R. Sisto, Jalolliddin Yusupov, A. Ksentini","doi":"10.1109/WFCS.2018.8402355","DOIUrl":null,"url":null,"abstract":"The innovative applications of 5G core technologies, namely Software Defined Networking (SDN) and Network Function Virtualization (NFV), are the key enabling technologies of industrial Internet of things (IIoT) to improve data network robustness. In the industrial scenario, with strict demands on end-to-end latency and reliability during critical events, these technologies can be leveraged to construct chains of network functions (service graphs) characterized by guarantees about latency, jitter, packet loss or redundancy. Moreover, real-time monitoring techniques provided by network virtualization help in mitigating critical events (e.g. failures or network attacks), which can be faced by updating the service graph and imposing new policies in the network. In practice, the distributed and safety-critical nature of IIoT applications requires both an intelligent placement of services across physically separated locations, which has a direct impact on latency, and a proper policy enforcement system, which guarantees service reliability, safety, and security. This paper considers both aspects by proposing a novel Virtual Network Function (VNF) placement solution for IIoT that minimizes the overall latency and, at the same time, also verifies that network-wide policies such as connectivity or isolation hold between the endpoints. In particular, this work relies on recent advances in SMT (Satisfiability Modulo Theories) solvers, which are being enhanced to solve the Maximum Satisfiability (MaxSAT) problem.","PeriodicalId":350991,"journal":{"name":"2018 14th IEEE International Workshop on Factory Communication Systems (WFCS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 14th IEEE International Workshop on Factory Communication Systems (WFCS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WFCS.2018.8402355","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 15
Abstract
The innovative applications of 5G core technologies, namely Software Defined Networking (SDN) and Network Function Virtualization (NFV), are the key enabling technologies of industrial Internet of things (IIoT) to improve data network robustness. In the industrial scenario, with strict demands on end-to-end latency and reliability during critical events, these technologies can be leveraged to construct chains of network functions (service graphs) characterized by guarantees about latency, jitter, packet loss or redundancy. Moreover, real-time monitoring techniques provided by network virtualization help in mitigating critical events (e.g. failures or network attacks), which can be faced by updating the service graph and imposing new policies in the network. In practice, the distributed and safety-critical nature of IIoT applications requires both an intelligent placement of services across physically separated locations, which has a direct impact on latency, and a proper policy enforcement system, which guarantees service reliability, safety, and security. This paper considers both aspects by proposing a novel Virtual Network Function (VNF) placement solution for IIoT that minimizes the overall latency and, at the same time, also verifies that network-wide policies such as connectivity or isolation hold between the endpoints. In particular, this work relies on recent advances in SMT (Satisfiability Modulo Theories) solvers, which are being enhanced to solve the Maximum Satisfiability (MaxSAT) problem.