Annotation

Annotation: The aim of the study is to test the applicability of data flow balancing methods in software-defined networks (SDN) based on transport models and optimization algorithms to flow distribution. To achieve this goal, both traditional routing protocols (OSPF/ECMP) and the proposed optimization and heuristic algorithms (ILP, Greedy, MSA, FWA, USTM) were implemented in the experiment, as well as traffic generation scenarios simulating inter-pod and uniform loads. A comparative analysis was carried out using key network metrics - throughput and maximum channel load. The results showed that optimization and adaptive methods allow more efficient use of the available bandwidth and reduce channel congestion compared to traditional routing schemes. The findings of the study emphasize that the integration of transport models and optimization algorithms into the SDN architecture provides a stable and scalable basis for dynamic flow balancing, which is especially important for networks with high inter-pod traffic intensity. Particular attention in the study is paid to the aspect of increasing the total throughput of the network channel and the computational complexity of finding the optimal distribution.