Related papers: Exact asymptotics for fluid queues fed by multiple…
The present paper is concerned with the stationary workload of queues with heavy-tailed (regularly varying) characteristics. We adopt a transform perspective to illuminate a close connection between the tail asymptotics and heavy-traffic…
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…
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…
In this paper, we investigate exact tail asymptotics for the stationary distribution of a fluid model driven by the $M/M/c$ queue, which is a two-dimensional queueing system with a discrete phase and a continuous level. We extend the kernel…
We investigate the asymptotic behavior of the steady-state queue length distribution under generalized max-weight scheduling in the presence of heavy-tailed traffic. We consider a system consisting of two parallel queues, served by a single…
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…
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…
The model is a "generalized switch", serving multiple traffic flows in discrete time. The switch uses MaxWeight algorithm to make a service decision (scheduling choice) at each time step, which determines the probability distribution of the…
This paper studies the asymptotic behavior of the steady-state waiting time, W_infty, of the M/G/1 queue with subexponenential processing times for different combinations of traffic intensities and overflow levels. In particular, we provide…
In this paper, we consider an $N$-queue overloaded polling network attended by a single cyclically roving server. Upon the completion of his service, a customer is either routed to another queue or leaves the system. All the switches are…
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…
We consider the problem of packet scheduling in single-hop queueing networks, and analyze the impact of heavy-tailed traffic on the performance of Max-Weight scheduling. As a performance metric we use the delay stability of traffic flows: a…
One of the key performance measures in queueing systems is the exponential decay rate of the steady-state tail probabilities of the queue lengths. It is known that if a corresponding fluid model is stable and the stochastic primitives have…
In Internet environment, traffic flow to a link is typically modeled by superposition of ON/OFF based sources. During each ON-period for a particular source, packets arrive according to a Poisson process and packet sizes (hence service…
We consider the $\Delta_{(i)}/G/1$ queue, in which a a total of $n$ customers independently demand service after an exponential time. We focus on the case of heavy-tailed service times, and assume that the tail of the service time…
We consider a fluid queue where the input process consists of N identical sources that turn on and off at exponential waiting times. The server works at the constant rate c and an on source generates fluid at unit rate. This model was first…
This paper introduces a new asymptotic regime for simplifying stochastic models having non-stationary effects, such as those that arise in the presence of time-of-day effects. This regime describes an operating environment within which the…
We study a single server FIFO queue that offers general service. Each of n customers enter the queue at random time epochs that are inde- pendent and identically distributed. We call this the random scattering traffic model, and the…
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…
This short communication considers an infinite-server system with overdispersed input. The objective is to identify the exact tail asymptotics of the number of customers present at a given point in time under a specific scaling of the model…