On the numerical solution of transient probabilities of a state-dependent multiserver queue

From MaRDI portal





The paper studies a state-dependent multiserver queueing (SDMQ) model in which the arrival rate increases if there are fewer units in the system and steadily decreases to zero for large number of units. By writing the Laplace transform of these probabilities as a continued fraction and by finding the inversion through the properties of tridiagonal matrices, the authors obtain approximate values for the transient system probabilities, mean and variance of system size, and the probability density function of the duration of the busy period for the SDMQ model. The effectiveness of the proposed procedure is ilustrated by tables and graphs of the computed values for the SDMQ model and its busy period.











This page was built for publication: On the numerical solution of transient probabilities of a state-dependent multiserver queue

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4380278)