Abstract
In this paper two solution methods to the MAP(t)/PH(t)/1/K queueing model are introduced, one based on the Backwards Euler Method and the other on the Uniformization Method. Both methods use finite-differencing with a discretized, adaptive time-mesh to obtain time-dependent values for the entire state probability vector. From this vector, most performance parameters such as expected waiting time and expected number in the system can be computed. Also presented is a technique to compute the entire waiting (sojourn) time distribution as a function of transient time. With these two solution methods one can examine any transient associated with the MAP(t)/PH(t)/1/K model including time-varying arrival and/or service patterns. Four test cases are used to demonstrate the effectiveness of these methods. Results from these cases indicate that both methods provide fast and accurate solutions to a wide range of transient scenarios.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A. Alfa, Approximating queue lengths in M(t)/D/1 queues, European J. of Oper. Res. 44(1) (1990) 60–66.
A. Alfa, A discrete MAP/PH/1 queue vacations and exhaustive time-limited service, Oper. Res. Lett. 18 (1995) 31–40.
A. Alfa and M. Chen, Approximating queue lengths in M(t)/G/1 queues using the maximum entropy principle, Acta Informatica 28 (1990) 801–815.
F. Bonomi, An approximate analysis for a class of assembly-like queues, Queueing Systems 1 (1987) 289–309.
G. Choudhury, D. Lucantoni and W. Whitt, Numerical solution of piecewise-stationary M t / Gt /1 queues, Oper. Res. 45(3) (1997) 451–463.
G. Clark, Use of Polya distributions in approximate solutions to nonstationary M/M/s queues, Comm. ACM 24(4) (1981) 206–217.
D. Dormuth, Performance assessment of mixed methods for time integration using an assembly-type queueing model, Ph.D. thesis, University of Manitoba (1997).
I. Duff, A. Erisman and J. Reid, Direct Methods for Sparse Matrices (Claredon Press, Oxford, 1992).
W. Feller, An Introduction to Probability Theory and its Applications, Vol. 2, 2nd ed. (Wiley, New York, 1971).
W. Grassman, Transient solutions in Markovian queues, European J. Oper. Res. 1 (1977) 396–402.
W. Grassman, Rounding errors in certain algorithms involving Markov chains, ACM Trans. Math. Software 19(4) (1993) 496–508.
L. Green, P. Kolesar and A. Svoronos, Some effects of nonstationarity on multiserver Markovian queueing systems, Oper. Res. 39 (1991) 502–511.
D. Gross and C. Harris, Fundamentals of Queueing Theory (Wiley, New York, 1974).
D. Gross and D. Miller, The randomization technique as a modeling tool and solution procedure for transient Markov processes, Oper. Res. 32(2) (1984) 343–361.
M. Johnson, Selecting parameters of phase distributions: Combining nonlinear programming, heuristics, and Erlang distributions, ORSA J. Comput. 5 (1993) 69–83.
M. Johnson and M. Taaffe, An investigation of phase-distribution moment matching algorithms for use in queueing models, Queueing Systems 8 (1991) 129–147.
A. Lang and J. Arthur, Parameter approximation for phase-type distributions, in: Matrix Analytic Methods in Stochastic Models, eds. S. Chakravarthy and A. Alfa (Marcel Dekker, 1996) pp. 151–206.
E.H. Lipper and B. Sengupta, Assembly-like queues with finite capacity: Bounds, asymptotics, and approximations, Queueing Systems 1 (1986) 67–83.
D. Lucantoni, New results on the single server queue with a batch Markovian process, Comm. Statist. Stochastic Models 7 (1991) 1–46.
D. Lucantoni, G. Choudhury and W. Whitt, The transient BMAP/G/1 queue, Stochastic Models 10(1) (1994) 145–182.
D. Luenberger, Linear and Nonlinear Programming, 2nd ed. (Addison-Wesley, Reading, MA, 1989).
C. Moler and C. Van Loan, Nineteen dubious ways to compute the exponential of a matrix, SIAM Rev. 20 (1978) 801–836.
M. Neuts, A versitile Markovian point process, J. Appl. Probab. 16 (1979) 764–779.
M. Neuts, Matrix-Geometric Solutions in Stochastic Models (Johns Hopkins Univ. Press, 1981).
K. Ong and M. Taaffe, Approximating nonstationary PH(t)/PH(t)/1/c queueing systems, Math. Comput. Simulation 30 (1988) 441–452.
W. Press et al., Numerical Recipes (Cambridge Univ. Press, Cambridge, 1989).
V. Ramaswami, The N/G/1 queue and its detailed analysis, Adv. in Appl. Probab. 12 (1980) 222–261.
D. Richards and B. McDonald, A dynamic grid point allocation scheme for the characteristic finite difference method, Technical Report AECL-7147, Atomic Energy of Canada Limited (1981).
Y. Rubenstein, Monte Carlo Optimization, Simulation and Sensivity of Queueing Networks (Wiley, New York, 1986).
W. Stewart, An Introduction to the Solution of Markov Chains (Princeton Univ. Press, Princeton, NJ, 1994).
M. Taaffe and K. Ong, Approximating nonstationary PH(t)/M(t)/s/c queueing systems, Ann. Oper. Res. 8 (1987) 103–116.
C. Van Loan, The sensitivity of the matrix exponential, SIAM J. Numer. Anal. 14 (1973) 97–101.
J. Zhang, Transient solutions of time-dependent M/M/1 queues, IEEE Trans. Inform. Theory 37(6) (1991) 1690–1696.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Dormuth, D.W., Alfa, A.S. Two finite-difference methods for solving MAP(t)/PH(t)/1/K queueing models. Queueing Systems 27, 55–78 (1997). https://doi.org/10.1023/A:1019101828857
Issue Date:
DOI: https://doi.org/10.1023/A:1019101828857