Discrete time analysis of MAP/PH/1 vacation queue with gated time-limited service (Q1275377)

A discrete time single queue in which customers arrive according to the Markovian arrival process (MAP) is considered. In each work period, the server attends to the queue for no more than a fixed length of time \(T\). The system is gated one in which server, during any visit, does not attend to customers which were in the system before its visit. Special techniques to carry out the steady state analysis of the system are used, and it is shown when the information regarding the number of customers in the gate is not critical. The main result of the paper is the presentation of a method for obtaining the probability densities of the number of customers in the system at any time and of the waiting times, in addition to the densities of the work in the system at polling instants and at the start of a vacation.