Concavity of the conditional mean sojourn time in the M/G/1 processor-sharing queue with batch arrivals

초록

Avrachenkov et al. (Queueing Syst. 50:459-480, [2005]) conjectured that in an M/G/1 processor-sharing queue with batch arrivals, the conditional mean sojourn time is concave. In this paper, we show that this conjecture is generally not true.

키워드