Abstract
In queueing theory, most models are based on time-homogeneous arrival processes and service time distributions. However, in communication networks arrival rates and/or the service capacity usually vary periodically in time. In order to reflect this property accurately, one needs to examine periodic rather than homogeneous queues. In the present paper, the periodic BMAP/PH/c queue is analyzed. This queue has a periodic BMAP arrival process, which is defined in this paper, and phase-type service time distributions. As a Markovian queue, it can be analysed like an (inhomogeneous) Markov jump process. The transient distribution is derived by solving the Kolmogorov forward equations. Furthermore, a stability condition in terms of arrival and service rates is proven and for the case of stability, the asymptotic distribution is given explicitly. This turns out to be a periodic family of probability distributions. It is sketched how to analyze the periodic BMAP/M t /c queue with periodically varying service rates by the same method.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
S. Asmussen and H. Thorisson, A Markov chain approach to periodic queues, J. Appl. Probab. 24 (1987) 215-225.
N. Bambos and J. Walrand, On queues with periodic inputs, J. Appl. Probab. 26 (1989) 381-389.
R. Bellman, Introduction to Matrix Analysis (SIAM, Philadelphia, PA, 1997).
L. Breuer, Markovian spatial queues with periodic arrival and service rates, in: Proceedings of the MMB'99 Conference in Trier, Research Report No. 99-17, Department of Mathematics and Computer Science, University of Trier, Germany (1999).
G.I. Falin, Periodic queues in heavy traffic, Adv. Appl. Probab. 21 (1989) 485-487.
G. Fayolle, V. Malyshev and M. Menshikov, Topics in the Constructive Theory of Countable Markov Chains (Cambridge University Press, Cambridge, 1995).
I. Gikhman and A. Skorokhod, Introduction to the Theory of Random Processes (W.B. Saunders, Philadelphia, PA, 1969).
J.M. Harrison and A.J. Lemoine, Limit theorems for periodic queues, J. Appl. Probab. 14 (1977) 566-576.
A.M. Hasofer, On the single-server queue with non-homogeneous Poisson input and general service time, J. Appl. Probab. 1 (1964) 369-384.
D.P. Heyman and W. Whitt, The asymptotic behavior of queues with time-varying arrival rates, J. Appl. Probab. 21 (1984). 143-156.
A.J. Lemoine, On queues with periodic Poisson input, J. Appl. Probab. 18 (1981) 889-900.
A.J. Lemoine, Waiting time and workload in queues with periodic Poisson input, J. Appl. Probab. 26 (1989) 390-397.
D. Lucantoni, New results on the single server queue with a batch Markovian arrival process, Comm. Statist. Stochastic Models 7(1) (1991) 1-46.
W. Massey, Non-stationary queues, Ph.D. thesis, Stanford University (1981).
M. Neuts, A versatile Markovian point process, J. Appl. Probab. 16 (1979) 764-779.
M. Neuts, Structured Stochastic Matrices of M/G/1 Type and Their Applications (Marcel Dekker, New York, 1989).
T. Rolski, Approximation of periodic queues, Adv. Appl. Probab. 19 (1987) 691-707.
T. Rolski, Relationships between characteristics in periodic Poisson queues, Queueing Systems 4 (1989) 17-26.
H. Willie, Periodic steady state of loss systems with periodic inputs, Adv. Appl. Probab. 30 (1998) 152-166.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Breuer, L. The Periodic BMAP/PH/c Queue. Queueing Systems 38, 67–76 (2001). https://doi.org/10.1023/A:1010872128919
Issue Date:
DOI: https://doi.org/10.1023/A:1010872128919