Threshold Workload Control in the BMAP/G/1 Queue

We analyze the distribution of the workload in the queueing system with batch Markovian arrival process (BMAP) controlled according to the D-policy. The server begins to serve the customers only when the total workload exceeds some predetermined threshold value D. We first explore the stochastic nature of the idle period. Then we derive the Laplace-Stieltjes transform of the workload and the mean values at an arbitrary time. Finally we provide computational experiences and discuss the effects of the BMAP arrivals. Our study shows that the naive Poisson assumption heavily underestimates the workload in a queueing system. We also discuss the effect of the workload threshold control