The 16th Asia-Pacific Network Operations and Management Symposium 2014
DOI: 10.1109/apnoms.2014.6996558
|View full text |Cite
|
Sign up to set email alerts
|

Efficient model checking of OpenFlow networks using SDPOR-DS

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(3 citation statements)
references
References 5 publications
0
3
0
Order By: Relevance
“…However, the proposed mechanism seems to be very simple. Also, Yakuwa et al proposed a new model‐checking method of OpenFlow networks and a symbolic state transition model. A prototype of this method developed and estimated its performance.…”
Section: Formal Verification Methods In the Sdnmentioning
confidence: 99%
“…However, the proposed mechanism seems to be very simple. Also, Yakuwa et al proposed a new model‐checking method of OpenFlow networks and a symbolic state transition model. A prototype of this method developed and estimated its performance.…”
Section: Formal Verification Methods In the Sdnmentioning
confidence: 99%
“…However, it suffers from the state explosion problem, which makes it difficult to check SDN programs. Yakuwa et al [158] proposed a novel method: SDPOR-DS. They reduced the state space (e.g., by orders of network events) using dynamic partial-order reduction (DPOR) [159].…”
Section: Techniques For Networkmentioning
confidence: 99%
“…To address the scalability challenge, these methods always perform domain optimization. For instance, Yakuwa et al [158] optimized their model checking with dynamic partial-order reduction.…”
Section: ) Conclusion On Control Planementioning
confidence: 99%