betaFeedback

WorksMathematics

Critical heavy traffic and diffusion limits for shortest-of-d dynamic routing

Abstract

We study shortest-of-dd routing, with fixed d≥2d\ge2, in NN parallel queues with independent finite-state Markov service environments switching at rate κNκ_N. At the critical load ρN=1−1/Nρ_N=1-1/N, the empirical measure of the centered queue lengths, under stationarity, converges in distribution to a random probability measure determined by its mean. We identify the mean's density and the conditional independence of fixed finite collections of centered queues in the limit. On time scales of order NN, the centered empirical mean converges to a diffusion with explicit drift and constant diffusion coefficient. These limits hold when κN/N→∞κ_N/N\to\infty, along subsequences with convergent lattice phase. The diffusion limit extends to centered initial empirical measures tight in the first Wasserstein topology, with means converging in law. A short initial layer prepares the limiting family while preserving the limiting mean. Empirical approximation holds in time-integrated Wasserstein distance.

Paper details

vlnc:W_3zstz3dw
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 1

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…