RECURRENCE RELATIONS FOR TWO-CHANNEL QUEUING SYSTEMS WITH ERLANGIAN SERVICE TIME

摘要

We propose a method to investigate M / E~(s)/ 2 / m and M / E~(s)/ 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.