A discrete-time single-server queue with a modified N-policy

Abstract

We consider a discrete-time single-server queue where the idle server waits for reaching a level N in the queue size to start a batch service of N messages, although the following arrivals during the busy period receive single services. We find the stationary distributions of the queue and system lengths as well as some performance measures. The vacation and busy periods of the system and the number of messages served during a busy period are also analyzed. The stationary distributions of the time spent waiting in the queue and in the system are studied too. Finally, a total expected cost function is developed to determine the optimal operating N-policy at minimum cost.

Keywords:

• Busy periods
• Discrete-time queue
• Optimal control
• Waiting time

Acknowledgments

This work is supported by the MEC through the project MTM2005-01248.