GENERALIZED PRIORITY MODELS WITH “LOOK AHEAD” STRATEGY: NUMERICAL ALGORITHMS FOR BUSY PERIODS

摘要

Some analytical results concerning busy period distributions for M>|G2|1 generalized queueing systems with semi-Markov switching and so called “look ahead” strategy are discussed in this paper. We show that the presented analytical results can be viewed as a 2- dimensional analog of the well-known in queueing theory Kendall-Takacs functional equation. Numerical algorithms and modelling examples for busy periods are also pre- sented. Acknowledgement. This work is partially supported by Russian Foundation for Basic Research (RFFI) grant 08.820.08.09RF and grant 09.820.08.01GF of the Federal Min- istry of Education and Research (BMBF) of Germany.