On the M/G/1 queue with D-policy

摘要

This paper deals with the M/G/1 queue with D-policy, i.e., the server is turned off at the end of a busy period and turned on when the cumulative amount of work firstly exceeds some fixed value D. We first concentrate on the computation of the steady-state probabilities. The first moments and relationships among the busy period, the number of customers served and other performance measures are investigated. Some variants of the main model and the special case of the M/M/1 are also studied.