Related papers: Finite-pool queues with heavy-tailed services
We establish functional limit theorems for ergodic sums of observables with power singularities for expanding circle maps. In the regime where the observables have infinite variance, we show that when rescaled by $N^{1/s}(\ln N)^\alpha$,…
Two networks of queues models, presented initially by Jackson, in the open case, and Gordon and Newell, in the closed case, stochastic processes are presented and studied in some of their details and problems. The service times are…
If the step distribution in a renewal process has finite mean and regularly varying tail with index -{\alpha}, 1<{\alpha}<2, the first two terms in the asymptotic expansion of the renewal function have been known for many years. Here we…
We establish sharp tail asymptotics for component-wise extreme values of bivariate Gaussian random vectors with arbitrary correlation between the components. We consider two scaling regimes for the tail event in which we demonstrate the…
We study an admissions control problem, where a queue with service rate $1-p$ receives incoming jobs at rate $\lambda\in(1-p,1)$, and the decision maker is allowed to redirect away jobs up to a rate of $p$, with the objective of minimizing…
For multitype branching processes with immigration evolving in a random environment and producing a final product we find the tail distribution of the size of the final product accumulated in the system for a life period. Using this result…
When the arrival processes are Poisson, queueing networks are well-understood in terms of the product-form structure of the number of jobs $N_i$ at the individual queues; much less is known about the waiting time $W$ across the whole…
We consider an infinite-server queue into which customers arrive according to a Cox process and have independent service times with a general distribution. We prove a functional large deviations principle for the equilibrium queue length…
We study a many-server queuing system with general service time distribution and state dependent service rates. The dynamics of the system are modeled using measure valued processes which keep track of the residual service times. Under…
In the infinite servers queue with Poisson arrivals real life practical applications, the busy period and the busy cycle probabilistic study is of main importance. But it is a very difficult task. In this text, we show that by solving a…
We consider an $M/G/\infty$ queue with infinite expected service time. We then provide the transience/recurrence classification of the states (the system is said to be at state $n$ if there are $n$ customers being served), observing also…
We consider a load balancing system consisting of $n$ single-server queues working in parallel, with heterogeneous service rates. Jobs arrive to a central dispatcher, which has to dispatch them to one of the queues immediately upon arrival.…
The growth of Machine-Type Communication (MTC) increases the relevance of queuing scenarios with deterministic service times. In this letter, we present a model for queues without waiting lines and with degenerate service time distributions…
Utilizing customers' service-time information, we study an easy-to-implement scheduling policy with two priority classes. By carefully designing the classes, the two-class priority rule achieves near-optimal performance. In particular, for…
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, which was first introduced to derive the stability region for stochastic…
In this paper, we deal with an $D/GI/1$ vacation system with impatient customers. We give a sufficient condition for the existence of a limit distribution of the waiting time and integral equations are derived in both reneging and balking…
We consider scheduling in the M/G/1 queue with unknown job sizes. It is known that the Gittins policy minimizes mean response time in this setting. However, the behavior of the tail of response time under Gittins is poorly understood, even…
As a follow-up to a recent paper considering two symmetric queues, the \textit{Shortest Queue First} service discipline is presently analysed for two general asymmetric queues. Using the results previously established and assuming…
We study branching processes of independently splitting particles in the continuous time setting. If time is calibrated such that particles live on average one unit of time, the corresponding transition rates are fully determined by the…
We study many-server queues with abandonment in which customers have general service and patience time distributions. The dynamics of the system are modeled using measure- valued processes, to keep track of the residual service and patience…