Abstract
A reduced system is a smaller system derived in the process of analyzing a larger system. While solving for steady-state probabilities of a Markov chain, generally the solution can be found by first solving a reduced system of equations which is obtained by appropriately partitioning the transition probability matrix. In this paper, we catagorize reduced systems as standard and nonstandard and explore the existence of reduced systems and their properties relative to the original system. We also discuss first passage probabilities and means for the standard reduced system relative to the original system. These properties are illustrated while determining the steady-state probabilities and first passage time characteristics of a queueing system.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
D. Fife, Which linear compartmental systems contain traps?, Math. Biosci. 14(1972)311.
J.G. Kemeny, J.L. Snell and A.W. Knapp,Denumerable Markov Chains (D. Van Nostrand Company, Inc., Princeton, N.J., 1966).
R. Lal, A unified study of algorithms for steady state probabilities in Markov chains, Ph.D. Dissertation, Department of Operations Research and Engineering Management, School of Engineering and Applied Sciences, Southern Methodist University, Dallas, Texas 75275 (1981).
R. Lal and U.N. Bhat, Reduced system algorithms for Markov chains, submitted for publication, 1986.
R. Lal and U.N. Bhat, Algorithms for finding steady state probabilities for some special classes of finite state Markov chains, Oper. Res. Lett. 5(1986)305.
P. Lancaster,Theory of Matrices (Academic Press, New York, 1969).
G. Latouche, P.A. Jacobs and D.P. Gaver, Finite Markov chain models skip-free in one direction, Naval Research Logistics Quarterly 31(1984)571.
M.F. Neuts,Matrix-Geometric Solutions in Stochastic Models: An Algorithm Approach (The Johns Hopkins Press Baltimore, Maryland, 1981).
M.F. Neuts and Y. Takahashi, Asymptotic behavior of the stationary distributions in the GI/PH/c queue with heterogeneous servers, Zeit, für Wahrscheinlichkeitstheorie 57(1981) 441.
S.N. Raju, Steady state results for finite queues with almost quasi-triangular one step TPM'S-I, Technical Report Mgnt. 77013, Management Department, College of Business and Economics, University of Wisconsin-Whitewater, Whitewater, Wisconsin 53190 (1978).
S.N. Raju and U.N. Bhat, Recursive relations in the computation of the equilibrium results of finite queues, Studies in the Management Sciences (North-Holland) 7(1977)247.
M.A. Shalaby, A generalized measure of performance-properties and optimization in a class of queueing systems, Doctoral Dissertation, Department of Operations Research and Engineering Management, Southern Methodist University, Dallas, Texas 75275 (1978).
J.G. Shanthikumar and R.G. Sargent, An algorithmic approach for a special class of Markov chains, Oper. Res. Lett. 3(1984)81.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Lal, R., Narayan Bhat, U. Reduced systems in Markov chains and their applications in queueing theory. Queueing Syst 2, 147–172 (1987). https://doi.org/10.1007/BF01158397
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01158397