INVERSE AND DIRECT MAXFLOW PROBLEM STUDY ON THE FREE-ORIENTED ST-PLANAR NETWORK GRAPH

Simple item page
dc.contributor.authorТіхонов В. І.
dc.contributor.authorTikhonov V. I.
dc.contributor.authorНестеренко С.
dc.contributor.authorNesterenko S.
dc.contributor.authorТагер А.
dc.contributor.authorTaher A.
dc.contributor.authorТіхонова О. В.
dc.contributor.authorTikhonova O.
dc.contributor.authorЦира О. В.
dc.contributor.authorTsyra O.
dc.contributor.authorЯворська О. М.
dc.contributor.authorYavorska O.
dc.contributor.authorШулакова К. С.
dc.contributor.authorShulakova K. S.
dc.date.accessioned2025-01-13T12:30:44Z
dc.date.available2025-01-13T12:30:44Z
dc.date.issued2023
dc.descriptionInverse and Direct Maxflow Problem Study on the Free-Oriented ST-Planar Network Graph / Tikhonov V. [et al.] // Proceedings of International Conference on Applied Innovation in IT. (Koethen, 30 November, 2023). Koethen, 2023. Vol. 11. №2. P. 1-10. URL : https://icaiit.org/paper.php?paper=11th_ICAIIT_2/1_1
dc.description.abstractThe issues of data flow optimization in telecommunication networks are considered. The analyses of the problem state of art shows the primarily utilization of logistic Maxflow model on ST-planar directed network graph with predetermined fixed metric. Concluded, that conventional logistic Maxflow model is not adequate to modern telecoms with flexibly reconfigured channels. Introduced the concept of the free-oriented network graph as an enhanced math-model for digital flows simulation. The inverse and direct Maxflow tasks are formulated on the normalised free-oriented ST-planar network graph, and the properties of the graph obtained as functions of vertices number.The direct Maxflow task is studied in tensor form, and the algorithm of test-sequences generation for the inverse Maxflow task is constructed. The inverse Maxflow problem has been analyzed as a discrete optimization task on the Pontryagin maximum principle with two necessary extremum conditions. Related computation algorithm is built with polynomial complexity. Unlike the known approaches, proposed method is relevant to data flow optimization in the software defined networks with dynamically reconfigurable channels. Along with the maximal flow, the flow distribution over the network structure provided. The formalism of the direct Maxflow task can be used for testing the algorithms of inverse Maxflow task solutions, and generation the training sequences for machine learning in AI models.
dc.identifier.issn2199-8876
dc.identifier.urihttp://193.186.15.27:4000/handle/123456789/632
dc.language.isoen
dc.publisherAnhalt University of Applied Sciences
dc.subjectTelecommunication Network
dc.subjectMaximal Flow
dc.subjectFree Oriented Planar Graph
dc.subjectSDN
dc.titleINVERSE AND DIRECT MAXFLOW PROBLEM STUDY ON THE FREE-ORIENTED ST-PLANAR NETWORK GRAPH
dc.title.alternativeДОСЛІДЖЕННЯ ПРОБЛЕМИ ОБЕРНЕНОГО ТА ПРЯМОГО МАКСИМАЛЬНОГО ПОТОКУ НА ВІЛЬНО-ОРІЄНТОВАНОМУ ST-ПЛОСКОМУ ГРАФІ МЕРЕЖІ
dc.typeArticle

Files

Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
1_1_ICAIIT_Paper_2023(2)_Tikhonov_15.pdf
Size:
741.26 KB
Format:
Adobe Portable Document Format
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed to upon submission
Description:
Download

Collections

Статті