SearcharxivSearch

arXiv · 2507.03215

The Stationary Behavior of Reflecting Coupled Brownian Motions with Applications to Shortest Remaining Processing Time Queues

Abstract

With the objective of characterizing the stationary behavior of the scaling limit for shortest remaining processing time (SRPT) queues with a heavy-tailed processing time distribution, as obtained in Banerjee, Budhiraja, and Puha (BBP, 2022), we study reflecting coupled Brownian motions (RCBM) $(W_t(a), a, t \geq 0)$. These RCBM arise by regulating coupled Brownian motions (CBM) $(\chi_t(a), a,t \geq 0)$ to remain nonnegative. Here, for $t\geq 0$, $\chi_t(0)=0$ and $\chi_t(a):=w(a)+\sigma B_t-\mu(a)t$ for $a>0$, $w(\cdot)$ is a suitable initial condition, $\sigma$ is a positive constant, $B$ is a standard Brownian motion, and $\mu(\cdot)$ is an unbounded, positive, strictly decreasing drift function. In the context of the BBP (2022) scaling limit, the drift function is determined by the model parameters, and, for each $a\geq 0$, $W_{\cdot}(a)$ represents the scaling limit of the amount of work in the system of size $a$ or less. Thus, for the BBP (2022) scaling limit, the time $t$ values of the RCBM describe the random distribution of the size of the remaining work in the system at time $t$. Our principal results characterize the stationary distribution of the RCBM in terms of a maximum process $M_*(\cdot)$ associated with CBM starting from zero. We obtain an explicit representation for the finite-dimensional distributions of $M_*(\cdot)$ and a simple formula for its covariance. We further show that the RCBM converge in distribution to $M_*(\cdot)$ as time $t$ approaches infinity. From this, we deduce the stationary behavior of the BBP (2022) scaling limit, including obtaining an integral expression for the stationary queue length in terms of the associated maximum process. While its distribution appears somewhat complex, we compute the mean and variance explicitly, and we connect with the work of Lin, Wierman, and Zwart (2011) to offer an illustration of Little's Law.

Explore related subjects

Keep this discovery

BibTeXRIS

Sixian Jin, Marvin Pena, Amber L. Puha. 2025-07-03. The Stationary Behavior of Reflecting Coupled Brownian Motions with Applications to Shortest Remaining Processing Time Queues. https://arxiv.org/abs/2507.03215

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR