Markov-modulated finite-source queueing models and their applications (Q1866694)

The paper studies the usual stationary performance measures like utilization, mean number of the requests staying at the server, mean queue length, average waiting and sojourn times. The principal problem is the fact that the state space of the underlying continuous-time Markov chain can be very large. To avoid this problem, in the case of fast arrival or fast services, some asymptotic methods are applied.