摘要
General expressions of first passage times for denumerable Markov processes are discussed and computation problems for busy periods and waiting times for queues corresponding to Markov processes are studied. In particular, the simplified algorithms for busy periods and waiting times for queues corresponding to G//M/1 type and M/G/1 type Markov processes are derived and some numerical examples are presented.
General expressions of first passage times for denumerable Markov processes are discussed and computation problems for busy periods and waiting times for queues corresponding to Markov processes are studied. In particular, the simplified algorithms for busy periods and waiting times for queues corresponding to G//M/1 type and M/G/1 type Markov processes are derived and some numerical examples are presented.
基金
the National Natural Science Foundation of China