RUS  ENG
Full version
JOURNALS // Izvestiya of Saratov University. Mathematics. Mechanics. Informatics // Archive

Izv. Saratov Univ. Math. Mech. Inform., 2021 Volume 21, Issue 1, Pages 125–137 (Mi isu880)

This article is cited in 1 paper

Scientific Part
Computer Sciences

Method of Markovian summation for study the repeated flow in queueing tandem $\mathrm{M|GI|}\infty \to \mathrm{GI}|\infty$

M. A. Shklennik, A. N. Moiseev

National Research Tomsk State University, 36 Lenin Ave., Tomsk 634050, Russia

Abstract: The paper presents a mathematical model of queueing tandem $\mathrm{M|GI|}\infty \to \mathrm{GI}|\infty$ with feedback. The service times at the first stage are independent and identically distributed (i.i.d.) with an arbitrary distribution function $B_1(x)$. Service times at the second stage are i.i.d. with an arbitrary distribution function $B_2(x)$. The problem is to determine the probability distribution of the number of repeated customers ($r$-flow) during fixed time period. To solve this problem, the Markov summation method was used, which is based on the consideration of Markov processes and the solution of the Kolmogorov equation. In the course of the solution, the so-called local $r$-flow was studied — the number of $r$-flow calls generated by one incoming customer received by the system. As a result, an expression is obtained for the characteristic probability distribution function of the number of calls in the local $r$-flow, which can be used to study queuing systems with a similar service discipline and non-Markov incoming flows. As a result of the study, an expression is obtained for the characteristic probability distribution function of the number of repeated calls to the system at a given time interval during non-stationary regime, which allows one to obtain the probability distribution of the number of calls in the flow under study, as well as its main probability characteristics.

Key words: queueing tandem, repeated flow, feedback, unlimited number of servers, method of Markovian summation.

UDC: 519.872

Received: 08.11.2019
Revised: 20.02.2020

DOI: 10.18500/1816-9791-2021-21-1-125-137



Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024