English
Related papers

Related papers: On Large Delays in Multi-Server Queues with Heavy …

200 papers

In this paper, the asymptotic behaviour of the distribution tail of the stationary waiting time $W$ in the $GI/GI/2$ FCFS queue is studied. Under subexponential-type assumptions on the service time distribution, bounds and sharp asymptotics…

Probability · Mathematics 2013-03-20 Sergey Foss , Dmitry Korshunov

We consider the FCFS $GI/GI/n$ queue in the Halfin-Whitt heavy traffic regime, and prove bounds for the steady-state probability of delay (s.s.p.d.) for generally distributed processing times. We prove that there exist $\epsilon_1,…

Probability · Mathematics 2016-09-02 David A. Goldberg

We consider the FCFS $GI/GI/n$ queue, and prove the first simple and explicit bounds that scale as $\frac{1}{1-\rho}$ under only the assumption that inter-arrival times have finite second moment, and service times have finite $2+\epsilon$…

Probability · Mathematics 2023-06-06 David A. Goldberg , Yuan Li

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…

Probability · Mathematics 2016-04-05 Jose Blanchet , Karthyek Murthy

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…

Probability · Mathematics 2017-07-26 David A. Goldberg , Yuan Li

We say that a random variable is $light$-$tailed$ if moments of order $2+\epsilon$ are finite for some $\epsilon>0$; otherwise, we say that it is $heavy$-$tailed$. We study queueing networks that operate under the Max-Weight scheduling…

Systems and Control · Electrical Eng. & Systems 2023-02-28 Arsalan Sharifnassab , John N. Tsitsiklis

In general, obtaining the exact steady-state distribution of queue lengths is not feasible. Therefore, we establish bounds for the tail probabilities of queue lengths. Specifically, we examine queueing systems under Heavy-Traffic (HT)…

Probability · Mathematics 2023-06-21 Prakirt Raj Jhunjhunwala , Daniela Hurtado-Lange , Siva Theja Maguluri

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…

Probability · Mathematics 2011-11-29 S. G. Foss

Two of the most popular approximations for the distribution of the steady-state waiting time, $W_{\infty}$, of the M/G/1 queue are the so-called heavy-traffic approximation and heavy-tailed asymptotic, respectively. If the traffic…

Probability · Mathematics 2011-04-08 Mariana Olvera-Cravioto , Jose Blanchet , Peter Glynn

In this paper, we study the maximum waiting time $\max_{i\leq N}W_i(\cdot)$ in an $N$-server fork-join queue with heavy-tailed services as $N\to\infty$. The service times are the product of two random variables. One random variable has a…

Probability · Mathematics 2022-11-07 Dennis Schol , Maria Vlasiou , Bert Zwart

In this paper we study the maximum queue length $M$ (in terms of the number of customers present) in a busy cycle in the M/G/1 queue. Assume that the service times have a logconvex density. For such (heavy-tailed) service-time distributions…

Probability · Mathematics 2007-05-23 Misja Nuyens

We consider a Generalised Jackson Network with finitely many servers, a renewal input and $i.i.d.$ service times at each queue. We assume the network to be stable and, in addition, the distribution of the inter-arrival times to have…

Probability · Mathematics 2025-07-01 Sergey Foss , Masakiyo Miyazawa , Linglong Yuan

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…

Probability · Mathematics 2026-03-20 Zedong Wang , Siva Theja Maguluri

We consider a two-node fluid network with batch arrivals of random size having a heavy-tailed distribution. We are interested in the tail asymptotics for the stationary distribution of a two-dimensional queue-length process. The tail…

Probability · Mathematics 2016-11-25 Sergey Foss , Masakiyo Miyazawa

We study a sequence of single server queues with customer abandonment (GI/GI/1+GI) under heavy traffic. The patience time distributions vary with the sequence, which allows for a wider scope of applications. It is known ([20, 18]) that the…

Probability · Mathematics 2021-02-10 Chihoon Lee , Amy R. Ward , Heng-Qing Ye

We consider a single-server GI/GI/1 queueing system with feedback. We assume the service times distribution to be (intermediate) regularly varying. We find the tail asymptotics for a customer's sojourn time in two regimes: the customer…

Probability · Mathematics 2018-08-01 Sergey Foss , Masakiyo Miyazawa

We carry out a delay stability analysis (i.e., determine conditions under which expected steady-state delays at a queue are finite) for a simple 3-queue system operated under the Max-Weight scheduling policy, for the case where one of the…

Systems and Control · Computer Science 2012-07-25 Mihalis G. Markakis , Eytan Modiano , John N. Tsitsiklis

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…

Probability · Mathematics 2017-01-30 Harald Bernhard , Bikramjit Das

We consider a GI/GI/1 queue with the shortest remaining processing time discipline (SRPT) and light-tailed service times. Our interest is focused on the tail behavior of the sojourn-time distribution. We obtain a general expression for its…

Probability · Mathematics 2007-05-23 Misja Nuyens , Bert Zwart

We are interested in a large queue in a $GI/G/k$ queue with heterogeneous servers. For this, we consider tail asymptotics and weak limit approximations for the stationary distribution of its queue length process in continuous time under a…

Probability · Mathematics 2017-03-10 Masakiyo Miyazawa
‹ Prev 1 2 3 10 Next ›