Tail asymptotics for the delay in a Brownian fork-join queue
From MaRDI portal
Publication:6072902
DOI10.1016/J.SPA.2023.06.013zbMATH Open1524.60242arXiv2208.04796OpenAlexW4382934376MaRDI QIDQ6072902FDOQ6072902
Authors: Dennis Schol, M. Vlasiou, Bert Zwart
Publication date: 15 September 2023
Published in: Stochastic Processes and their Applications (Search for Journal in Brave)
Abstract: In this paper, we study the tail behavior of as , with i.i.d. Brownian motions and an independent Brownian motion. This random variable can be seen as the maximum of 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 . Here, we analyze the rare-event that this random variable reaches the value , with . It turns out that its probability behaves roughly as a power law with , where the exponent depends on . However, there are three regimes, around a critical point ; namely, , , and . The latter regime exhibits a form of asymptotic independence, while the first regime reveals highly irregular behavior with a clear dependence structure among the suprema, with a nontrivial transition at .
Full work available at URL: https://arxiv.org/abs/2208.04796
Extreme value theory; extremal stochastic processes (60G70) Queueing theory (aspects of probability theory) (60K25) Brownian motion (60J65)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Extreme value theory. An introduction.
- Title not available (Why is that?)
- Two Parallel Queues Created by Arrivals with Two Demands I
- Extremes of vector-valued Gaussian processes: exact asymptotics
- Gaussian limits for a fork-join network with nonexchangeable synchronization in heavy traffic
- Large Fork-Join Queues with Nearly Deterministic Arrival and Service Times
- Large Deviations for Gaussian Queues
- Two parallel processors with coupled inputs
- First-passage times of two-dimensional Brownian motion
- Response times in M/M/s fork-join networks
- Heavy-traffic limits for an infinite-server fork-join queueing system with dependent and disruptive services
- Processing networks with parallel and sequential tasks: Heavy traffic analysis and Brownian limits
- The trouble with diversity: Fork-join networks with heterogeneous customer population
- Title not available (Why is that?)
- Exact asymptotics of component-wise extrema of two-dimensional Brownian motion
Cited In (2)
This page was built for publication: Tail asymptotics for the delay in a Brownian fork-join queue
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6072902)