A solution for multiserver and multiclass open queueing networks. (English) Zbl 0604.90058

Pujolle, Guy; Ai, Wu

INFOR 24, 221-230 (1986).

An approximate solution for a complex queueing network is proposed. The queueing network is an open network with N G/G/m queueing stations with arbitrary interconnections. Different classes of customers served with FIFO (First in First Out) service discipline are allowed. In a previous paper [RAIRO, Rech. Oper. 19, 117-131 (1985; Zbl 0568.60092)] we have developed an approximate solution for a G/G/m station. We extend this result to several classes of customers and to a general network. Two examples of elementary networks are analysed with this new method. Numerical results are compared with simulation results to indicate the accuracy of the solution.

MSC:

90B22	Queues and service in operations research
90B10	Deterministic network models in operations research
60K25	Queueing theory (aspects of probability theory)
60K20	Applications of Markov renewal processes (reliability, queueing networks, etc.)

Keywords:

approximate solution; complex queueing network

Citations:

Zbl 0568.60092