QUEUEING SYSTEMS WITH DELAY

被引:4
作者
Tarasov, V. N. [1 ]
机构
[1] Volga State Univ Telecommun & Informat, Dept Software & Management Tech Syst, Samara, Russia
关键词
delayed system; shifted distributions; Laplace transform; Lindley integral equation; spectral decomposition method; QUEUES;
D O I
10.15588/1607-3274-2019-3-7
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Context. In the queuing theory of a research of the G/G/1 systems are relevant because it is impossible to receive decisions for the average waiting time in queue in a final form in case of arbitrary laws of distributions of an input flow and service time. Therefore, the study of such systems for particular cases of input distributions is important. The problem of deriving solutions for the average waiting time in a queue in closed form for systems with distributions shifted to the right from the zero point is considered. Objective. Getting solutions for the main characteristics of the systems - the average waiting time of requirements in the queue for queuing systems (QS) of type G/G/1 with shifted input distributions. Methods. To solve this problem, we used the classical method of spectral decomposition of the solution of the Lindley integral equation. This method allows to obtaining a solution for the average waiting time for two systems under consideration in a closed form. The method of spectral decomposition of the solution of the Lindley integral equation plays an important role in the theory of systems G/G/1. For the practical application of the results obtained, the well-known method of moments of probability theory is used. Results. For the first time, spectral expansions are obtained for the solution of the Lindley integral equation for systems with delay, which are used to derive formulas for the average waiting time in a queue in closed form. Conclusions. It is shown that in systems with delay, the average waiting time is less than in in the usual systems. The obtained formula for the average waiting time expands and complements the well-known queuing theory incomplete formula for the average waiting time for G/G/1 systems. This approach allows us to calculate the average latency for these systems in mathematical packages for a wide range of traffic parameters. In addition to the average waiting time, such an approach makes it possible to determine also moments of higher orders of waiting time. Given the fact that the packet delay variation (jitter) in telecommunications is defined as the spread of the waiting time from its average value, the jitter can be determined through the variance of the waiting time.
引用
收藏
页码:55 / 63
页数:9
相关论文
共 18 条
  • [1] Aliev T. I., 2009, OSNOVY MODELIROVANIY
  • [2] [Алиев Тауфик Измайлович Aliev Taufik], 2013, [Научно-технический вестник информационных технологий, механики и оптики, Scientific and Technical Journal of Information Technologies Mechanics and Optics, Nauchno-tekhnicheskii vestnik informatsionnykh tekhnologii, mekhaniki i optiki], P88
  • [3] [Anonymous], 3393 RFC
  • [4] Many-server Gaussian limits for overloaded non-Markovian queues with customer abandonment
    Aras, A. Korhan
    Chen, Xinyun
    Liu, Yunan
    [J]. QUEUEING SYSTEMS, 2018, 89 (1-2) : 81 - 125
  • [5] BOCHAROV PP, 1995, TEORIYA MASSOVOGO OB
  • [6] Brannstrom N. A., 2004, QUEUEING THEORY ANAL
  • [7] Heavy traffic limit for a tandem queue with identical service times
    Gromoll, H. Christian
    Terwilliger, Bryce
    Zwart, Bert
    [J]. QUEUEING SYSTEMS, 2018, 89 (3-4) : 213 - 241
  • [8] Comparisons of ticket and standard queues
    Jennings, Otis B.
    Pender, Jamol
    [J]. QUEUEING SYSTEMS, 2016, 84 (1-2) : 145 - 202
  • [9] Kleinrock L., 1979, TEORIYA MASSOVOGO OB
  • [10] MYSKJA A, 1991, NORTH HOLL STUD TELE, V14, P683