Inverse and Direct Maxflow Problem Study on the Free-Oriented ST-Planar Network Graph
The issues of telecommunication network engineering are considered in the context of digital flows optimal scheduling. Introduced the concept of the free-oriented network graph as an enhanced math model of the modern software defined networking technologies with dynamic channel configuration. Normal...
| Main Authors: | , , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Anhalt University of Applied Sciences
2023-11-01
|
| Series: | Proceedings of the International Conference on Applied Innovations in IT |
| Subjects: | |
| Online Access: | https://icaiit.org/paper.php?paper=11th_ICAIIT_2/1_1 |
| _version_ | 1827383744802062336 |
|---|---|
| author | Victor Tikhonov Serhii Nesterenko Abdullah Taher Olena Tykhonova Olexandra Tsyra Olha Yavorska Kateryna Shulakova |
| author_facet | Victor Tikhonov Serhii Nesterenko Abdullah Taher Olena Tykhonova Olexandra Tsyra Olha Yavorska Kateryna Shulakova |
| author_sort | Victor Tikhonov |
| collection | DOAJ |
| description | The issues of telecommunication network engineering are considered in the context of digital flows optimal scheduling. Introduced the concept of the free-oriented network graph as an enhanced math model of the modern software defined networking technologies with dynamic channel configuration. Normalized the framework of ST-planar network graph for the MaxFlow problem analysis. Formulated the inverse and direct tasks of network MaxFlow problem on the ST-planar free-oriented network graph concerning conventional Ford-Fulkerson approach and SDN virtual infrastructure design respectively. The inverse MaxFlow problem is formalized in terms of discrete optimization on Pontryagin maximum principle. The direct MaxFlow problem exhibited as graph templates generation combinatorial procedure by alternative criteria of flow paths shortest lengths or maximal diversity of paths. Specified the terms of "topology" and "metrics" for open twopole software defined network in the form of vertices' relation matrix, along with the tensors of ST-paths and ST-flows. The properties of planar graph have been studied as functions of vertices number, including the edges quantity, ST-flows tensor dimensions and paths' length distribution. The direct MaxFlow problem formalism can be used for automated testing the algorithms of classical inverse MaxFlow task, as well as generation the comprehensive teaching sequence for artificial intellect machine learning |
| first_indexed | 2024-03-08T14:44:39Z |
| format | Article |
| id | doaj.art-1b44a25da48a4a0a8da573ea2f14cdd5 |
| institution | Directory Open Access Journal |
| issn | 2199-8876 |
| language | English |
| last_indexed | 2024-03-08T14:44:39Z |
| publishDate | 2023-11-01 |
| publisher | Anhalt University of Applied Sciences |
| record_format | Article |
| series | Proceedings of the International Conference on Applied Innovations in IT |
| spelling | doaj.art-1b44a25da48a4a0a8da573ea2f14cdd52024-01-11T11:13:17ZengAnhalt University of Applied SciencesProceedings of the International Conference on Applied Innovations in IT2199-88762023-11-01112110http://dx.doi.org/10.25673/112988Inverse and Direct Maxflow Problem Study on the Free-Oriented ST-Planar Network GraphVictor Tikhonov0https://orcid.org/0000-0003-4415-5234Serhii Nesterenko1https://orcid.org/0000-0002-3757-6594Abdullah Taher2Olena Tykhonova3https://orcid.org/0000-0002-0921-422XOlexandra Tsyra4https://orcid.org/0000-0003-3552-2039Olha Yavorska5https://orcid.org/0000-0002-1790-7472Kateryna Shulakova6https://orcid.org/0000-0002-0035-6184Department of Computer Engineering and Information Systems, State University of Intelligent Technologies and Telecommunications, Kuznechna Str. 1, Odesa, UkraineDepartment of Computer Intellectual Systems and Networks, Odesa Polytechnic National University, Shevchenko Avenue 1, Odesa, UkraineDepartment of Electronic and Communication Engineering, College of Engineering, Al-Qadisiyah University, IraqDepartment of Computer Engineering and Information Systems, State University of Intelligent Technologies and Telecommunications, Kuznechna Str. 1, Odesa, UkraineDepartment of Computer Engineering and Information Systems, State University of Intelligent Technologies and Telecommunications, Kuznechna Str. 1, Odesa, UkraineDepartment of Computer Engineering and Information Systems, State University of Intelligent Technologies and Telecommunications, Kuznechna Str. 1, Odesa, UkraineDepartment of Computer Engineering and Information Systems, State University of Intelligent Technologies and Telecommunications, Kuznechna Str. 1, Odesa, Ukraine / Anhalt University of Applied Sciences, Bernburger Str. 55, Köthen, GermanyThe issues of telecommunication network engineering are considered in the context of digital flows optimal scheduling. Introduced the concept of the free-oriented network graph as an enhanced math model of the modern software defined networking technologies with dynamic channel configuration. Normalized the framework of ST-planar network graph for the MaxFlow problem analysis. Formulated the inverse and direct tasks of network MaxFlow problem on the ST-planar free-oriented network graph concerning conventional Ford-Fulkerson approach and SDN virtual infrastructure design respectively. The inverse MaxFlow problem is formalized in terms of discrete optimization on Pontryagin maximum principle. The direct MaxFlow problem exhibited as graph templates generation combinatorial procedure by alternative criteria of flow paths shortest lengths or maximal diversity of paths. Specified the terms of "topology" and "metrics" for open twopole software defined network in the form of vertices' relation matrix, along with the tensors of ST-paths and ST-flows. The properties of planar graph have been studied as functions of vertices number, including the edges quantity, ST-flows tensor dimensions and paths' length distribution. The direct MaxFlow problem formalism can be used for automated testing the algorithms of classical inverse MaxFlow task, as well as generation the comprehensive teaching sequence for artificial intellect machine learninghttps://icaiit.org/paper.php?paper=11th_ICAIIT_2/1_1telecommunication networkmaximal flowfree oriented planar graphsdn |
| spellingShingle | Victor Tikhonov Serhii Nesterenko Abdullah Taher Olena Tykhonova Olexandra Tsyra Olha Yavorska Kateryna Shulakova Inverse and Direct Maxflow Problem Study on the Free-Oriented ST-Planar Network Graph Proceedings of the International Conference on Applied Innovations in IT telecommunication network maximal flow free oriented planar graph sdn |
| title | Inverse and Direct Maxflow Problem Study on the Free-Oriented ST-Planar Network Graph |
| title_full | Inverse and Direct Maxflow Problem Study on the Free-Oriented ST-Planar Network Graph |
| title_fullStr | Inverse and Direct Maxflow Problem Study on the Free-Oriented ST-Planar Network Graph |
| title_full_unstemmed | Inverse and Direct Maxflow Problem Study on the Free-Oriented ST-Planar Network Graph |
| title_short | Inverse and Direct Maxflow Problem Study on the Free-Oriented ST-Planar Network Graph |
| title_sort | inverse and direct maxflow problem study on the free oriented st planar network graph |
| topic | telecommunication network maximal flow free oriented planar graph sdn |
| url | https://icaiit.org/paper.php?paper=11th_ICAIIT_2/1_1 |
| work_keys_str_mv | AT victortikhonov inverseanddirectmaxflowproblemstudyonthefreeorientedstplanarnetworkgraph AT serhiinesterenko inverseanddirectmaxflowproblemstudyonthefreeorientedstplanarnetworkgraph AT abdullahtaher inverseanddirectmaxflowproblemstudyonthefreeorientedstplanarnetworkgraph AT olenatykhonova inverseanddirectmaxflowproblemstudyonthefreeorientedstplanarnetworkgraph AT olexandratsyra inverseanddirectmaxflowproblemstudyonthefreeorientedstplanarnetworkgraph AT olhayavorska inverseanddirectmaxflowproblemstudyonthefreeorientedstplanarnetworkgraph AT katerynashulakova inverseanddirectmaxflowproblemstudyonthefreeorientedstplanarnetworkgraph |