论文信息 - A Markov-modulated M/G/1 queue II: Busy period and time for buffer overflow

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

We consider an M/G/1 queue where the arrival and service processes are modulated by a two state Markov chain. We assume 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. We compute 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.

Charles Knessl | Bernard J. Matkowsky | Zeev Schuss | Charles Tier

[1] B. Matkowsky,et al. The Exit Problem for Randomly Perturbed Dynamical Systems , 1977 .

[2] C. Knessl,et al. A finite capacity single-server queue with customer loss , 1986 .

[3] C. Knessl,et al. Asymptotic analysis of a state-dependent M / G /1 queueing system , 1986 .

[4] Charles Knessl,et al. A subjective Bayesian approach to the theory of queues II—Inference and information in M/M/1 queues , 1987 .

[5] C. Knessl,et al. System crash in a finite capacity m/g/1 queue , 1986 .

[6] C. Knessl,et al. An Asymptotic Theory of Large Deviations for Markov Jump Processes , 1985 .