M/G/\(\infty\) tandem queues (Q799040)
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 3872445
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | M/G/\(\infty\) tandem queues |
scientific article; zbMATH DE number 3872445 |
Statements
M/G/\(\infty\) tandem queues (English)
0 references
1984
0 references
Another contribution to the currently fashionable topic of networks of service systems. The subsystems are in this case in series and each node is endowed with an infinite number of parallel service channels. The input to the total system is Poisson and the service times at each node have a common distribution which may be different from node to node. A neat analysis yields the joint stationary distribution of the numbers of customers at the various nodes when a particular customer arrives there on his way through the system. It is interesting to speculate how far the analysis might go with finite (greater than one) numbers of channels at the nodes.
0 references
tandem queue
0 references
networks of service systems
0 references
0.8147701621055603
0 references
0.8111476898193359
0 references
0.8091294765472412
0 references
0.8086618185043335
0 references
