The MAP,M/G1,G2/1 Queue with Preemptive Priority THE MAP,M/G,G/1 QUEUE WITH PREEMPTIVE PRIORITY

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 181
  • Download : 212
We consider the MAP, M/G1,G2/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 gl(x) (respectively: g2(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.
Publisher
Hindawi Publishing Corporation
Issue Date
1997
Language
English
Citation

JOURNAL OF APPLIED MATHEMATICS AND STOCHASTIC ANALYSIS, v.10, no.4, pp.407 - 421

ISSN
1048-9533
URI
http://hdl.handle.net/10203/22863
Appears in Collection
MA-Journal Papers(저널논문)
Files in This Item

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0