OPTIMUM FLOW DISTRIBUTION IN THE NETWORK WITH ADAPTIVE DATA TRANSFER
DOI:
https://doi.org/10.18372/1990-5548.66.15254Keywords:
Data network, network model, gravity matrix, switching node, path flow, linear programming, target function, static flow distribution, network degradation, adaptive control algorithmAbstract
This paper considers a fundamentally new model of data network construction for servicing the flows given by the gravitational matrix with restrictions on the time of information transmission. The proposed network model differs from the known ones because it has an expanded capacity of node and channel resources, combining the lowest possible cost of channels and switching nodes. As part of the development of the proposed model and algorithm for allocation of flows in a full mesh network, the developed mathematical apparatus provides a high degree of reliability and survivability of the synthesized network as a whole. One of the used approaches to the solution of the linear programming problem is based on the choice of the target function, the type of which is determined by the consumer conditions of the synthesis of a particular data network. Within the framework of the article, it is established that the linear programming problem, for each specific case, has an admissible, practically realizable solution with the optimal choice of the target function without additional simplex transformations. An important obtained result of the research is the simplicity of flow control, which is in direct dependence on the strict ordering of the proposed structure, because it was possible to connect by analytical dependences the flows in the branches and the path data transfer flows. The obtained analytical results can be used as a basis for statistical algorithms of information flow control.
References
https://zakon.rada.gov.ua/laws/show/1358-2020-%D0%BF#Text
O. T. Patryak, "The development of telecommunication space of Ukraine in the context of the building of information society," Visnik ChSAK. no. 53, pp. 129–138, 2018. v-khsac.in.ua/article/view/146522/145430 (in Ukrainian) https://doi.org/10.31516/2410-5333.053.12
S. R. Rudinskaya, Info-switching networks. Calculation methods. Minsk: RUMC FVN, 2008, 120 p. (in Russian)
L. A. Fomin, N. N. Gakhova, S. N. Zdanevich, A. I. Vataga, and Yu. O. Malofey, “Analytical solution of the problem of optimal flow distribution in the data transmission network,” Information processing systems, no. 2(18), pp. 3–15, 2002. (in Russian)
A. V. Panteleev, Optimization methods in examples and exersises, Moscow, Vysshaya shkola, 2005, 544 p. (in Russian)
N. А. Naumova, “Optimization problems of flow distribution in network nodes,” Fundamental research, no. 11(4), pp. 936–941, 2012; URL: http://www.fundamental-research.ru/ru/article/view?id=30687 (in Russian)
Alexander Schrijver, Theory of Linear and Integer Programming. John Wiley & Sons, 1998, ISBN 0-471-98232-6
K. N. Lungu, Linear programming. Guide to solving problems. Moscow: Fizmatlit, 2005, 128 p. (in Russian)
O. V Bolotnikova, D. V. Tarasov, and R. V. Tarasov, Linear programming: simplex method and duality: textbook. manual – Penza: PSU, 2015, 84 p. (in Russian)
Downloads
Issue
Section
License
Authors who publish with this journal agree to the following terms:
Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).