Show simple item record

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

dc.contributor.authorGail, H. R.en_US
dc.contributor.authorHantler, S. L.en_US
dc.contributor.authorSidi, M.en_US
dc.contributor.authorTaylor, B. Alanen_US
dc.date.accessioned2006-09-11T19:11:53Z
dc.date.available2006-09-11T19:11:53Z
dc.date.issued1995-09en_US
dc.identifier.citationGail, 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.issn0257-0130en_US
dc.identifier.issn1572-9443en_US
dc.identifier.urihttps://hdl.handle.net/2027.42/47619
dc.description.abstractThere 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.extent834716 bytes
dc.format.extent3115 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypetext/plain
dc.language.isoen_US
dc.publisherKluwer Academic Publishers; J.C. Baltzer AG, Science Publishers ; Springer Science+Business Mediaen_US
dc.subject.otherEconomics / Management Scienceen_US
dc.subject.otherComputer Communication Networksen_US
dc.subject.otherSystems Theory, Controlen_US
dc.subject.otherProbability Theory and Stochastic Processesen_US
dc.subject.otherOperation Research/Decision Theoryen_US
dc.subject.otherProduction/Logisticsen_US
dc.subject.otherMatrix Analytic Methoden_US
dc.subject.otherTransform Methoden_US
dc.subject.otherErgodicityen_US
dc.titleLinear independence of root equations for M/G /1 type Markov chainsen_US
dc.typeArticleen_US
dc.subject.hlbsecondlevelIndustrial and Operations Engineeringen_US
dc.subject.hlbsecondlevelManagementen_US
dc.subject.hlbsecondlevelEconomicsen_US
dc.subject.hlbtoplevelEngineeringen_US
dc.subject.hlbtoplevelBusinessen_US
dc.description.peerreviewedPeer Revieweden_US
dc.contributor.affiliationumThe University of Michigan, 48109, Ann Arbor, MI, USAen_US
dc.contributor.affiliationotherIBM Thomas J. Watson Research Center, 10598, Yorktown Heights, NY, USAen_US
dc.contributor.affiliationotherIBM Thomas J. Watson Research Center, 10598, Yorktown Heights, NY, USAen_US
dc.contributor.affiliationotherTechnion, IIT, 32000, Haifa, Israelen_US
dc.contributor.affiliationumcampusAnn Arboren_US
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/47619/1/11134_2005_Article_BF01245323.pdfen_US
dc.identifier.doihttp://dx.doi.org/10.1007/BF01245323en_US
dc.identifier.sourceQueueing Systemsen_US
dc.owningcollnameInterdisciplinary and Peer-Reviewed


Files in this item

Show simple item record

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.