Static Equivalence Checking for OpenFlow Networks

被引:0
|
作者
Lee, Hyuk [1 ]
Choi, Jin-Young [1 ]
机构
[1] Korea Univ, Sch Cybersecur, Seoul 02841, South Korea
基金
新加坡国家研究基金会;
关键词
software-defined networking; OpenFlow; forwarding behavior equivalence check; formal modeling; constraint satisfaction problem; SOFTWARE-DEFINED NETWORKING; VERIFICATION;
D O I
10.3390/electronics10182207
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页数:17
相关论文
共 50 条
  • [1] Checking Equivalence for Reo Networks
    Blechmann, Tobias
    Baier, Christel
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2008, 215 : 209 - 226
  • [2] Efficient Model Checking of OpenFlow Networks Using SDPOR-DS
    Yakuwa, Yutaka
    Tomizawa, Nobuyuki
    Tonouchi, Toshio
    2014 16TH ASIA-PACIFIC NETWORK OPERATIONS AND MANAGEMENT SYMPOSIUM (APNOMS), 2014,
  • [3] SymNet: Static Checking for Stateful Networks
    Stoenescu, Radu
    Popovici, Matei
    Negreanu, Lorina
    Raiciu, Costin
    PROCEEDINGS OF THE 2013 WORKSHOP ON HOT TOPICS IN MIDDLEBOXES AND NETWORK FUNCTION VIRTUALIZATION (HOTMIDDLEBOX'13), 2013, : 31 - 36
  • [4] Efficient algorithms for checking the equivalence of multistage interconnection networks
    Calamoneri, T
    Massini, A
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2004, 64 (01) : 135 - 150
  • [5] Equivalence Checking of Static Affine Programs Using Widening to Handle Recurrences
    Verdoolaege, Sven
    Janssens, Gerda
    Bruynooghe, Maurice
    COMPUTER AIDED VERIFICATION, PROCEEDINGS, 2009, 5643 : 599 - 613
  • [6] Enhancing SAT-based equivalence checking with static logic implications
    Arora, R
    Hsiao, MS
    EIGHTH IEEE INTERNATIONAL HIGH-LEVEL DESIGN VALIDATION AND TEST WORKSHOP, PROCEEDINGS, 2003, : 63 - 68
  • [7] Equivalence Checking of Static Affine Programs Using Widening to Handle Recurrences
    Verdoolaege, Sven
    Janssens, Gerda
    Bruynooghe, Maurice
    ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 2012, 34 (03):
  • [8] Checking the OpenFlow Rule Installation and Operational Verification
    Aryan, Ramtin
    Brattensborg, Frode
    Yazidi, Anis
    Engelstad, Paal Einar
    PROCEEDINGS OF THE IEEE LCN: 2019 44TH ANNUAL IEEE CONFERENCE ON LOCAL COMPUTER NETWORKS (LCN 2019), 2019, : 250 - 253
  • [9] Model Checking Invariant Security Properties in OpenFlow
    Son, Sooel
    Shin, Seungwon
    Yegneswaran, Vinod
    Porras, Phillip
    Gu, Guofei
    2013 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2013,
  • [10] Sequential equivalence checking
    Mathur, A
    Fujita, M
    Balakrishnan, M
    Mitra, R
    19TH INTERNATIONAL CONFERENCE ON VLSI DESIGN, PROCEEDINGS, 2005, : 18 - 19