Construction of continuous time Markovian arrival processes

Abstract

Markovian arrival processes were introduced by Neuts in 1979 (Neuts 1979) and have been used extensively in the stochastic modeling of queueing, inventory, reliability, risk, and telecommunications systems. In this paper, we introduce a constructive approach to define continuous time Markovian arrival processes. The construction is based on Poisson processes, and is simple and intuitive. Such a construction makes it easy to interpret the parameters of Markovian arrival processes. The construction also makes it possible to establish rigorously basic equations, such as Kolmogorov differential equations, for Markovian arrival processes, using only elementary properties of exponential distributions and Poisson processes. In addition, the approach can be used to construct continuous time Markov chains with a finite number of states

Keywords

Markovian arrival process / Poisson process / matrix-analytic methods

References

[1] Asmussen S., Koole G.. Marked point processes as limits of Markovian arrival streams. Journal of Applied Probability, 1993, 30: 365-372.

[2] Chakravarthy S.R.. Krishnamoorthy A., Raju N., Ramaswami V.. The batch Markovian arrival process: A review and future work. Advances in Probability & Stochastic Processes, 2001, New Jersey: Notable Publications, Inc. 21-49.

[3] C’inlar E.. Markov renewal theory. Advances in Applied Probability, 1969, 1: 123-187.

[4] He Q.M.. Queues with marked customers. Advances in Applied Probability, 1996, 28: 567-587.

[5] He Q.M., Neuts M.F.. Markov chains with marked transitions. Stochastic Processes and Their Applications, 1998, 74: 37-52.

[6] He Q.M.. The versatility of MMAP[K] and the MMAP[K]/G[K]/1 queue. Queueing Systems, 2001, 38: 397-418.

[7] Latouche G., Ramaswami V.. Introduction to Matrix Analytic Methods in Stochastic Modelling, 1999, Philadelphia, USA: ASA & SIAM

[8] Lucantoni D.M., Meier-Hellstern K., Neuts M.F.. A single-server queue with server vacations and a class of non-renewal arrival processes. Advances in Applied Probability, 1990, 22: 676-705.

[9] Lucantoni D.M.. New results on the single server queue with a batch Markovian arrival process. Stochastic Models, 1991, 7: 1-46.

[10] Narayana S., Neuts M.F.. The first two moments matrices of the counts for the Markovian arrival processes. Stochastic Models, 1992, 8: 459-477.

[11] Neuts M.F.. A versatile Markovian point process. Journal of Applied Probability, 1979, 16: 764-779.

[12] Neuts M.F.. Matrix-Geometric Solutions in Stochastic Models - An Algorithmic Approach, 1981, Baltimore: The Johns Hopkins University Press.

[13] Neuts, M.F. (1992). Models based on the Markovian arrival process. IEICE Trans. Commun. E75-B, 1255–1265

[14] Neuts M.F.. Dshalalow J.H.. Matrix analytic methods in queueing theory. Advances in Queueing: Theory, Methods, and Open Problems, 1995, Florida, USA: CRC Press 265-292.

[15] Neuts M.F., Liu D., Narayana S.. Local poissonification of the Markovian arrival process. Stochastic Models, 1992, 8: 87-129.

[16] Ramaswami V.. The N/G/1 queue and its detailed analysis. Advances in Applied Probability, 1980, 12: 222-261.

[17] Ross S.. Introduction to Probability Models, 2007, 9th Edition New York: Academic Press (Elsevier)

[18] Rudemo M.. Point processes generated by transitions of Markov chains. Advances in Applied Probability, 1973, 5: 262-286.

[19] Takine T.. Queue length distribution in a FIFO single-server queue with multiple arrival streams having different service time distributions. Queueing System, 2001, 39: 349-375.