| Article ID: | iaor20014217 |
| Country: | China |
| Volume: | 4 |
| Issue: | 1 |
| Start Page Number: | 22 |
| End Page Number: | 32 |
| Publication Date: | Feb 2000 |
| Journal: | OR Transactions |
| Authors: | Hsu Guanghui, Cao Chengxuan |
| Keywords: | queueing networks |
The authors consider the matched queueing network PH/M/C with PH/PH/1. The probability distributions of busy periods and non-idle periods for the two sub-systems and the whole network are studied and their algorithms with uniform error are derived. It is proved that both the time and space complexities of the algorithms are polynomially bounded. At last, a numerical example is presented.