Persistent Link:
http://hdl.handle.net/10150/291729
Title:
Some descriptors of the Markovian arrival process
Author:
Narayana, Surya, 1962-
Issue Date:
1991
Publisher:
The University of Arizona.
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.
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.
Type:
text; Thesis-Reproduction (electronic)
Keywords:
Engineering, Industrial.; Engineering, System Science.; Operations Research.
Degree Name:
M.S.
Degree Level:
masters
Degree Program:
Graduate College; Systems and Industrial Engineering
Degree Grantor:
University of Arizona
Advisor:
Neuts, Marcel F.

Full metadata record

DC FieldValue Language
dc.language.isoen_USen_US
dc.titleSome descriptors of the Markovian arrival processen_US
dc.creatorNarayana, Surya, 1962-en_US
dc.contributor.authorNarayana, Surya, 1962-en_US
dc.date.issued1991en_US
dc.publisherThe University of Arizona.en_US
dc.rightsCopyright © 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.description.abstractThe 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.en_US
dc.typetexten_US
dc.typeThesis-Reproduction (electronic)en_US
dc.subjectEngineering, Industrial.en_US
dc.subjectEngineering, System Science.en_US
dc.subjectOperations Research.en_US
thesis.degree.nameM.S.en_US
thesis.degree.levelmastersen_US
thesis.degree.disciplineGraduate Collegeen_US
thesis.degree.disciplineSystems and Industrial Engineeringen_US
thesis.degree.grantorUniversity of Arizonaen_US
dc.contributor.advisorNeuts, Marcel F.en_US
dc.identifier.proquest1346134en_US
dc.identifier.bibrecord.b27179436en_US
All Items in UA Campus Repository are protected by copyright, with all rights reserved, unless otherwise indicated.