Linear independance of root equations for M/G/1 type Markov chains

Linear independance of root equations for M/G/1 type Markov chains

0.00 Avg rating0 Votes
Article ID: iaor19971625
Country: United States
Volume: 20
Issue: 3/4
Start Page Number: 321
End Page Number: 339
Publication Date: Oct 1995
Journal: Queueing Systems
Authors: , , ,
Keywords: queues
Abstract:

There is a classical technique for determining the equilibrium probabilities of M/G/1 type Markov chains. After transforming the equilibrium balance equations of the chain, one obtains an equivalent system of equations in analytic functions to be solved. This method requires finding all singularities of a given matrix function in the unit disk and then using them to obtain a set of linear equations in the finite number of unknown boundary probabilities. The remaining probabilities and other measures of interest are then computed from the boundary probabilities. Under certain technical assumptions, the linear independence of the resulting equations is established by a direct argument involving only elementary results from matrix theory and complex analysis. Simple conditions for the ergodicity and nonergodicity of the chain are also given.

Reviews

Required fields are marked *. Your email address will not be published.