Abstract
It is pointed out that a multiclass closed queueing network can be indecomposable even if every customer can not reach every server in the network. A necessary and sufficient condition for a multiclass network to be indecomposable is given. The results display the dynamic feature of queueing networks.
| Original language | English |
|---|---|
| Pages (from-to) | 257-262 |
| Number of pages | 6 |
| Journal | Proceedings of the IEEE Conference on Decision and Control |
| DOIs | |
| Publication status | Published - 1987 |
| Externally published | Yes |