Article thumbnail

The discrete-time MAP/PH/1 queue with multiple working vacations

By Cosmika Goswami and N. Selvaraju

Abstract

We consider a discrete-time single-server queueing model where arrivals are governed by a discrete Markovian arrival process (DMAP), which captures both burstiness and correlation in the interarrival times, and the service times and the vacation duration times are assumed to have a general phase-type distributions. The vacation policy is that of a working vacation policy where the server serves the customers at a lower rate during the vacation period as compared to the rate during the normal busy period. Various performance measures of this queueing system like the stationary queue length distribution, waiting time distribution and the distribution of regular busy period are derived. Through numerical experiments, certain insights are presented based on a comparison of the considered model with an equivalent model with independent arrivals, and the effect of the parameters on the performance measures of this model are analyzed

Publisher: 'Elsevier BV'
Year: 2010
DOI identifier: 10.1016/j.apm.2009.07.021
OAI identifier: oai:eprints.gla.ac.uk:187456
Provided by: Enlighten
Sorry, our data provider has not provided any external links therefore we are unable to provide a link to the full text.

Suggested articles


To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.