Modeling of the Multiple Paths Finding Algorithm for Software-Defined Network

As technologies for broadband access to the global network develop, so does the load on it, and accordingly, new ways to ensure quality of service are required, one of which is the use of the SDN concept. At the same time, most of the algorithms are borrowed from classical communication networks, which cannot fully meet the QoS requirements; accordingly, it is necessary to develop new methods and algorithms for data transmission, including the search for information transmission routes and their subsequent evaluation. The paper presents a simulation model of the bidirectional search algorithm for a set of paths on a graph, which allows finding all paths between two vertices, including those that intersect. Simulation modeling has shown that the presented solution has up to 35% lower time complexity, which has a positive effect on the overall network packet transmission delay.