A Markov-modulated M/G/1 queue. II: Busy period and time for buffer overflow (Q1113546)

[For part I see the preceding review, Zbl 0662.60099.] An M/G/1 queue where the arrival and service processes are modulated by a two-state Markov chain is connsidered and it is assumed that the arrival rate, service time density and the rates at which the Markov chain switches its state, are functions of the total unfinished work (buffer content) in the queue. Asymptotic approximations to performance measures such as the mean residual busy period, mean length of a busy period, and the mean time to reach capacity are computed. (From the authors' abstract.)