Quasi-stationary workload in a Lévy-driven storage system

Steady-state optimization of an exhaustive Levy storage process with intermittent output and random output rate

Consider a regenerative storage process with a nondecreasing Lévy input (subordinator) such that every cycle may be split into two periods. In the first (off) the output is shut off and the workload accumulates. This continues until some stopping time. In the second (on), the process evolves like a subordinator minus a positive drift (output rate) until it hits the origin. In addition, we assume that the output rate of every on period is a random variable which is determined at the beginning of this period. For example, at each period, the output rate may depend on the workload level at the be…

On the stability of a class of non-monotonic systems of parallel queues

We investigate, under general stationary ergodic assumptions, the stability of systems of $S$ parallel queues in which any incoming customer joins the queue of the server having the $p+1$-th shortest workload ($p < S$), or a free server if any. This change in the allocation policy makes the analysis much more challenging with respect to the classical FCFS model with $S$ servers, as it leads to the non-monotonicity of the underlying stochastic recursion. We provide sufficient conditions of existence of a stationary workload, which indicate a "splitting" of the system in heavy traffic, into a lo…

Speed of convergence to the quasi-stationary distribution for Lévy input fluid queues

In this note we prove that the speed of convergence of the workload of a Lévy-driven queue to the quasi-stationary distribution is of order $1/t$. We identify also the Laplace transform of the measure giving this speed and provide some examples.

Non-Stationary Queues with Batch Arrivals

Motivated by applications that involve setting proper staffing levels for multi-server queueing systems with batch arrivals, we present a thorough study of the queue-length process $\{Q(t); t \geq 0\}$, departure process $\{D(t); t \geq 0\}$, and the workload process $\{W(t); t \geq 0\}$ associated with the M$_{t}^{B_{t}}$/G$_{t}$/$\infty$ queueing system. With two fundamental assumptions of (non-stationary) Poisson arrivals and infinitely many servers, we otherwise maintain a highly general model, in which the service duration and batch size distributions may depend on time and, moreover, whe…

Decomposition results for stochastic storage processes and queues with alternating Lévy inputs

In this paper we generalize known workload decomposition results for Lévy queues with secondary jump inputs and queues with server vacations or service interruptions. Special cases are polling systems with either compound Poisson or more general Lévy inputs. Our main tools are new martingale results, which have been derived in a companion paper.

Stationary IPA Estimates for Non-Smooth G/G/1/$\infty$ Functionals via Palm Inversion and Level-Crossing Analysis

We give stationary estimates for the derivative of the expectation of a non-smooth function of bounded variation f of the workload in a G/G/1/$\infty$ queue, with respect to a parameter influencing the distribu- tion of the input process. For this, we use an idea of Konstantopoulos and Zazanis based on the Palm inversion formula, however avoiding a limiting argument by performing the level-crossing analysis thereof globally, via Fubini's theorem. This method of proof allows to treat the case where the workload distribution has a mass at discontinuities of f and where the formula has to be modi…

多尺度轻重交通中由莱维过程驱动的排队网络

Lévy-driven queuing networks in multi-scale light and heavy traffic

本文研究了由莱维过程驱动的多尺度排队网络，在轻重交通条件下分析了工作负载分布及解耦现象。

Workload analysis of a two-queue fluid polling model

In this paper, we analyze a two-queue random time-limited Markov modulated polling model. In the first part of the paper, we investigate the fluid version: Fluid arrives at the two queues as two independent flows with deterministic rate. There is a single server that serves both queues at constant speeds. The server spends an exponentially distributed amount of time in each queue. After the completion of such a visit time to one queue, the server instantly switches to the other queue, i.e., there is no switchover time. For this model, we first derive the Laplace-Stieltjes Transform (LST) of th…

Construction of a stationary FIFO queue with impatient customers

In this paper, we study the stability of queues with impatient customers. Under general stationary ergodic assumptions, we first provide some conditions for such a queue to be regenerative (i.e. to empty a.s. an infinite number of times). In the particular case of a single server operating in First in, First out, we prove the existence (in some cases, on an enlarged probability space) of a stationary workload. This is done by studying stochastic recursions under the Palm settings, and by stochastic comparison of stochastic recursions.

Coupling in the queue with impatience: case of several servers

We present the explicit construction of a stable queue with several servers and impatient customers, under stationary ergodic assumptions. Using a stochastic comparison of the (multivariate) workload sequence with two monotonic stochastic recursions, we propose a sufficient condition of existence of a unique stationary state of the system using Renovation theory. Whenever this condition is relaxed we use extension techniques to prove the existence of a stationary state in some cases.

轻载与重载交通下高斯输入排队网络的泛函极限定理

Functional limit theorems for Gaussian-fed queueing network in light and heavy traffic

本文针对严格上三角路由矩阵的高斯输入排队网络，推导了轻载与重载下经时空标度的联合平稳工作量过程的极限分布，并给出了队列过程有效解耦的条件，丰富了排队网络的泛函极限理论。

Construction of a stationary queue with impatient customers

In this paper, we study the stability of queues with impatient customers. Under general stationary ergodic assumptions, we first provide some conditions for such a queue to be regenerative (i.e. to empty a.s. an infinite number of times). In the particular case of a single server operating in First in, First out, we prove the existence (in some cases, on an enlarged probability space) of a stationary workload. This is done by studying a non-monotonic stochastic recursion under the Palm settings, and by stochastic comparison of stochastic recursions.

Heavy tails in multi-server queues

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 are given for the probability ${\bf P}\{W>x\}$. We also get asymptotics for the distribution tail of a stationary two-dimensional workload vector and of a stationary queue length. These asymptotics depend heavily on the traffic load.