@article{2022ACC,
  author    = {Daniele Bringhenti and
               Fulvio Valenza},
  title     = {A Twofold Model for {VNF} Embedding and Time-Sensitive Network Flow
               Scheduling},
  journal   = {{IEEE} Access},
  volume    = {10},
  pages     = {44384--44399},
  year      = {2022},
  url       = {https://iris.polito.it/retrieve/handle/11583/2962049/579649/OnlineVersion.pdf},
  doi       = {10.1109/ACCESS.2022.3169863},
  abstract={The revolution that Industrial Control Systems are undergoing is reshaping the traditional
network management and it is introducing new challenges. After the advent of network virtualization,
an enhanced level of automation has been required to cope with the safety-critical mission of industrial
systems and strict requirements for end-to-end latency. In the literature, there have been attempts to
automatically solve two strictly interconnected problems for the management of virtual industrial networks:
the Virtual Network Function embedding and the time-sensitive flow scheduling problems. However, dealing
with these problems separately can lead to unoptimized results, or in the worst case to situations where the
latency requirements cannot be satisfied because of a poorly chosen function embedding. In light of these
motivations, this paper proposes a formal approach to jointly solve the two problems through an Optimization
Satisfiability Modulo Theories formulation. This choice also allows combining two vital features: a formal
guarantee of the solution correctness and optimization targeting the minimization of the end-to-end delay for
flow scheduling. The feasibility of the proposed approach has been validated by implementing a prototype
framework and experimentally testing it on realistic use cases.},
  keywords={Security Function Modeling,Policy Verification}, 	
}

{"_id":"2Wub6cYDTTgDkhnh3","bibbaseid":"bringhenti-valenza-atwofoldmodelforvnfembeddingandtimesensitivenetworkflowscheduling-2022","author_short":["Bringhenti, D.","Valenza, F."],"bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Daniele"],"propositions":[],"lastnames":["Bringhenti"],"suffixes":[]},{"firstnames":["Fulvio"],"propositions":[],"lastnames":["Valenza"],"suffixes":[]}],"title":"A Twofold Model for VNF Embedding and Time-Sensitive Network Flow Scheduling","journal":"IEEE Access","volume":"10","pages":"44384–44399","year":"2022","url":"https://iris.polito.it/retrieve/handle/11583/2962049/579649/OnlineVersion.pdf","doi":"10.1109/ACCESS.2022.3169863","abstract":"The revolution that Industrial Control Systems are undergoing is reshaping the traditional network management and it is introducing new challenges. After the advent of network virtualization, an enhanced level of automation has been required to cope with the safety-critical mission of industrial systems and strict requirements for end-to-end latency. In the literature, there have been attempts to automatically solve two strictly interconnected problems for the management of virtual industrial networks: the Virtual Network Function embedding and the time-sensitive flow scheduling problems. However, dealing with these problems separately can lead to unoptimized results, or in the worst case to situations where the latency requirements cannot be satisfied because of a poorly chosen function embedding. In light of these motivations, this paper proposes a formal approach to jointly solve the two problems through an Optimization Satisfiability Modulo Theories formulation. This choice also allows combining two vital features: a formal guarantee of the solution correctness and optimization targeting the minimization of the end-to-end delay for flow scheduling. The feasibility of the proposed approach has been validated by implementing a prototype framework and experimentally testing it on realistic use cases.","keywords":"Security Function Modeling,Policy Verification","bibtex":"@article{2022ACC,\r\n author = {Daniele Bringhenti and\r\n Fulvio Valenza},\r\n title = {A Twofold Model for {VNF} Embedding and Time-Sensitive Network Flow\r\n Scheduling},\r\n journal = {{IEEE} Access},\r\n volume = {10},\r\n pages = {44384--44399},\r\n year = {2022},\r\n url = {https://iris.polito.it/retrieve/handle/11583/2962049/579649/OnlineVersion.pdf},\r\n doi = {10.1109/ACCESS.2022.3169863},\r\n abstract={The revolution that Industrial Control Systems are undergoing is reshaping the traditional\r\nnetwork management and it is introducing new challenges. After the advent of network virtualization,\r\nan enhanced level of automation has been required to cope with the safety-critical mission of industrial\r\nsystems and strict requirements for end-to-end latency. In the literature, there have been attempts to\r\nautomatically solve two strictly interconnected problems for the management of virtual industrial networks:\r\nthe Virtual Network Function embedding and the time-sensitive flow scheduling problems. However, dealing\r\nwith these problems separately can lead to unoptimized results, or in the worst case to situations where the\r\nlatency requirements cannot be satisfied because of a poorly chosen function embedding. In light of these\r\nmotivations, this paper proposes a formal approach to jointly solve the two problems through an Optimization\r\nSatisfiability Modulo Theories formulation. This choice also allows combining two vital features: a formal\r\nguarantee of the solution correctness and optimization targeting the minimization of the end-to-end delay for\r\nflow scheduling. The feasibility of the proposed approach has been validated by implementing a prototype\r\nframework and experimentally testing it on realistic use cases.},\r\n keywords={Security Function Modeling,Policy Verification}, \t\r\n}\r\n\r\n","author_short":["Bringhenti, D.","Valenza, F."],"key":"2022ACC-1","id":"2022ACC-1","bibbaseid":"bringhenti-valenza-atwofoldmodelforvnfembeddingandtimesensitivenetworkflowscheduling-2022","role":"author","urls":{"Paper":"https://iris.polito.it/retrieve/handle/11583/2962049/579649/OnlineVersion.pdf"},"keyword":["Security Function Modeling","Policy Verification"],"metadata":{"authorlinks":{}},"downloads":3},"bibtype":"article","biburl":"https://raw.githubusercontent.com/FulvioValenza/bibliography/main/Valenza_bibliography.bib","dataSources":["oHcDH9GXBbkp4t9gm","JbiX35GNqPCF3nids","hZL94qE5m3pMWuJwA","8EGSmY4udryikjQyX","XZnEt8kdXurbtCWoc"],"keywords":["security function modeling","policy verification"],"search_terms":["twofold","model","vnf","embedding","time","sensitive","network","flow","scheduling","bringhenti","valenza"],"title":"A Twofold Model for VNF Embedding and Time-Sensitive Network Flow Scheduling","year":2022,"downloads":3}