| Article ID: | iaor20003813 |
| Country: | Singapore |
| Volume: | 14 |
| Issue: | 2 |
| Start Page Number: | 1 |
| End Page Number: | 8 |
| Publication Date: | Nov 1997 |
| Journal: | Asia-Pacific Journal of Operational Research |
| Authors: | McNickle Donald C. |
| Keywords: | queueing networks |
The distributions of busy period lengths for nodes or collections of nodes in Jackson networks are difficult to determine, since they constitute times between entrances to sub-classes of states in a complex Markov process. However, their means can be very easily found for at least one quite general definition of a busy period. This occurs because of an equivalence to a collection of independent queues.