Tue, 28 Apr 2009
17:00 -
19:00
L3
When two single server queues have the same arrivals process, this is said to be a `fork-join queue'. In the case where the arrivals and service processes are Brownian motions, the queue lengths process is a reflecting Brownian motion in the nonnegative orthant. Tan and Knessl [1996] have given a simple explicit formula for the stationary distribution for this queueing system in a symmetric case, which they obtain as a heavy traffic limit of the classical discrete model. With this as a starting point, we analyse the Brownian model directly in further detail, and consider some related exit problems.