TY - GEN
T1 - Preventive Model-based Verification and Repairing for SDN Requests
AU - Burdonov, Igor
AU - Kossachev, Alexandre
AU - Yevtushenko, Nina
AU - López, Jorge
AU - Kushik, Natalia
AU - Zeghlache, Djamal
N1 - Publisher Copyright:
Copyright © 2021 by SCITEPRESS - Science and Technology Publications, Lda. All rights reserved
PY - 2021/1/1
Y1 - 2021/1/1
N2 - Software Defined Networking (SDN) devices (e.g., switches) route traffic according to the configured flow rules, and thus a set of virtual paths gets implemented in the data plane. We propose a novel preventive approach for verifying that no misconfigurations (e.g., infinite loops), can occur given the requested set of paths. Such verification is essential since when configuring a set of data paths, other not requested and undesired paths (including loops) may be unintentionally configured. We show that for some cases the requested set of paths cannot be implemented without adding such undesired behavior, i.e., only a superset of the requested set can be implemented. We present a verification technique for detecting such issues of potential misconfigurations and estimate the complexity of the proposed method. Finally, we propose a technique for debugging and repairing a set of paths in such a way that the corrected set does not induce undesired paths into the data plane, if the latter is possible.
AB - Software Defined Networking (SDN) devices (e.g., switches) route traffic according to the configured flow rules, and thus a set of virtual paths gets implemented in the data plane. We propose a novel preventive approach for verifying that no misconfigurations (e.g., infinite loops), can occur given the requested set of paths. Such verification is essential since when configuring a set of data paths, other not requested and undesired paths (including loops) may be unintentionally configured. We show that for some cases the requested set of paths cannot be implemented without adding such undesired behavior, i.e., only a superset of the requested set can be implemented. We present a verification technique for detecting such issues of potential misconfigurations and estimate the complexity of the proposed method. Finally, we propose a technique for debugging and repairing a set of paths in such a way that the corrected set does not induce undesired paths into the data plane, if the latter is possible.
KW - Graph Paths
KW - Repairing
KW - Software Defined Networking
KW - Systems Engineering
KW - Verification
UR - https://www.scopus.com/pages/publications/85119010439
M3 - Conference contribution
AN - SCOPUS:85119010439
T3 - International Conference on Evaluation of Novel Approaches to Software Engineering, ENASE - Proceedings
SP - 421
EP - 428
BT - ENASE 2021 - Proceedings of the 16th International Conference on Evaluation of Novel Approaches to Software Engineering
A2 - Ali, Raian
A2 - Kaindl, Hermann
A2 - Maciaszek, Leszek
A2 - Maciaszek, Leszek
PB - Science and Technology Publications, Lda
T2 - 16th International Conference on Evaluation of Novel Approaches to Software Engineering, ENASE 2021
Y2 - 26 April 2021 through 27 April 2021
ER -