Studying Load Issues in Software-Defined Networks

Abstract

The purpose of the work is to study the possibility of implementing virtual networks taking into account various parameters and their adjustments in software-configurable structures modeled by a weighted data plane graph. The work examines parameters of “resource” and “cost” types. For a resource type parameter, an edge is augmented with its “capacity,” and the number of paths passing through the edge must not exceed the edge’s capacity. For a parameter of the “cost” type, the path weight is the sum of the weights of the edges and the task of minimizing the weight of the path is set. For implementing a virtual network on a weighted graph, an algorithm for adjusting a virtual network taking into account parameters of the “resource” type and two algorithms for constructing a virtual network taking into account parameters of the “cost” type are proposed. In the latter case, one algorithm builds one path from each host to one host of the given subset of target hosts; another algorithm builds a set of paths for each host: one path to one host from each set of a family of sets of target hosts.