Methods of limiting decomposition and Markovian summation in queueing system with infinite number of servers A. A. Nazarov, D. Dammer
Material type:
ArticleContent type: Текст Media type: электронный Subject(s): системы массового обслуживания | характеристическая функция | метод марковского суммирования | метод предельной декомпозицииGenre/Form: статьи в сборниках Online resources: Click here to access online
In:
Information Technologies and Mathematical Modelling. Queueing Theory and Applications : 17th International Conference, ITMM 2018, named after A. F. Terpugov and 12th Workshop on Retrial Queues and Related Topics, WRQ 2018, Tomsk, Russia, September 10-15, 2018 : selected papers P. 71-82Abstract: In this paper, we study the process generated by the customers which are serviced in a queueing system with an infinite number of servers. Two methods referred to as the method of limiting decomposition and the method of Markovian summation are proposed, implemented and compared. The characteristic function of the probability distribution for the studied process is obtained. The numerical examples are performed for different values of queueing system characteristics.
Библиогр.: 18 назв.
In this paper, we study the process generated by the customers which are serviced in a queueing system with an infinite number of servers. Two methods referred to as the method of limiting decomposition and the method of Markovian summation are proposed, implemented and compared. The characteristic function of the probability distribution for the studied process is obtained. The numerical examples are performed for different values of queueing system characteristics.
There are no comments on this title.