Related papers: Heavy Loads and Heavy Tails
In this paper we investigate Gaussian queues in the light-traffic and in the heavy-traffic regime. The setting considered is that of a centered Gaussian process $X\equiv\{X(t):t\in\mathbb R\}$ with stationary increments and variance…
Heavy-tailed phenomena appear across diverse domains --from wealth and firm sizes in economics to network traffic, biological systems, and physical processes-- characterized by the disproportionate influence of extreme values. These…
Transport engineers employ various interventions to enhance traffic-network performance. Quantifying the impacts of Cycle Superhighways is complicated due to the non-random assignment of such an intervention over the transport network.…
It is well-known that large deviations of random walks driven by independent and identically distributed heavy-tailed random variables are governed by the so-called principle of one large jump. We note that further subtleties hold for such…
In many applications, significant correlations between arrivals of load-generating events make the numerical evaluation of the load of a system a challenging problem. Here, we construct very accurate approximations of the workload…
For a stochastic difference equation $D_n=A_nD_{n-1}+B_n$ which stabilises upon time we study tail distribution asymptotics of $D_n$ under the assumption that the distribution of $\log(1+|A_1|+|B_1|)$ is heavy-tailed, that is, all its…
We consider the following recurrence relation with random i.i.d. coefficients $(a_n,b_n)$: $$ x_{n+1}=a_{n+1} x_n+b_{n+1} $$ where $a_n\in GL(d,\mathbb{R}),b_n\in \mathbb{R}^d$. Under natural conditions on $(a_n,b_n)$ this equation has a…
We establish some asymptotic expansions for infinite weighted convolution of distributions having regular varying tails. Various applications to statistics and probability are developed.
Significant correlations between arrivals of load-generating events make the numerical evaluation of the workload of a system a challenging problem. In this paper, we construct highly accurate approximations of the workload distribution of…
We consider the FCFS G/G/n queue in the Halfin-Whitt regime, in the presence of heavy-tailed distributions (i.e. infinite variance). We prove that under minimal assumptions, i.e. only that processing times have finite 1 + epsilon moment and…
We present upper and lower bounds for the tail distribution of the stationary waiting time $D$ in the stable $GI/GI/s$ FCFS queue. These bounds depend on the value of the traffic load $\rho$ which is the ratio of mean service and mean…
We study a heavily overloaded single-server queue with abandonment and derive bounds on stationary tail probabilities of the queue length. As the abandonment rate $\gamma \downarrow 0$, the centered-scaled queue length $\tilde{q}$ is known…
We study the tail asymptotics of the sum of two heavy-tailed random variables. The dependence structure is modeled by copulas with the so-called tail order property. Examples are presented to illustrate the approach. Further for each…
We study the heavy-traffic limit of the generalized switch operating under MaxWeight, without assuming that the CRP condition is satisfied and allowing for correlated arrivals. The main contribution of this paper is the steady-state mean of…
In this paper we are concerned with a sample of asymptotically independent risks. Tail asymptotic probabilities for linear combinations of randomly weighted order statistics are approximated under various assumptions, where the individual…
A network belongs to the monotone separable class if its state variables are homogeneous and monotone functions of the epochs of the arrival process. This framework contains several classical queueing network models, including generalized…
We prove a heavy traffic scaling limit for a shortest remaining processing time queue. We are interested in the case where the processing time distribution has a tail that decays rapidly, i.e., has light tails. In particular, we revisit the…
We study the asymptotics of the stationary sojourn time Z of a "typical customer" in a tandem of single-server queues. It is shown that, in a certain "intermediate" region of light-tailed service time distributions, Z may take a large value…
Consider a family of random walks $S_n^{(a)}=X_1^{(a)}+\cdots+X_n^{(a)}$ with negative drift $\mathbf E X_1^{(a)}=-a<0$ and finite variance $\mbox{var}(X_1^{(a)})=\sigma^2<\infty$.Let $M^{(a)}=\max_{n\ge 0} S_n^{(a)}$ be the maximums of the…
In the literature, retrial queues with batch arrivals and heavy service times have been studied and the so-called equivalence theorem has been established under the condition that the service time is heavier than the batch size. The…