Numerical recipes in C (2nd ed.): the art of scientific computing
Numerical recipes in C (2nd ed.): the art of scientific computing
Busy period analysis of the level dependent PH/PH/1/K queue
Queueing Systems: Theory and Applications
Hi-index | 0.00 |
In this paper, we study the transient behavior of a state dependent M/M/1/K queue during the busy period. We derive in closed-form the joint transform of the length of the busy period, the number of customers served during the busy period, and the number of losses during the busy period. For two special cases called the threshold policy and the static policy we determine simple expressions for their joint transform.