Test Derivation for the Software Defined Networking Platforms: Novel Fault Models and Test Completeness

Yevtushenko, Nina; Burdonov, Igor; Kossachev, Alexandre; Lonez, Jorge; Kushik, Natalia; Zeghlache, Djamal

doi:10.1109/ewdts.2018.8524712

Cited by 5 publications

(9 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Note that the the processing time of the algorithm is negligible in comparison with the data collection time penalty, and therefore, its increase is barely noticeable in the reported plot. The approaches presented in [3], [4] aim at performing model-based testing of the whole SDN framework using active testing techniques. After executing the test cases, the authors propose an approach to conclude about the implemented data-paths that inspired this work; their approach is based on specific traffic generation.…”

Section: Resultsmentioning

confidence: 99%

“…However, we assume that the discovery process is more reliable if it does not depend on information provided by the SDN network, i.e., the SUT. One of the reasons is that the discovery procedure may be used to estimate the correctness of the SUT [3], [4] (see Section V for related work). 2) In the data-plane, there are data generation / reception devices, i.e., hosts, and data forwarding devices (e.g., switches); hosts do not forward traffic, and forwarding devices do not generate / receive data.…”

Section: A Basic Conceptsmentioning

confidence: 99%

See 1 more Smart Citation

Identifying Running Data-paths in Software Defined Networking Driven Data-planes

Reyes

López

Zeghlache

2019

2019 IEEE 18th International Symposium on Network Computing and Applications (NCA)

Self Cite

View full text Add to dashboard Cite

In this paper, we propose an approach that relies on distributed traffic generation and monitoring to identify the operational data-paths in a given Software Defined Networking (SDN) driven data-plane. We show that under certain assumptions, there exist necessary and sufficient conditions for formally guaranteeing that all operational datapaths are discovered using our approach. In order to provide reliable communication within the SDN driven data-planes, assuring that the implemented data-paths are the requested (and expected) ones is necessary. This requires discovering the actual operational (running) data-paths in the data-plane. In SDN, different applications may configure different coexisting data-paths, the resulting data-paths a specific network flow traverses may not be the intended ones. Furthermore, the SDN components may be defected or compromised. We focus on discovering the operational data-paths on SDN driven dataplanes. However, the proposed approach is applicable to any data-plane where the operational data-paths must be verified and / or certified. A data-path discovery toolkit has been implemented. We describe the corresponding set of tools, and showcase the obtained experimental results that reveal inconsistencies in well-known SDN applications.

show abstract

Section: Resultsmentioning

confidence: 99%

Section: A Basic Conceptsmentioning

confidence: 99%

Identifying Running Data-paths in Software Defined Networking Driven Data-planes

Reyes

López

Zeghlache

2019

2019 IEEE 18th International Symposium on Network Computing and Applications (NCA)

Self Cite

View full text Add to dashboard Cite

show abstract

“…Вершины графа будем обозначать строчными буквами a, b, c, … x, y, z, пути -жирными строчными буквами p, q, r,…, а множества путей -прописными буквами -P, Q, R, … На рисунках коммутаторам соответствуют белые кружки, а хостам -чёрные кружки. Мы будем предполагать, что каждый хост x подсоединен ровно к одному коммутатору [3]. Поэтому хост -это терминальная вершина графа, т.е.…”

Section: основные понятияunclassified

“…Одной из основных технологий виртуализации [1][2][3][4][5] в настоящее время являются программно-конфигурируемые сети (SDN) с разделенными плоскостями данных и управления. Пакеты между хостами пересылаются на плоскости данных через промежуточные коммутаторы, система правил которых (настройка) осуществляется специальными SDN-контроллерами.…”

Section: Introductionunclassified

Secure Implementing a Virtual Network on the SDN Data Plane

Burdonov¹,

Евтушенко²,

Косачев³

2021

Proceedings of ISP RAS

View full text Add to dashboard Cite

The paper continues the investigations on the implementation of virtual networks on the SDN data plane which is modeled by a graph of physical connections between network nodes. A virtual network is defined as a set of ordered host pairs (sender, receiver), and it is implemented by a set of host-host paths that uniquely determine the switch settings. The opportunities to transmit a packet are limited by the host weights (priorities): a packet can be only transmitted from a host to a host if the sender has at most the same priority as the recipient, and thus, a set of paths is permissible if its every subset connects permissible host pairs. In the paper, it is proven that differently from the case when every host pair is permissible, in the graph with priorities a permissible path implementation does not exist for every set of permissible hosts. Moreover, it is shown that is some cases when such an implementation exists, the implementation is not possible without paths with cycles where packets can move infinite and without duplicate paths when a host can get the same packet several times. Using the notion of a perfect set of paths a criterion is established when every permissible set of hosts can be safely implemented by a set of paths without cycles but possibly with duplicate paths.

show abstract

“…Presently, software-defined networking (SDN) with separate data and control planes is one of the most popular virtualization technologies [1][2][3][4][5]. Packets between hosts are passed on the data plane through intermediate switches, the system of rules for which (setting) is determined by special SDN controllers.…”

Section: Introductionmentioning

confidence: 99%

Perfect Sets of Paths in the Full Graph of SDN Switches

Burdonov

Vinarskii

Yevtushenko

et al. 2021

Program Comput Soft

View full text Add to dashboard Cite

This paper investigates the implementation of virtual networks on the SDN data plane modeled by a graph of physical connections between network nodes. A virtual network is defined as a set of ordered host pairs (sender and receiver) and is implemented by a set of host-host paths that uniquely determine the settings of switches. A set of paths is said to be perfect if any subset of its paths can be implemented loop-free, i.e., without endless movement of packets in a loop, without duplicate paths (when the host receives the same packet several times), and without unintended paths (when the host receives a packet directed to some other host). In the case where the switchgraph is a complete graph, sufficient conditions for the existence of the largest perfect set of paths connecting all pairs of different hosts are established. Algorithms for constructing this largest perfect set are proposed and their complexity is estimated. The paper also reports preliminary results of conducted computer experiments, which suggest that the proposed sufficient conditions are not necessary ones.

show abstract

Test Derivation for the Software Defined Networking Platforms: Novel Fault Models and Test Completeness

Cited by 5 publications

References 5 publications

Identifying Running Data-paths in Software Defined Networking Driven Data-planes

Identifying Running Data-paths in Software Defined Networking Driven Data-planes

Secure Implementing a Virtual Network on the SDN Data Plane

Perfect Sets of Paths in the Full Graph of SDN Switches

Contact Info

Product

Resources

About