The MAP, M / G 1, G 2 / 1 queue with preemptive priority

Bong Dae Choi and Gang Uk Hwang

International Journal of Stochastic Analysis, 1997, vol. 10, 1-15

Abstract:

We consider the MAP, M / G 1 , G 2 / 1 queue with preemptive resume priority, where low priority customers arrive to the system according to a Markovian arrival process (MAP) and high priority customers according to a Poisson process. The service time density function of low (respectively: high) priority customers is g 1 ( x ) (respectively: g 2 ( x ) ). We use the supplementary variable method with Extended Laplace Transforms to obtain the joint transform of the number of customers in each priority queue, as well as the remaining service time for the customer in service in the steady state. We also derive the probability generating function for the number of customers of low (respectively, high) priority in the system just after the service completion epochs for customers of low (respectively, high) priority.

Date: 1997
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://downloads.hindawi.com/journals/IJSA/10/306101.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJSA/10/306101.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnijsa:306101

DOI: 10.1155/S1048953397000440

Access Statistics for this article

More articles in International Journal of Stochastic Analysis from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().