A Solution For Multiserver And Multiclass Open Queueing Networks (Q3741373)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3976738
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Solution For Multiserver And Multiclass Open Queueing Networks |
scientific article; zbMATH DE number 3976738 |
Statements
A Solution For Multiserver And Multiclass Open Queueing Networks (English)
0 references
1986
0 references
approximate solution
0 references
complex queueing network
0 references
0.8457971215248108
0 references
0.8301440477371216
0 references
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.
0 references