Tail asymptotics for delay in a half-loaded GI/GI/2 queue with heavy-tailed job sizes

  title={Tail asymptotics for delay in a half-loaded GI/GI/2 queue with heavy-tailed job sizes},
  author={Jos{\'e} H. Blanchet and M. KarthyekRajhaaA.},
  journal={Queueing Systems},
We obtain asymptotic bounds for the tail distribution of steady-state waiting time in a two-server queue where each server processes incoming jobs at a rate equal to the rate of their arrivals (that is, the half-loaded regime). The job sizes are taken to be regularly varying. When the incoming jobs have finite variance, there are basically two types of effects that dominate the tail asymptotics. While the quantitative distinction between these two manifests itself only in the slowly varying… 

Heavy-tailed queues in the Halfin-Whitt regime

This work considers the FCFS G/G/n queue in the Halfin-Whitt regime, in the presence of heavy-tailed distributions, and proves that under minimal assumptions, the sequence of stationary queue length distributions, normalized by $n^{\frac{1}{2}}$, is tight.

Limits for GI/GI/N queues

  • L. KorolkovaN. Mashrabov
  • Mathematics
    2016 2nd International Conference on Industrial Engineering, Applications and Manufacturing (ICIEAM)
  • 2016
The paper provides a numerical example, which confirms that replacement of the real exponential service time distribution leads to considerable distortions of the numerical system performance indicators.

Fork-join and redundancy systems with heavy-tailed job sizes

Bounds are presented for the tail probability of the response time in the case of the first-come first-served (FCFS) discipline and it is indicated that having d = ⌈min{ ν ν−1, N − k}⌉ replicas is sufficient to achieve the optimal asymptotic tail behavior of theresponse time.

Transient analysis of queueing system with two heterogeneous servers

A method that uses an open-end diagram of queueing system functioning and relative probabilities is applied to study the queueing system with two heterogeneous servers, which is functioning within a



On Large Delays in Multi-Server Queues with Heavy Tails

We present upper and lower bounds for the tail distribution of the stationary waiting time D in the stable GI/GI/s first-come first-served (FCFS) queue. These bounds depend on the value of the

The impact of a heavy-tailed service-time distribution upon the M/GI/s waiting-time distribution

  • W. Whitt
  • Mathematics
    Queueing Syst. Theory Appl.
  • 2000
By exploiting an infinite-server-model lower bound, we show that the tails of the steady-state and transient waiting-time distributions in the M/GI/s queue with unlimited waiting room and the

Heavy Tails in Multi-Server Queue

Under subexponential-type assumptions on the service time distribution, bounds and sharp asymptotics are given for the distribution tail of the stationary waiting time W in the GI/GI/2 FCFS queue and of a stationary queue length.

Fluid heuristics, Lyapunov bounds and efficient importance sampling for a heavy-tailed G/G/1 queue

A strongly efficient rare-event simulation algorithm for computing the tail of the steady-state waiting time in a single server queue with regularly varying service times is developed, based on a state-dependent importance sampling strategy that is constructed so as to be straightforward to implement.

Sink or swim together: necessary and sufficient conditions for finite moments of workload components in FIFO multiserver queues

This paper derives moment results for all the components of the stationary workload vector in stable FIFO GI/GI/s queues by exploiting the interaction between service-time distribution, traffic intensity and the number of servers in the queue.

Delay moments for FIFO GI/GI/s queues

A novel recursion for delay which reduces the problem to that of a reflected random walk with dependent increments, a new theorem for proving the existence of finite moments of the steady-state distribution of reflected random walks with stationary increments, and use of the classic Kiefer and Wolfowitz conditions are proved.

Regeneration and renovation in queues

The construction uses so-called renovative events revealing the property of the state at timen of the discrete-time model to be independent of the states referring to epochs not later thann −L (whereL is some constant) given that there are some restrictions on the “governing sequence”.

Efficient rare-event simulation for the maximum of heavy-tailed random walks

An importance sampling algorithm to estimate the tail of M=\max \{S_n:n\geq 0\}$ that is strongly efficient for both light and heavy-tailed increment distributions and under additional technical assumptions, which can be shown to have asymptotically vanishing relative variance.

Asymptotic Analysis of Random Walks: Heavy-Tailed Distributions

Introduction 1. Preliminaries 2. Random walks with jumps having no finite first moment 3. Random walks with finite mean and infinite variance 4. Random walks with jumps having finite variance 5.

On Probabilities of Large Deviations for Random Walks. I. Regularly Varying Distribution Tails

We establish first-order approximations and asymptotic expansions for probabilities of crossing arbitrary curvilinear boundaries in the large deviations range by random walks with regularly varying