Experimental Evaluation of Algorithms for Packet Routing in Software Defined Network
2022; Elsevier BV; Volume: 55; Issue: 10 Linguagem: Inglês
10.1016/j.ifacol.2022.09.457
ISSN2405-8971
AutoresPavel Borisovsky, Anton V. Eremeev, Sergei Hrushev, Vadim Teplyakov,
Tópico(s)Advanced Optical Network Technologies
ResumoThe 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.
Referência(s)