Extensions of results of Komlo´s, Major, and Tusna´dy to the multivariate case
Journal of Multivariate Analysis
Discrete flow networks: bottleneck analysis and fluid approximations
Mathematics of Operations Research
Strong approximations of open queueing networks
Mathematics of Operations Research
Diffusion approximations for open Jackson networks with reneging
Queueing Systems: Theory and Applications
| Hi-index | 0.00 |
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.