Experimental Evaluation of Algorithms for Packet Routing in Software Defined Network
Pavel Borisovsky, Anton V. Eremeev, Sergei Hrushev, Vadim Teplyakov · IFAC-PapersOnLine · 2022
The packet routing problem in a software defined network is formulated and a greedy algorithm is proposed. An alternative approach to approximately solve this problem by means of reduction to a special case of the fractional length-bounded maximum multicommodity flow is suggested. Experimental comparison of the greedy algorithm and a fully polynomial-time approximation scheme (FPTAS) for fractional length-bounded maximum multicommodity flow is carried out on the testing instances representing prospective software defined satellite network.