Imbedded Markov chains for certain extended queueing processes
Digital Object Identifier (DOI): 10.14708/ma.v3i5.1187
Abstract
One of the basic characteristics of queueing systems is the stochastic process {n(t),t≥0}, which is defined to be the number of units present in the system at time t. In certain cases, this process is Markovian and then its analysis is relatively simple. When the process {n(t),t≥0} is not Markovian, its "Markovization'' can be accomplished by a suitable extension of the states of the system or by the construction of a suitable imbedded Markov chain. The method of extension of the states of the system, which depends on the formation of a vector process, one of whose components is the process {n(t),t≥0}, gives the characteristics of the process {n(t),t≥0}. The method of imbedded Markov chains, which consists of investigating the process in a suitably chosen sequence of time points, yields the characteristics of the process only at the selected time points. For example, a GI/M/N system may be analyzed at the moments of time at which the units enter the system. Because of this, when the method of imbedded Markov chains is used,
the interesting characteristics of continuous-time processes can be obtained only with some additional effort. (MR0467961)
the interesting characteristics of continuous-time processes can be obtained only with some additional effort. (MR0467961)
Keywords: 60K25
References
[1] С. M. Броди, И. А. Погосян, Вложенные стохастические процессы в теории массового обслуживания, Киев 1973.
[2] A. J. Fabеns, The solution of queueing and inventory models by semi-Markov processes, J. Roy. Stat. Soc. В 23 (1961), str. 113-127.
[3] F. G. Foster, Batched queueing processes, Operat. Res. 12 (1964), str. 441-449.
[4] F. G. Foster, A. G. A. D. Perrera, Queues with batch arrivals, II, Acta Math. Hung. 16 (1965), str. 275-287.
[5] D. P. Gaver, Imbedded Markov chain analysis of a waiting-line processes in continuous time, Ann. Math. Statist. 30, 3 (1959), str. 698-720.
[6] B. W. Gniedenko, I. N. Kowalenko, Wstęp do teorii obsługi masowej, Warszawa 1968.
[7] Б. В. Гнеденко, Э. А. Даниелян, Б. H. Димитров, Г. П. Климов, В. Ф. Матвеев, Приоритетные системы обслуживания, Москва 1973.
[8] N. K. Jaiswаl, Priority queues, New York—London 1968.
[9] M. Jankiewiсz, Cyclic systems with preemptive priority, Zastos. Matem. 14 (1974), str. 165-176.
[10] Г. П. Климов, Стохастические системы обслуживания, Москва 1966.
[11] I. Kopocińska, On a M/G/l queueing model with feedback, Zastos. Matem. 9 (1967), str. 161-171.
[12] I. Kopocińska, GI/M/1 queueing systems with service rates depending on the length of queue, ibidem (1970), str. 265-279.
[13] I. Kopocińska, Repairman problem, Dissertat. Math. 101 (1973), str. 1-40.
[14] I. Kopocińska, Zagadnienie konserwatora, Matematyka Stosowana 2 (1974), str. 109-129.
[15]I. Kopocińska, B. Kopociński, Queueing systems with feedback, Bull. Acad. Pol. Sci., Ser. Sci. Math. Astronom. Phys., 19 (1971), Str. 397-401.
[16] I. Kopocińska, B. Kopociński, Queueing systems with feedback, Zastos. Matem. 12 (1972), Str. 373-384.
[17] I. Kopocińska, B. Kopociński, Queueing systems with mixed input stream and feedback, Zastos. Matem. 14 (1974), str. 177-183.
[18] B. Kopociński, Zarys teorii odnowy i niezawodności, Warszawa 1973.
[19] A. Kuczura, Queues with mixed reneval and Poisson inputs, Bell System Techn. J. 51 (1972), str. 1305-1326.
[20] A. Kuczura, Piecewise Markov processes, Siam J. Appl. Math. 24, 2 (1973), str. 169-181.
[21] A. Kuczura, Loss systems with mixed reneval and Poisson inputs, Operat. Res. 21, 3 (1973), str. 787-795.
[22] T. Ryba, Remark on a service system with mixed input stream, Operat. Res. 20 (1972), str. 452-454.
[23] T. Ryba, Queueing system with merging of two inputs streams, Zastos. Matem. 13 (1973), str. 419-427.
[24] W. L. Smith, Renewal theory and its ramifications, J. Roy. Stat. Soc., Ser. В, 20 (1958), Str. 243-302.
[25] L. Takáсs, Introduction to the Theory of Queues, New York 1962.
[26] J. P. Young, Administrative control of multiple-channel queueing systems with parallel input streams, Operat. Res. 14 (1966), str. 145-156.
Pages: 103-127
Full Text: PDF
