Approximations of open queueing networks by reflection mappings

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. This revised version was published online in June 2006 with corrections to the Cover Date.