This article is cited in 2 papers

Consistency analysis of software-defined networks reconfiguration

A. A. Grusho^a, I. Yu. Teryokhina<sup>b

a</sup> Institute of Informatics Problems, Federal Research Center "Computer Science and Control" of the Russian Academy of Sciences, 44-2 Vavilov Str., Moscow, 119333, Russian Federation
^b Faculty of Computational Mathematics and Cybernetics, M. V. Lomonosov Moscow State University, 1-52 Leninskiye Gory, GSP-1, Moscow 119991, Russian Federation

Abstract: The paper studies the software-defined networks (SDN) reconfiguration problem, considering presence of consistency properties while updating the route tables. Generally, SDN is represented as an oriented graph, but consistency properties can be formulated in various ways. The SDN reconfiguration problem with respect to consistency properties is an NP-hard problem for most cases. The paper defines the SDN model as an undirected graph and formulates the reconfiguration problem for this model that satisfies the loop-free consistency property while the network updates. For the introduced model, the worst-case quadratic algorithm of building the corresponding reconfiguration sequence from one configuration to another is proposed.

Keywords: software-defined network; reconfiguration problem; consistency; network updates.

Received: 26.04.2017

DOI: 10.14357/08696527170302

Bibliographic databases:

•