Pavel Borisovsky, Anton V. Eremeev, Sergei Hrushev, Vadim Teplyakov, Mikhail Vorozhtsov,
The paper presents a comparison between three approaches to solving the length-bounded maximum multicommodity flow problem with unit edge-lengths. Following the first approach, Garg and K?nemann?s, we developed an improved fully polynomial time approximation scheme for this problem. As the second alternative, we considered the well-known greedy approach. The third approach is the one that yields exact solutions by means of a standard LP solver applied to an LP model on the time-expanded network. ...
Tópico(s): Advanced Graph Theory Research
2018 - University of Belgrade | Yugoslav journal of operations research
Pavel Borisovsky, Anton V. Eremeev, Sergei Hrushev, Vadim Teplyakov,
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 ...
Tópico(s): Advanced Optical Network Technologies
2022 - Elsevier BV | IFAC-PapersOnLine