Data flow distribution algorithm in complex information technology systems under time constraints

A solution to the problem of distributed processing of data flows in complex information technology systems is presented, taking into account limited time sequences of information interaction operations. An iterative algorithm is proposed that builds a graph model of a sequence of operations based on a formalized flow plan for information interaction between computing nodes and transforms it into a diagram of parallel-sequential processes in BPMN system. The key feature of the algorithm is the stage of semantic analysis of operations related through common data flows, which enables correct setting the edge weights (execution time, data volume). The result of the algorithm is an optimal solution that makes it possible to analyze and optimize the processing of information flows, taking into account time constraints on the sequence of operations.

1. Pavlov A.N., Pavlov D.A., Kopkin E.V., Kormosh A.O. Control and Information Processing Systems, 2025, no. 3(70), pp. 70–82. (in Russ.)

2. Рavlov D.A., Pavlov A.N., Moskvin B.V., Grigoriev K.L. Journal of Instrument Engineering, 2014, no. 11(57), pp. 25–30. (in Russ.)

3. Pavlov D.A., Pavlov A.N., Ivanov D.A., Sokolov B.V., Dolgiy A. Transportation Research part e: Logistics and Transportation review, 2016, рр. 7–24. (in Russ.)

4. Cormen Th.H., Leiserson Ch.E., Rivest R.L., Stein C. Introduction to Algorithms, Cambridge, The MIT Press,2009.

5. Anfilatov V.S., Emelyanov A.A., Kukushkin A.A. Sistemnyy analiz v upravlenii (System Analysis in Management), Moscow, 2005. (in Russ.)

6. Pavlov D.A., Pavlov A.N., Safonov V.M. Informatization and Communication, 2020, no. 5, pp. 141–150. (in Russ.)