Static equivalence checking for openflow networks

Hyuk Lee, Jin Young Choi

Research output: Contribution to journalArticlepeer-review

Abstract

Software-defined networking (SDN) provides many advantages over traditional networking by separating the control and data planes. One of the advantages is to provide programmability, which allows administrators to control the behavior of the network. The network configuration may need to be changed for some reason. Whenever such changes are made, it can be required to verify that the forwarding behavior is preserved from the existing configuration, that is, whether the ruleset is properly reflected. In this paper, we propose the forwarding behavior based equivalence checking of OpenFlow networks. We present the formal definition of the network model and the forwarding behavior of the packet flow. Based on the definition, We present a method for checking the equivalence of OpenFlow network forwarding behaviors. Next, we present the implementation of the proposed method, using the constraint satisfaction method, which will be the basis for further extension.

Original languageEnglish
Article number2207
JournalElectronics (Switzerland)
Volume10
Issue number18
DOIs
Publication statusPublished - 2021 Sep

Keywords

  • Constraint satisfaction problem
  • Formal modeling
  • Forwarding behavior equivalence check
  • OpenFlow
  • Software-defined networking

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Signal Processing
  • Hardware and Architecture
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Static equivalence checking for openflow networks'. Together they form a unique fingerprint.

Cite this