作者: Marcel F Neuts
DOI:
关键词:
摘要: Abstract : Computationally feasible solutions are studied for a number of problems related to M/M/1 queve in which the arrival and service rates vary according state an underlying Markov chain. Our results may be used mode effects rush-hour phenomena or other extraneous fluctuations on characteristics queue.