Analysis of a queuing system of a single capacity with phase-type distributions and queue updating

In this paper, we study a queuing system with a single-capacity storage device and queue updating. An update is understood as the following mechanism: an application that enters the system and finds another application in the drive destroys it, taking its place in the drive. It should be noted that systems with one or another update mechanism have long attracted the attention of researchers, since they have important applied significance. Recently, interest in systems of this kind has grown in connection with the tasks of assessing and managing the age of information. A system with a queue update mechanism similar to the one we are considering has already been studied earlier in the works of other authors. However, in these works we were talking about the simplest version of the system with Poisson flow and exponential maintenance. In this paper, we consider a phase-type flow and maintenance system. As a result of our research, we developed a recurrent matrix algorithm for calculating the stationary distribution of states of a Markov process describing the stochastic behavior of the system in question, and obtained expressions for the main indicators of its performance.

Authors

Institutions

Publication Details

Journal
Discrete and Continuous Models and Applied Computational Science
Published
2024-12-15
DOI
https://doi.org/10.22363/2658-4670-2024-32-3-271-282
Primary Topic
Age of Information Optimization
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Analysis of a queuing system of a single capacity with phase-type distributions and queue updating

Sergey Matyushenko, Konstantin Samouylov, Nikolai Yu. Gritsenko
Discrete and Continuous Models and Applied Computational Science
Age of Information Optimization
article

Analysis of a queuing system of a single capacity with phase-type distributions and queue updating

Sergey Matyushenko, Konstantin Samouylov, Nikolai Yu. Gritsenko
article en

Abstract

In this paper, we study a queuing system with a single-capacity storage device and queue updating. An update is understood as the following mechanism: an application that enters the system and finds another application in the drive destroys it, taking its place in the drive. It should be noted that systems with one or another update mechanism have long attracted the attention of researchers, since they have important applied significance. Recently, interest in systems of this kind has grown in connection with the tasks of assessing and managing the age of information. A system with a queue update mechanism similar to the one we are considering has already been studied earlier in the works of other authors. However, in these works we were talking about the simplest version of the system with Poisson flow and exponential maintenance. In this paper, we consider a phase-type flow and maintenance system. As a result of our research, we developed a recurrent matrix algorithm for calculating the stationary distribution of states of a Markov process describing the stochastic behavior of the system in question, and obtained expressions for the main indicators of its performance.

Discrete and Continuous Models and Applied Computational ScienceVol. 32(3)
Peoples' Friendship University of Russia (RU)
Openalex Percentile: Top 63%
Age of Information Optimization
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.