Some descriptors of the Markovian arrival process
| dc.contributor.advisor | Neuts, Marcel F. | en_US |
| dc.contributor.author | Narayana, Surya, 1962- | |
| dc.creator | Narayana, Surya, 1962- | en_US |
| dc.date.accessioned | 2013-05-16T09:38:28Z | |
| dc.date.available | 2013-05-16T09:38:28Z | |
| dc.date.issued | 1991 | en_US |
| dc.identifier.uri | http://hdl.handle.net/10150/291729 | |
| dc.description.abstract | The Markovian Arrival Process (MAP) is a tractable, versatile class of Markov renewal processes which has been extensively used to model arrival (or service) processes in queues. This thesis mainly deals with the first two moment matrices of the counts for the MAP. We derive asymptotic expansions for these two moment matrices and also derive efficient and stable algorithms to compute these matrices numerically. Simpler expressions for some of the classical mathematical descriptors of the superposition of independent MAPs also are derived. | |
| dc.language.iso | en_US | en_US |
| dc.publisher | The University of Arizona. | en_US |
| dc.rights | Copyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author. | en_US |
| dc.subject | Engineering, Industrial. | en_US |
| dc.subject | Engineering, System Science. | en_US |
| dc.subject | Operations Research. | en_US |
| dc.title | Some descriptors of the Markovian arrival process | en_US |
| dc.type | text | en_US |
| dc.type | Thesis-Reproduction (electronic) | en_US |
| thesis.degree.grantor | University of Arizona | en_US |
| thesis.degree.level | masters | en_US |
| dc.identifier.proquest | 1346134 | en_US |
| thesis.degree.discipline | Graduate College | en_US |
| thesis.degree.discipline | Systems and Industrial Engineering | en_US |
| thesis.degree.name | M.S. | en_US |
| dc.identifier.bibrecord | .b27179436 | en_US |
| refterms.dateFOA | 2018-06-28T04:04:00Z | |
| html.description.abstract | The Markovian Arrival Process (MAP) is a tractable, versatile class of Markov renewal processes which has been extensively used to model arrival (or service) processes in queues. This thesis mainly deals with the first two moment matrices of the counts for the MAP. We derive asymptotic expansions for these two moment matrices and also derive efficient and stable algorithms to compute these matrices numerically. Simpler expressions for some of the classical mathematical descriptors of the superposition of independent MAPs also are derived. |
