Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC.
Association for Computing Machinery.
Том Part F129312.
2017.
С. 285-292
We suggest a convolution algorithm for calculating the normalization constant for stationary probabilities of a multiserver queuing system with random resource requirements. Our algorithm significantly reduces computing time of the stationary probabilities and system characteristics such as blocking probabilities and average number of occupied resources. The algorithm aims to avoid calculation of k-fold convolutions and reasonably use memory resources. © 2017 Author(s).