Show simple item record

An Algorithmic Analysis of the MMPP/G/1 Queue.

dc.contributor.authorGun, Leventen_US
dc.date.accessioned2007-05-23T09:41:19Z
dc.date.available2007-05-23T09:41:19Z
dc.date.issued1988en_US
dc.identifier.urihttp://hdl.handle.net/1903/4771
dc.description.abstractA single server queue with general service time distribution is considered when the input is a Markov modulated Poisson process (MMPP). An algorithmic solution to the transform of the stationary delay and queue length distributions is summarized, and recursive closed-form expressions are obtained for the moments of these distributions. The numerical implementation of these results is discussed in detail with particular reference to an algorithm due to Lucantoni and Ramaswami [11] and its accelerated version due to Ramaswami [19]. This algorithm is shown to be an efficient tool in the matrix-analytic solution of many stochastic models, as various steps for saving considerable amounts of unnecessary computations are identified. A special case of the model where the service time distribution is of phase type is discussed and the stationary queue length distribution at arbitrary times is obtained in matriz-geometric form. Finally, the matrix-geometric and the M/G/I approaches are compared through this special case.en_US
dc.format.extent1076119 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen_USen_US
dc.relation.ispartofseriesISR; TR 1988-40en_US
dc.titleAn Algorithmic Analysis of the MMPP/G/1 Queue.en_US
dc.typeTechnical Reporten_US
dc.contributor.departmentISRen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record