| Article ID: | iaor20003193 |
| Country: | Netherlands |
| Volume: | 32 |
| Issue: | 1/3 |
| Start Page Number: | 41 |
| End Page Number: | 64 |
| Publication Date: | Jan 1999 |
| Journal: | Queueing Systems |
| Authors: | Sakhanenko Alexander I. |
| Keywords: | networks: path |
This paper presents a three-step procedure which allows to approximate the queue-length and the busy-time processes associated with open queueing networks. These three approximations are based on reflection mappings and are introduced with explicit estimates of their accuracy. The third one may be treated as approximation by accompanying reflection Brownian motions with rates of convergence.