TY - GEN
T1 - Identifying Running Data-paths in Software Defined Networking Driven Data-planes
AU - Reyes, Jose
AU - Lopez, Jorge
AU - Zeghlache, Djamal
N1 - Publisher Copyright:
© 2019 IEEE.
PY - 2019/9/1
Y1 - 2019/9/1
N2 - In Software Defined Networking (SDN), different applications may configure different coexisting forwarding rules, the resulting (running) data-paths a specific network flow traverses may not be the intended ones. Furthermore, the SDN components may be defective or compromised. In order to provide reliable communication within the SDN driven data-planes, assuring that the running data-paths are the requested (and expected) ones is necessary. In this paper, we propose an approach that relies on distributed traffic generation and monitoring to identify the running data-paths in a given SDN driven data-plane. We show that differently from the existing approaches, under certain assumptions, there exist necessary and sufficient conditions for formally guaranteeing that all running datapaths are discovered using our approach. A data-path discovery toolkit has been implemented using the proposed approach. We describe the corresponding set of tools, and showcase the obtained experimental results that reveal inconsistencies in well-known SDN applications. Additionally, we show the scalability of our approach.
AB - In Software Defined Networking (SDN), different applications may configure different coexisting forwarding rules, the resulting (running) data-paths a specific network flow traverses may not be the intended ones. Furthermore, the SDN components may be defective or compromised. In order to provide reliable communication within the SDN driven data-planes, assuring that the running data-paths are the requested (and expected) ones is necessary. In this paper, we propose an approach that relies on distributed traffic generation and monitoring to identify the running data-paths in a given SDN driven data-plane. We show that differently from the existing approaches, under certain assumptions, there exist necessary and sufficient conditions for formally guaranteeing that all running datapaths are discovered using our approach. A data-path discovery toolkit has been implemented using the proposed approach. We describe the corresponding set of tools, and showcase the obtained experimental results that reveal inconsistencies in well-known SDN applications. Additionally, we show the scalability of our approach.
KW - Data-plane analysis
KW - Distributed test case generation
KW - Run-time monitoring
KW - Software Defined Networking
U2 - 10.1109/NCA.2019.8935031
DO - 10.1109/NCA.2019.8935031
M3 - Conference contribution
AN - SCOPUS:85077967495
T3 - 2019 IEEE 18th International Symposium on Network Computing and Applications, NCA 2019
BT - 2019 IEEE 18th International Symposium on Network Computing and Applications, NCA 2019
A2 - Gkoulalas-Divanis, Aris
A2 - Marchetti, Mirco
A2 - Avresky, Dimiter R.
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 18th IEEE International Symposium on Network Computing and Applications, NCA 2019
Y2 - 26 September 2019 through 28 September 2019
ER -