Testing switch rules in software defined networks

Burdonov, Igor; Евтушенко, Н. В.; Косачев, Александр Сергеевич

doi:10.15514/ispras-2018-30(6)-4

Cited by 3 publications

(5 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…If two edge-simple complete paths from P, upon merging on edge ab, get separated (after this or some other edge), i.e., if they have forms xpabqy and x'p'abq'y with different initial and end hosts x ≠ x' and y ≠ y', then new paths xpabq'y' and x'p'abqy are generated. This operation of generating new paths is called edge closure; the result of edge closure of all pairs of paths from P is denoted as P↓↑ [4,5]. Obviously, P ⊆ P↓↑.…”

Section: Preliminariesmentioning

confidence: 99%

“…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%

“…It is well-known that, when solving the first problem, there are three factors that do not allow an arbitrary set of host-host paths to be implemented through switch settings. First, as shown in [4,5], when implementing a set of edge-simple host-host paths, paths not included in a given set can occur on the data plane; in addition, there can be loops in which packets are sent endlessly and, therefore, are endlessly cloned. Moreover, duplicate paths can occur, causing a destination host to receive the same packet several times (rather than once); the usefulness and harmfulness of this phenomenon were investigated in [7].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

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

Section: Preliminariesmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

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

show abstract

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

Section: Introductionunclassified

“…имеют вид xpabqy и x`p`abq`y` с разными начальными и конечными хостами x  x` и y  y`, то порождаются и новые пути xpabq`y` и x`p`abqy. Эта операция порождения новых путей называется замыканием по дугам, а результат замыкания по дугам всех пар путей из P обозначается P[4][5]. Очевидно, P  P.…”

unclassified

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