| Article ID: | iaor2005774 |
| Country: | China |
| Volume: | 23 |
| Issue: | 2 |
| Start Page Number: | 170 |
| End Page Number: | 181 |
| Publication Date: | Apr 2003 |
| Journal: | Journal of Systems Science and Complexity |
| Authors: | Hou Weibo |
| Keywords: | queueing networks |
In this paper, a Fork-Join queueing network is studied by means of strong approximation theory. Some strong approximation theorems for response time are given under various workloads.