Experimental Evaluation of Algorithms for Packet Routing in Software Defined Network Full article
| Journal |
IFAC-PapersOnLine
ISSN: 2405-8963 |
||||
|---|---|---|---|---|---|
| Output data | Year: 2022, Volume: 55, Number: 10, Pages: 584-589 Pages count : 6 DOI: 10.1016/j.ifacol.2022.09.457 | ||||
| Tags | routing problem, software defined network, greedy algorithm, FPTAS, computational experiment | ||||
| Authors |
|
||||
| Affiliations |
|
Funding (1)
| 1 | Russian Science Foundation | 21-41-09017 |
Abstract:
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.
Cite:
Borisovsky P.
, Eremeev A.
, Hrushev S.
, Teplyakov V.
Experimental Evaluation of Algorithms for Packet Routing in Software Defined Network
IFAC-PapersOnLine. 2022. V.55. N10. P.584-589. DOI: 10.1016/j.ifacol.2022.09.457 WOS Scopus РИНЦ OpenAlex
Experimental Evaluation of Algorithms for Packet Routing in Software Defined Network
IFAC-PapersOnLine. 2022. V.55. N10. P.584-589. DOI: 10.1016/j.ifacol.2022.09.457 WOS Scopus РИНЦ OpenAlex
Identifiers:
| Web of science: | WOS:000881681700099 |
| Scopus: | 2-s2.0-85144496205 |
| Elibrary: | 59379623 |
| OpenAlex: | W4312869735 |