Linear independence of root equations for M/G /1 type Markov chains
dc.contributor.author | Gail, H. R. | en_US |
dc.contributor.author | Hantler, S. L. | en_US |
dc.contributor.author | Sidi, M. | en_US |
dc.contributor.author | Taylor, B. Alan | en_US |
dc.date.accessioned | 2006-09-11T19:11:53Z | |
dc.date.available | 2006-09-11T19:11:53Z | |
dc.date.issued | 1995-09 | en_US |
dc.identifier.citation | Gail, H. R.; Hantler, S. L.; Sidi, M.; Taylor, B. A.; (1995). "Linear independence of root equations for M/G /1 type Markov chains." Queueing Systems 20 (3-4): 321-339. <http://hdl.handle.net/2027.42/47619> | en_US |
dc.identifier.issn | 0257-0130 | en_US |
dc.identifier.issn | 1572-9443 | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/47619 | |
dc.description.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. | en_US |
dc.format.extent | 834716 bytes | |
dc.format.extent | 3115 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | text/plain | |
dc.language.iso | en_US | |
dc.publisher | Kluwer Academic Publishers; J.C. Baltzer AG, Science Publishers ; Springer Science+Business Media | en_US |
dc.subject.other | Economics / Management Science | en_US |
dc.subject.other | Computer Communication Networks | en_US |
dc.subject.other | Systems Theory, Control | en_US |
dc.subject.other | Probability Theory and Stochastic Processes | en_US |
dc.subject.other | Operation Research/Decision Theory | en_US |
dc.subject.other | Production/Logistics | en_US |
dc.subject.other | Matrix Analytic Method | en_US |
dc.subject.other | Transform Method | en_US |
dc.subject.other | Ergodicity | en_US |
dc.title | Linear independence of root equations for M/G /1 type Markov chains | en_US |
dc.type | Article | en_US |
dc.subject.hlbsecondlevel | Industrial and Operations Engineering | en_US |
dc.subject.hlbsecondlevel | Management | en_US |
dc.subject.hlbsecondlevel | Economics | en_US |
dc.subject.hlbtoplevel | Engineering | en_US |
dc.subject.hlbtoplevel | Business | en_US |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.contributor.affiliationum | The University of Michigan, 48109, Ann Arbor, MI, USA | en_US |
dc.contributor.affiliationother | IBM Thomas J. Watson Research Center, 10598, Yorktown Heights, NY, USA | en_US |
dc.contributor.affiliationother | IBM Thomas J. Watson Research Center, 10598, Yorktown Heights, NY, USA | en_US |
dc.contributor.affiliationother | Technion, IIT, 32000, Haifa, Israel | en_US |
dc.contributor.affiliationumcampus | Ann Arbor | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/47619/1/11134_2005_Article_BF01245323.pdf | en_US |
dc.identifier.doi | http://dx.doi.org/10.1007/BF01245323 | en_US |
dc.identifier.source | Queueing Systems | en_US |
dc.owningcollname | Interdisciplinary and Peer-Reviewed |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.