Validation of SDN policies: a property-based testing perspective
Author(s) -
Laura M. Castro,
Nicolae Paladi
Publication year - 2019
Publication title -
procedia computer science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.334
H-Index - 76
ISSN - 1877-0509
DOI - 10.1016/j.procs.2019.09.439
Subject(s) - counterexample , computer science , software deployment , routing (electronic design automation) , set (abstract data type) , network topology , perspective (graphical) , node (physics) , property (philosophy) , isolation (microbiology) , distributed computing , software defined networking , software , computer network , software engineering , artificial intelligence , programming language , philosophy , mathematics , structural engineering , epistemology , discrete mathematics , microbiology and biotechnology , engineering , biology
Software-defined networks are being widely adopted and used in large and complex networks supporting critical operations. Their increasing importance highlights the need for effective validation of SDN topologies and routing policies both prior and during operation. The policies that configure an SDN deployment come from several, possibly conflicting sources. This may lead to undesired effects such as node isolation, network partitions, performance drops and routing loops. Such effects can be formulated as automatically testable reusable conditions using property-based testing (PBT). This approach allows to automatically determine and formulate as a counterexample the minimum set of conflicting rules. The approach is especially useful when policies are configured in an incremental manner. PBT techniques are particularly good at automatic counterexample shrinking and have the potential of being extremely effective in this area. (Less)
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom