Static Equivalence Checking for OpenFlow Networks
- Authors
- Lee, Hyuk; Choi, Jin-Young
- Issue Date
- 9월-2021
- Publisher
- MDPI
- Keywords
- OpenFlow; constraint satisfaction problem; formal modeling; forwarding behavior equivalence check; software-defined networking
- Citation
- ELECTRONICS, v.10, no.18
- Indexed
- SCIE
SCOPUS
- Journal Title
- ELECTRONICS
- Volume
- 10
- Number
- 18
- URI
- https://scholar.korea.ac.kr/handle/2021.sw.korea/136689
- DOI
- 10.3390/electronics10182207
- ISSN
- 2079-9292
- 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.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - School of Cyber Security > Department of Information Security > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.