Daria D. Salimzyanova
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Daria D. Salimzyanova has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Anatoly Nazarov
Tomsk State University, Tomsk, Russia
1 shared publication - Ekaterina Lisovskaya
National Research Tomsk State University
1 shared publication - Ivan Lapatin
National Research Tomsk State University
1 shared publication - Svetlana Paul
National Research Tomsk State University
1 shared publication
Latest Publications
- 25 September 2026
- Published by Novosibirsk State Technical University in Analysis and data processing systems
- No. 3
Characteristics of the output flow of processed tasks in a computational node model under resource competition
The continuous growth in the popularity of remote and cloud computing creates the need for developing mathematical models describing the operation of such systems or their individual components. Mathematical models make it possible to evaluate various performance characteristics of a system under different operating parameters. The calculation of these characteristics is required at the design stage of a computational node or for optimizing the operation of an existing one. The queueing theory is widely used to model processes of a stochastic nature. This paper considers a computational node model represented as a queueing system with an unlimited number of servers. The arrival of tasks to the node is described by a Poisson point process. A distinctive feature of the proposed model compared to the classical one is the dependence of the service (processing) rate of incoming tasks on the total number of tasks present at the computational node. The greater the number of tasks being processed simultaneously, the lower the processing rate of each individual task. This effect arises due to competition for a shared resource of the computational node. In this study, the object of investigation is the output flow of the model, i.e., the moments when task is completed on the computational node. Information about the characteristics of the output flow is of great importance since after processing, tasks (requests) must be transmitted via telecommunication channels. It is the probabilistic characteristics of the serviced task flow that affect the calculation of the required data transmission bandwidth to ensure specified quality-of-service parameters. To analyze the output flow of the computational node model, asymptotic methods of queueing theory are employed. As a result, asymptotic characteristics of the output flow of the proposed model are obtained. It is important to note that the proposed asymptotic approach can potentially be extended to models with non-Poisson task arrival processes.
- 25 September 2026
- Published by Novosibirsk State Technical University in Analysis and data processing systems
- No. 3
Characteristics of the output flow of processed tasks in a computational node model under resource competition
The continuous growth in the popularity of remote and cloud computing creates the need for developing mathematical models describing the operation of such systems or their individual components. Mathematical models make it possible to evaluate various performance characteristics of a system under different operating parameters. The calculation of these characteristics is required at the design stage of a computational node or for optimizing the operation of an existing one. The queueing theory is widely used to model processes of a stochastic nature. This paper considers a computational node model represented as a queueing system with an unlimited number of servers. The arrival of tasks to the node is described by a Poisson point process. A distinctive feature of the proposed model compared to the classical one is the dependence of the service (processing) rate of incoming tasks on the total number of tasks present at the computational node. The greater the number of tasks being processed simultaneously, the lower the processing rate of each individual task. This effect arises due to competition for a shared resource of the computational node. In this study, the object of investigation is the output flow of the model, i.e., the moments when task is completed on the computational node. Information about the characteristics of the output flow is of great importance since after processing, tasks (requests) must be transmitted via telecommunication channels. It is the probabilistic characteristics of the serviced task flow that affect the calculation of the required data transmission bandwidth to ensure specified quality-of-service parameters. To analyze the output flow of the computational node model, asymptotic methods of queueing theory are employed. As a result, asymptotic characteristics of the output flow of the proposed model are obtained. It is important to note that the proposed asymptotic approach can potentially be extended to models with non-Poisson task arrival processes.
- 15 August 2024
- Published by Springer Nature
- p. 76-90
Identification of Network Traffic Using Neural Networks
- 15 August 2024
- Published by Springer Nature
- p. 76-90
Identification of Network Traffic Using Neural Networks