Article contents
Convergence of tandem Brownian queues
Published online by Cambridge University Press: 21 June 2016
Abstract
It is known that in a stationary Brownian queue with both arrival and service processes equal in law to Brownian motion, the departure process is a Brownian motion, identical in law to the arrival process: this is the analogue of Burke's theorem in this context. In this paper we prove convergence in law to this Brownian motion in a tandem network of Brownian queues: if we have an arbitrary continuous process, satisfying some mild conditions, as an initial arrival process and pass it through an infinite tandem network of queues, the resulting process weakly converges to a Brownian motion. We assume independent and exponential initial workloads for all queues.
- Type
- Short Communications
- Information
- Copyright
- Copyright © Applied Probability Trust 2016
References
- 1
- Cited by