CC BY
21
The FCFS-RQ system by Laslo Lacatos and its
modifications
Igor N. Kovalenko •
Ex-President of Gnedenko Forum Academician of The National Academy of Sciences of Ukraine ikdept125@gmail.com
Abstract
The A. is proud of his being a disciple and co-worker of the world-wide known scholar Boris Vladimirovich Gnedenko and of being a participant of his scientific school, especially in the scope of queueing and reliability. The attempt is made to outline the contribution of prominent Gnedenko's colleagues Professors M.A. Fedotkin, L.G. Afanasyeva and G.I. Falin to the theory and practice of transportation processes. In 1994, a talented Hungarian probabilist Laslo Lakatos invented a new class of queueing systems, FCFS RQ systems motivated by an aviation problem. Such models were generalized by the Author's disciple E.V. Koba. The A. makes a further step in the study of this problem considering a Lakatos type system with hyper-Erlangian inter-arrival and service times.
Keywords: FCFS-RQ system, Laslo Lacators, transportation processes
1. Introduction
My dear master, a world-wide known mathematician Boris Vladimirovich Gnedenko is a one of prominent founders of queueing theory. He was also interested to its applications to wide-ranged practical problems. Concentrating attention to transportation problems, I can confirm that he fruitfully contacted to experts in many branches of the transport as M.N. Zubkov (naval ports), V.A. Padnya (rail transport), E.Yu. Barzilovich (aviation), M.A. Fedotkin (highway traffic) etc etc.
In 1960 I have defended a Ph.D. Thesis conducted by B.V. Gnedenko in Kyiv. Very soon I moved to Moscow where I worked on reliability problems. From June, 1971 I returned to Kyiv to be engaged to the Institute of Cybernetics.
My brightest memories from the Moscow decade are in that I was a participant and a co-conductor (with A.D. Soloviev and Yu.K. Belyaev) in the Seminar "Queueing & Reliability Theory" organized by B.V. Gnedenko. It was a real scientific school: just 20 its participants became full Drs. of science. In 1979, a collective of realibility experts headed by B.V. Gnedenko was awarded a State Prise of the USSR. This collective included mathematicians as well as leading engineering experts, among them two admirals: N.A. Severtsev and I.A.Ryabinin.
I should like to give a very short account on results of the three talented participants of the Gnedenko's Seminar who highly contributed the theory as well as applied areas. They are: Mikhail A. Fedotkin, Larisa G. Afanasyeva, Gennady I. Falin.
2. Investigation of conflicting transportation flows
A problem of control of transportation flows is very difficult, especially in modern metropolises. A considerable contribution to the solution of this problem was done by the Nizhny Novgorod mathematical school led by a talented mathematician M.A. Fedotkin [1-8]. A number of
models describing the interaction of vehicles queueing by a crossing, were elaborated by this school. An iterative-majority method was invented basing on complex Markov chains. In papers [9-10] by M.A. Fedotkin and N.Yu. Kuznetsov an algorithm of the control of flows was presented, considerably (up to 2 to 3 times) shortening mean queueing time of vehicles.
3. Investigation of retrial queueing systems
The theory of retrial queueing systems (RQ systems) became an important branch of queueing theory. I would confine myself with outlying the contribution of two distinguished scientists, professors of M.V. Lomonosov Moscow State University Larisa G. Afanasyeva (L.A.), and Gennady I. Falin (G.F.). Both of them belong to Gnedenko's probability school.
L.A. has studied several classes of queueing systems with different queueing disciplines and probabilistic models of the input and service time [11-16]. A special attention was paid to RQ systems. L.A. fruitfully associates with prominent engineering experts in the aviation service. She studies mathematical RQ models of the airport service using analytical as well as Monte Carlo models. In particular she studied the stability conditions of some RQ systems.
G.F. is a much fruitful author. Among his publications [17-24] and many others there are monographs, surveys, studies of many classes of queueing systems. The most of his papers are connected to the analysis of RQ systems. It must be noted that G.F. is highly skilled in analytical methods. So he applies a diffusion approximation of the queueing process, see [18].
4. FCFS retrial queueing systems
An FCFS RQ system was invented by a Hungarian mathematician Laslo Lakatos [25] following the order of a Croatian aviation engineer Vaclav Ceric. The queueing system by Lacatos can be described in the following way.
The flow of aircrafts is Poissonian, with a parameter X . The service time of an aircraft is
distributed exponentially, with a parameter M. Let tn be the enter time of „ th customer, Wn be its waiting time whereas Yn be its service time. Then Wn = KnT, where a cardinal number K„ = min : mT > + Yw-1 - (tn - t„_j )}. So the service discipline is FCFS and a constant T is a so-called orbit time.
The is an homogeneous Markov chain with states 0,1,2,... As Lakatos proved, this chain is ergodic iff
-atL -pt\
X e l1 - e )
~< : -at
M 1 - e
See also [26-37]. For other papers on this problem see [38-44].
My disciple Mrs. Elena V. Koba (E.K.) generalized this result to FCFS system with a
recurrent flow and a generally distributed service time Yn . Besides orbit times Tn can be considered as i.i.d.r.v.[45]. See also [46-48].
In a special case, where Tn =T = const, the ergodicity condition can be presented in the following way.
Let F (x) be the d.f. of Y - X where Y is a service time and X is an inter-arrival time. Then the ergodicity condition can be expressed as + - ea^" < o| where EjV + = D (l - F (kT)),
_ œ
EN = E k=
i F (-kT).
5. Further generalization
Consider an FCFS system with a constant orbit time T which differs from the original Lakatos [25] in the following points. The inter-arrival time X possesses the p.d.f.
M 1 ,l l-1 -¿x ^ n
a I x ) = 7-A x e , x > U,
(l-1)!
and service time Y possesses the p.d.f.
. / \ 1 m m-1 -ux A
b (x )=/-U x e , x > U.
V ' (m -1)!
Thus the corresponding complimentary d.f. are given by Eqs
A(x) = ^-aV-1e~Ax, x > U; i=U i!
B( x) = m-1 —/J x -1e~ux, x > U . i=U i!
The d.f. of Y -X can be obtained from Eqs
P {y - X > x}= J a (t)b (t + x) dt, x > U;
P {x - Y > x} = J b (t)a ( t + x ) d
b (t A ( t+x ) dt .
After cumbersome algebra one obtains the expressions P{y - X > x} = e~UxmE1(ux)J gj , x > U;
P {X - Y > x} = e ~AxlXo (Ax) g'j , x > U,
where
gj =-
j!
g ;=A
j j!
Hence
1 f 1 ^¡mj1f j v
A+ju j i=0 [A+u
Ci ; Ci+i-1 '
( „ \mi-j-i
M
A + ju
E
i=0
' A V
Ci
Cm+i-1
[A + j j
EN + = Z P {y-X > kr}= V / g ,■ 2 (kTV e ukT , k=U 1 ' j=U Jk=UV '
( "» m-1 j <» / \j -AkT
EN = Z P {X - Y > kT} = Z A g'- Z(kT ) e . k =1 1 J j=0 Jk=1V !
The Markov chain (wn ) of waiting times is ergodic iff
EN+< EN~.
±
It is possible to avoid infinite series while computing EN . So, denoting AT = z or /T = z,
we start with an identity
œ -kz
E e
k =U 1 - e Z
Applying the derivation one obtains the identity
1
œ _ kz œ (
Z ke = Z k=0 £=0
d _ kz 1 d 1
dz J dz 1 - e z
and generally
œ ,j kz / d 1
Z k e =(-1) -t-^
k=0 V ^ (dz)j 1 - e-z
for any natural number j.
A further generalization consists of the following. We shall consider a Lakatos type FCFS RQ system with inter-arrival p.d.f. a (x) and service time p.d.f. b (xj the both being mixtures of
EW+ '
Erlangian p.d.f., so that
a (x ) = p^ cPe (lp' XP; x),
b (x ) = dqe (mq' ; x)
where the e s are Erlangian p.d.f. with form parameters lp, mq and scale parameters hp, p . We also assume that (xn) and (jn) are i.i.d.r.v. As for Cp and dq, they may posses any sign,
provided a (x), b (x) are nonnegative.
One can observe that the bilinearity property holds:
:(a-b) = p,qCpdqEN ±(e (lp'hp)'e (mq'M q))
where the N± in the RHS of this equation relate to the p - and q - components of the mixtures of a (x) and b (x).
Evidently the bilinearity implies the property that EJV± (a b) and hence the associated ergodicity condition, can be expressed by elementary functions, avoiding infinite series.
References
1. Fedotkin M.A. Queueing processes and control systems. Mathematical Problems of Cybernetics. Moscow, Nauka, 1996, p. 51-70 (In Russian).
2. Litvak N.V., Fedotkin M.A. A stochastic model of an adaptive control of conflicting flows. Automatics and Telemechanics, 2000, № 5, p. 67-76 (In Russian).
3. Zorin A.V., Fedotkin M.A. Optimization of the control of twice-stochastic non-ordinary flows in time-sharing systems. Automatics and Telemechanics, 2005, № 7, p. 102-111 (In Russian).
4. Semenov V.V. Mathematical simulation of the transportation flow on a non-controlled crossroads. Mathematical Simulation, 2008, v. 20, № 10, p. 14-22 (In Russian).
5. Fedotkin M.A., Fedotkin A.M. Analysis and optimization of out-processes with a cyclic control of Gnedenko-Kovalenko transportation flows. Automatics and Telemechanics, 2003, № 12, p. 92-108 (In Russian).
6. Fedotkin M.A., Fedotkin A.M. Studying of properties of Gnedenko-Kovalenko flows. Vestnik (Reports) of Lobachevsky Nizhny Novgorod University, 2008, № 6, p. 156-160 (In Russian).
7. Zorin A.V. Stability of a tandem of queueing systems with Bernoulli noninstantaneous transfer of customers. Theory of Рrobability and Mathematical statistics, 2012, p. 173-188.
8. Zorin A.V. A stochastic model of communicating retrial queueing systems with a cyclic control in a random environment. Cybernetics and Systems Analysis, 2013, № 6, p. 100-109 (In Russian).
9. Kuznetsov N.Yu., Fedotkin M.A. Simulation of conflicting transportation flows. Cybernetics and Systems Analysis, 2013, № 6, p. 32-39 (In Russian).
10. Kuznetsov N.Yu. A heuristic algorithm of the control of conflicting nonstationary transportation flows. To be published in: Cybernetics and systems Analysis, 2018, № 3, 16 pages (In Russian).
11. Afanasyeva L.G., Gnedenko B.V. Principles of analytical modelling of the dispatcher in a sector of air movement control. Thesis of reports for the conference "Application of statistical methods in the manufacturing and control", 1984, p. 101-102 (In Russian).
12. Afanasyeva L.G. Ergodicity conditions for queueing systems with repeated calls. Plenum Corporation. Thesis 1994, p.2835-2838
13. Afanasyeva L., Sergeev A. The limit theorems for transportation networks. Studia Mathematica Bulgarica, 2007, v. 18, p. 5-17.
14. Afanasyeva L.G., Popov S.Y., Fayolle G. Models for transportation networks. Journal of Mathematical Science, Plenum, 1997, Plenum, v. 84, № 3, p. 1092-1113.
15. Afanasyeva L., Bulinskaya E. Stochastic methods of transport flows. Proceedings of 13th ASMDA Conference, Vilnius, 2009, p. 2-6.
16. Afanasyuva L.G., Bulinskaya E.V. Transport flows investigation via queueing models. S.M. Ermakov, V.B. Melas, A.N. Pepelyskayev (Eds), Proceeding of the 6th St. Petersbourg Workshop on Simulation, St. Petersbourg University Press, 2009, v.1, p. 41-46.
17. G. I. Falin and J. G. C. Templeton. Retrial Queues. Chapman & Hall, 1997.
18. G.I. Falin. A diffusion approximation for retrial queueing systems // Theory. Probab. Appl., 36:1 (1991), C. 183-186.
19. G.I. Falin. Approximation of synchronous data transmission systems with a small time cycle// Automatika and Telemekhanika, 1989, № 4, pp.116-123.(in Russian)
20. G.I. Falin. Switching systems with allowance for repeated calls// Problems of information transmission, 16:2 (1980), pp. 83-91. (in Russian)
21. G.I. Falin, J.R. Artalejo, M. Martin On the single server retrial queue with priority customers // Queueing systems, 1993 , v. 14(3-4), pp 439-487.
22. G.I. Falin A single-server batch arrival queue with returning customers // European Journal of Operational Research, 2010, v.201(3),pp 786-790.
23. G.I. Falin, A. Gómez-Corral On a bivariate Markov process arising in the theory of singleserver retrial queues // Statistica Neerlandica, 2000, v.54(1), pp 67-79.
24. G.I. Falin A multiserver retrial queue with a finite number of sources of primary calls // Mathematical and Computer Modelling, 1999, v.30(3-4), pp33-49.
25. Lakatos L.: On a simple continuous cyclic-waiting problem. Annales Univ. Sci. Budapest., Sect. Comp. 14 (1994) 105-113.
26. Lakatos L.: On a cyclic-waiting queuing system. Theory of Stochastic Processes 2 (18) 1-2 (1996) 176-180.
27. Lakatos L.: Ergodic distribution for theM/G/1 System with Vacation. Theory of Stochastic Processes 3 (19) 1-2 (1997), pp. 244-255.
28. 40. Lakatos L.: On a simple discrete cyclic-waiting queuing problem. J. Math. Sci. (New York), 92 (4) (1998) 4031-4034.
29. Lakatos L.: Equilibrium distributions for the M/G/1 and related systems. Publicationes Mathematicae Vol. 55, Nr. 1-2. (1999), pp.123-140.
30. Lakatos L.: On the MX/G/1 system. Annales Univ. Sci. Budapest., Sect. Comp. 18 (1999) 137150
31. Lakatos L.: On the M/G/1 system with bulk arrivals and vacation. Theory of Stochastic Processes 5 (21) 3-4 (1999) 127-136
32. Lakatos L.: Limit distributions for some cyclic-waiting queuing systems. Ukrainian Math. Congress 2001 Proc., Sect. 9. Probability Theory and Math. Stat., Institute of Mathematics, Kiev (2002) 102-106
33. Lakatos L.: A special cyclic-waiting queuing system with refusals. J. Math. Sci. (New York), 111 (3) (2002) 3541-3544
34. Lakatos L.: A retrial system with time-limited tasks. Theory of Stochastic Processes 8 (24) 3-4 (2002), pp. 250-256.
35. Lakatos L.: A special cyclic-waiting queueing system with refusals: The discrete time case. Annales Univ. Sci. Budapest. Sect. Comp. 24 (2004), pp. 323-333.
36. Lakatos L.: M/G/1 system with adjustment at the beginning of its busy period. // Cybernetics and System Analysis / 1 (2005), pp. 82-117.( In Russian).
37. Lakatos L.: A retrial queueing system with urgent customers. J. Math. Sci. 138 1 (2006) 54055409.
38. Farkas G.: Investigation of a continuous cyclic-waiting problem by simulation. Annales Univ. Sci. Budapest., Sect. Comp. 19 (2000) 225-235
39. Farkas G.: Numerical investigation of a cyclic-waiting queueing system with two types of customers. Annales Univ. Sci. Budapest., Sect. Comp. 21 (2002), pp. 153-163.
40. Farkas G., Abdalla W.S.: Numerical investigation of the convergence to the limit distribution in a cyclic-waiting system. Annales Univ. Sci. Budapest., Sect. Comp. 20 (2001), pp. 207-220.
41. Farkas G., Karasz P.: Investigation of a discrete cyclic-waiting problem by simulation. Acta Acad. Paed. Agriensis, Sectio Mathematicae 27 (2000), pp. 57-62.
42. Lakatos L., Koltai T.: A discrete retrial system with uniformly distributed service time. Annales Univ. Sci. Budapest., Sect. Comp. 22 (2003) 225-234.
43. Lakatos L., Zbäganu G.: Waiting time in cyclic-waiting systems. Annales Univ. Sci. Budapest., Sect. Comp. 27 (2007) 217-228.
44. Mykhalevych K.V.: A comparison of a classical retrial M/G/1 queueing system and a Lakatos-type M/G/1 cyclic-waiting time queueing system. Annales Univ. Sci. Budapest., Sect. Comp. 23 (2004) 229-238.
45. Koba E.V. An ergodicity condition for a generalized Lakatos type system. Dopovidi (Reports) of the NAS of Ukraine, 2004, N 11, p. 70-74. (In Russian).
46. Koba E.V. An M /M /1/0 retrial system with a combined queueing discipline. // Cybernetics and System Analysis, 2017, N3, p. 67-72. (In Russian)
47. Koba E.V., Pustovaya S.V. Queueing systems of Lakatos type, their modification and application // Cybernetics and System Analysis, 2012, N3, p. 78-90. (In Russian)
48. Kovalenko I.N. On a two-cyclic queueing system. Cybernetics and Systems Analysis, 2015, N1, p. 59-65 (in Russian)
