相关论文: New Representations for G/G/1 Waiting Times

We consider an extension of the standard G/G/1 queue, described by the equation $W\stackrel{\mathcal{D}}{=}\max\{0, B-A+YW\}$, where $\mathbb{P}[Y=1]=p$ and $\mathbb{P}[Y=-1]=1-p$. For $p=1$ this model reduces to the classical Lindley…

In this paper, we consider the M/GI/1 queue with single vacations under the gated service discipline. We obtain the probability generating function of the stationary queue length, the Laplace-Stieltjes transform of the system delay…

In this paper we consider an M/G/1-type queue fed by a finite customer-pool. In terms of transforms, we characterize the time-dependent distribution of the number of customers and the workload, as well as the associated waiting times.

We propose a generalization of the classical M/M/1 queue process. The resulting model is derived by applying fractional derivative operators to a system of difference-differential equations. This generalization includes both non-Markovian…

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 compute the stationary performance metrics of a single server $M^X/G/1$ queue under a class of generalized processor-sharing scheduling policies that are proposed by Grishechkin. This class of processor-sharing policies allow service…

We recall four open problems concerning constructing high-order matrix-exponential approximations for the infimum of a spectrally negative Levy process (with applications to first-passage/ruin probabilities, the waiting time distribution in…

This exposition presents a novel approach to solving an M/M/m queue for the waiting time and the residence time. The motivation comes from an algebraic solution for the residence time of the M/M/1 queue. The key idea is the introduction of…

In this paper, we consider five models of heavy-tailed queues involving Mittag-Leffler distributions that generalize the classical $M/M/1$ queues. These models are suitable modifications of previously defined models in such a way that the…

Motivated by queueing applications, we study various reflected autoregressive processes with dependencies. Amongst others, we study cases where the interarrival and service times are proportionally dependent with additive and/or subtracting…

We study the MAP/M/s+G queuing model with MAP (Markovian Arrival Process) arrivals, exponentially distributed service times, infinite waiting room, and generally distributed patience times. Using sample-path arguments, we propose to obtain…

The subject of this paper is the problem of estimating service time distribution of the $M/G/\infty$ queue from incomplete data on the queue. The goal is to estimate $G$ from observations of the queue--length process at the points of the…

We derive the L\'evy-Khintchine representation of the Wiener-Hopf factors for the Normal Inverse Gaussian (NIG) process as well as a representation which is similar to the moment generating function (MGF) of a generalized gamma convolution…

In this paper we study a representation problem first considered in a simpler version by Bank and El Karoui [2004]. A key ingredient to this problem is a random measure $\mu$ on the time axis which in the present paper is allowed to have…

We examine a generalised queuing model which we call the G/G/n/G/+ model, which encompasses the G/G/n and G/G/n/s models as special cases. Our model accommodates useful generalisations in user behaviour and limitations on the facilities for…

Lindley's equation is an important relation in queueing theory and network calculus. In this paper, we develop a new method to solve one type of Lindley's equation, i.e., the equation V(s)T(-s)-1=0 only has finite negative real roots. V(s)…

In the present work we study Bayesian nonparametric inference for the continuous-time M/G/1 queueing system. In the focus of the study is the unobservable service time distribution. We assume that the only available data of the system are…

We study the generalization of the G/G/1 queue obtained by relaxing the assumption of independence between inter-arrival times and service requirements. The analysis is carried out for the class of multivariate matrix exponential…

In this paper, we analyze how well a machine can solve a general problem in queueing theory. To answer this question, we use a deep learning model to predict the stationary queue-length distribution of an $M/G/1$ queue (Poisson arrivals,…

S. G. Kou and H. Wang [First Passage times of a Jump Diffusion Process \textit{Ann. Appl. Probab.} {\bf 35} (2003) 504--531] give expressions of both the (real) Laplace transform of the distribution of first passage time and the (real)…