Verifiably-safe software-defined networks for CPS

  • Authors:

  • Richard William Skowyra;Andrei Lapets;Azer Bestavros;Assaf Kfoury

  • Affiliations:

  • Boston University, Boston, MA, USA;Boston University, Boston, MA, USA;Boston University, Boston, MA, USA;Boston University, Boston, MA, USA

  • Venue:
  • Proceedings of the 2nd ACM international conference on High confidence networked systems
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

Next generation cyber-physical systems (CPS) are expected to be deployed in domains which require scalability as well as performance under dynamic conditions. This scale and dynamicity will require that CPS communication networks be programmatic (i.e., not requiring manual intervention at any stage), but still maintain iron-clad safety guarantees. Software-defined networking standards like Openflow provide a means for scalably building tailor-made network architectures, but there is no guarantee that these systems are safe, correct, or secure. In this work we propose a methodology and accompanying tools for specifying and modeling distributed systems such that existing formal verification techniques can be transparently used to analyze critical requirements and properties prior to system implementation. We demonstrate this methodology by iteratively modeling and verifying an Openflow learning switch network with respect to network correctness, network convergence, and mobility-related properties. We posit that a design strategy based on the complementary pairing of software-defined networking and formal verification would enable the CPS community to build next-generation systems without sacrificing the safety and reliability that these systems must deliver.