Queueing networks with blocking
Queueing networks with blocking
Series Expansions For Finite-State Markov Chains
Probability in the Engineering and Informational Sciences
Computer Networks: The International Journal of Computer and Telecommunications Networking
Markov Chains and Stochastic Stability
Markov Chains and Stochastic Stability
Series Expansions for Continuous-Time Markov Processes
Operations Research
Kernel density in the study of the strong stability of the M/M/1 queueing system
Operations Research Letters
| Hi-index | 0.09 |
Real life queueing network problems are often very complicated and are usually solved only through approximations. It is therefore very important to justify these approximations and estimate the resulting error. In this work, we approximate the characteristics of the model [M"2/G"2/1-@?/G/1/1] tandem queue, with non-preemptive priority, by those of the classical model [M/G/1-@?/G/1/1] tandem queue, when the arrival intensity of the priority stream is sufficiently small. This classical queueing network is simpler and more exploitable. Using the strong stability approach, we obtain explicit upper bounds for the error of the approximation. From these theoretical results, we develop an algorithm which allows us to verify the approximation conditions and provide the error made. Finally, numerical examples and simulation studies are presented to illustrate the efficiency of the proposed algorithm.