An analysis of a class of telecommunications models

In this short note we outline a general method for characterizing the ergodicity and computing performance measures for a large class of telecommunications models. We also point out errors that have appeared in the literature when using the transform method to analyze such models.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/31202/1/0000104.pd

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

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.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/47619/1/11134_2005_Article_BF01245323.pd