An MAP/G/1 G-queues with preemptive resume and multiple vacations

作者：Liu Zaiming; Wu Jinbiao^*

来源：Applied Mathematical Modelling, 2009, 33(3): 1739-1748.

DOI：10.1016/j.apm.2008.03.013

• G-queues
• Markovian arrival process (MAP)
• Preemptive resume
• Multiple vacations
• Censoring technique
• RG-factorization

In this paper, we consider an MAP/G/1 G-queues with possible preemptive resume service discipline and multiple vacations wherein the arrival process of negative customers is Markovian arrival process (MAP). The arrival of a negative customer may remove the customer being in service. The server leaves for a vacation as soon as the system empties and is allowed to take repeated (multiple) vacations. The service and vacation times are arbitrarily distributed. We obtain the queue length distributions with the method of supplementary variables, combined with the matrix-analytic method and censoring technique. We also obtain the mean of the busy period based on the renewal theory. Finally we provide expressions for a special case.

• 出版日期2009-3
• 单位中南大学