Tail Asymptotics for the Delay in a Brownian Fork-Join Queue
Abstract
In this paper, we study the tail behavior of i≤ Ns>0(Wi(s)+WA(s)-β s) as N∞, with (Wi,i≤ N) i.i.d. Brownian motions and WA an independent Brownian motion. This random variable can be seen as the maximum of N mutually dependent Brownian queues, which in turn can be interpreted as the backlog in a Brownian fork-join queue. In previous work, we have shown that this random variable centers around σ22β N. Here, we analyze the rare-event that this random variable reaches the value (σ22β+a) N, with a>0. It turns out that its probability behaves roughly as a power law with N, where the exponent depends on a. However, there are three regimes, around a critical point a; namely, 0<a<a, a=a, and a>a. The latter regime exhibits a form of asymptotic independence, while the first regime reveals highly irregular behavior with a clear dependence structure among the N suprema, with a nontrivial transition at a=a.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.