pith. sign in

arxiv: 2108.12890 · v1 · pith:6U2H6X2Znew · submitted 2021-08-29 · 🧮 math.PR

Diffusion Approximations for Cox/G_t/infty Queues In A Fast Oscillatory Random Environment

classification 🧮 math.PR
keywords fcltsannealeddiffusionapproximationscasesdrivingenvironmentfast
0
0 comments X
read the original abstract

We study infinite server queues driven by Cox processes in a fast oscillatory random environment. While exact performance analysis is difficult, we establish diffusion approximations to the (re-scaled) number-in-system process by proving functional central limit theorems (FCLTs) using a stochastic homogenization framework. This framework permits the establishment of quenched and annealed limits in a unified manner. At the quantitative level, we identity two parameter regimes, termed subcritical and supercritical indicating the relative dominance between the two underlying stochasticities driving our system: the randomness in the arrival intensity and that in the serivce times. We show that while quenched FCLTs can only be established in the subcritical regime, annealed FCLTs can be proved in both cases. Furthermore, the limiting diffusions in the annealed FCLTs display qualitatively different diffusivity properties in the two regimes, even though the stochastic primitives are identical. In particular, when the service time distribution is heavy-tailed, the diffusion is sub- and super-diffusive in the sub- and super-critical cases. The results illustrate intricate interactions between the underlying driving forces of our system.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.