Рекуррентные соотношения для двуканальных систем с эрланговским временем обслуживания / Жерновый Ю. В. (2018)
Ukrainian

English  Cybernetics and Systems Analysis   /     Issue (2018, 54 (3))

Zhernovyi Y.V.
Recurrence relations for two-channel queuing systems with Erlangian service times

We propose a method to investigate M / Es / 2 / m and M / Es / 2 /∞ queueing systems including the case of random dropping of customers. Recurrence relations are obtained for computing the stationary distribution of the number of customers in the system and its steady-state characteristics. The developed algorithms are tested on examples using simulation models constructed with the help of the GPSS World tools. © 2018, Springer Science+Business Media, LLC, part of Springer Nature.

Keywords: Erlangian service times, fictitious phase method, random dropping of customers, recurrence relations, steady-state characteristics, two-channel queueing systems, Queueing theory, Sales, State estimation, Phase methods, Queueing system, random dropping of customers, Recurrence relations, Service time, Steady state characteristics, Queueing networks


Cite:
Zhernovyi Y.V. (2018). Recurrence relations for two-channel queuing systems with Erlangian service times. Cybernetics and Systems Analysis, 54 (3), 151-159. doi: https://doi.org/10.1007/s10559-018-0048-6 http://jnas.nbuv.gov.ua/article/UJRN-0000863966 [In Russian].


 

Інститут інформаційних технологій НБУВ


+38 (044) 525-36-24
Голосіївський просп., 3, к. 209
м. Київ, 03039, Україна