Abstract
A new analysis method for queueing systems with general input stream and phase type service time distributions is introduced. The approach combines discrete event simulation and numerical analysis of continuous time Markov chains. Simulation is used to represent the arrival process, whereas the service process is analyzed with numerical techniques. In this way the state of the system is characterized by a probability vector rather than by a single state. The use of a distribution vector reduces the variance of result estimators such that the width of confidence intervals is often reduced compared to discrete event simulation. This, in particular, holds for measures based on rare events or states with a small probability. The analysis approach can be applied for a wide variety of result measures including stationary, transient and accumulated measures.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
P. Buchholz, A new approach combining simulation and randomization for the analysis of large continuous time Markov chains, ACM Trans. Modeling Computer Simulation 8(2) (1998) 194–222.
D. Gross and D. Miller, The randomization technique as a modeling tool and solution procedure for transient Markov processes, Oper. Res. 32(2) (1984) 926–944.
P. Heidelberger, Fast simulation of rare events in queueing and reliability models, ACM Trans. Modeling Computer Simulation 5(1) (1995) 43–85.
R.A. Howard, Dynamic Probabilistic Systems, Vol. II: Semi-Markov and Decision Processes (Wiley, New York, 1971).
I.N. Kovalenko, Rare events in queueing systems – a survey, Queueing Systems 16(1) (1994) 1–49.
A.M. Law and W.D. Kelton, Simulation Modeling and Analysis (Wiley, New York, 1991).
D. Litzba, M. Sczittnick and F.J. Stewing, Yet another simulation output analysis algorithm: The autoregressive, online-update evaluation technique of the modelling tool, HIT, in: Proc. of the 3rd European Simulation Congress (1989).
D.M. Lucantoni, New results on a single server queue with a batch Markovian arrival process, Comm. Statist. Stochastic Models 7(1) (1991) 1–46.
D.M. Lucantoni, K.S. Meier-Hellstern and M.F. Neuts, A single server queue with server vacations and a class of non-renewal arrival processes, Adv. in Appl. Probab. 22 (1990) 676–705.
M.F. Neuts, A versatile Markovian point process, J. Appl. Probab. 16 (1979) 764–779.
M.F. Neuts, Matrix-Geometric Solutions in Stochastic Models (Johns Hopkins Univ. Press, Baltimore, MD, 1981).
G. Rubino and B. Sericola, Sojourn times in finite Markov processes, J. Appl. Probab. 27 (1989) 744–756.
W.H. Sanders and J.F. Meyer, A unified approach for specifying measures of performance, dependability and performability, in: Dependable Computing for Critical Applications, eds. A. Avizienis and J. Laprie, Dependable Computing and Fault-Tolerant Systems, Vol. 4 (Springer, Berlin, 1991).
R.B. Sidje and W.J. Stewart, A survey of methods for computing large sparse matrix exponentials arising in Markov chains, submitted for publication.
W.J. Stewart, Introduction to the Numerical Solution of Markov Chains (Princeton Univ. Press, Princeton, NJ, 1994).
K.S. Trivedi, G. Ciardo, M. Mahorta and R.A. Sahner, Dependability and performability analysis, in: '93 and Sigmetrics '93, eds. L. Donatelli and R. Nelson, Lecture Notes in Computer Science, Vol. 729 (Springer, Berlin, 1993) pp. 587–612.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Buchholz, P. A hybrid analysis approach for finite-capacity queues with general inputs and phase type service. Queueing Systems 35, 167–183 (2000). https://doi.org/10.1023/A:1019194027833
Issue Date:
DOI: https://doi.org/10.1023/A:1019194027833