Related papers: Continuity theorems for the $M/M/1/n$ queueing sys…
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…
This work studies queues in a Euclidean space. Consider $N$ servers that are distributed uniformly in $[0,1]^d$. Customers arrive at the servers according to independent stationary processes. Upon arrival, they probabilistically decide…
In queueing systems, effective scheduling algorithms are essential for optimizing performance. Optimal scheduling for the M/G/k queue has been explored in the heavy traffic limit, but much remains unknown in the intermediate load regime. In…
A $M/M/1$ queue with catastrophes is a modified $M/M/1$ queue model for which, according to the times of a Poisson process, catastrophes occur leaving the system empty. In this work, we study a fractional $M/M/1$ queue with catastrophes,…
We consider a system consisting of a server alternating between two service points. At both service points there is an infinite queue of customers that have to undergo a preparation phase before being served. We are interested in the…
In this article a special case of an M/G/2-queue is considered, where the two servers are exposed to two types of jobs that are distributed among the servers via a random switch. In this model the asymptotic behaviour of the workload buffer…
We consider the single server queue with service in random order. For a large class of heavy-tailed service time distributions, we determine the asymptotic behavior of the waiting time distribution. For the special case of Poisson arrivals…
We consider the $M/M/1$-PS queue with processor sharing. We study the conditional sojourn time distribution of an arriving customer, conditioned on the number of other customers present. A new formula is obtained for the conditional sojourn…
A many-server heavy-traffic FCLT is proved for the $G_t/M/s_t+\mathit {GI}$ queueing model, having time-varying arrival rate and staffing, a general arrival process satisfying a FCLT, exponential service times and customer abandonment…
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…
We give some representation about recent achievements in analysis of the M/G/1 queue with egalitarian processor sharing discipline (EPS). The new formmulas are derived for the j-th moments (j=1,2,...) of the (conditional) stationary sojourn…
A Markovian single-server queue is studied in an interactive random environment. The arrival and service rates of the queue depend on the environment, while the transition dynamics of the random environment depends on the queue length. We…
We consider the heavy-traffic approximation to the $GI/M/s$ queueing system in the Halfin-Whitt regime, where both the number of servers $s$ and the arrival rate $\lambda$ grow large (taking the service rate as unity), with…
The performance analysis of peer-to-peer (P2P) networks calls for a new kind of queueing model, in which jobs and service stations arrive randomly. Except in some simple special cases, in general, the queueing model with varying service…
The paper deals with a sharing economy system with various management factors by using a bulk input G/M/1 type queuing model. The effective management of operating costs is vital for controlling the sharing economy platform and this…
We analyze opportunistic schemes for transmission scheduling from one of $n$ homogeneous queues whose channel states fluctuate independently. Considered schemes consist of the LCQ policy, which transmits from a longest connected queue in…
We consider a multi-server queue in the Halfin-Whitt regime: as the number of servers $n$ grows without a bound, the utilization approaches 1 from below at the rate $\Theta(1/\sqrt{n})$. Assuming that the service time distribution is…
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$…
This paper develops fluid limits for nonstationary many-server loss systems with general service-time distributions. For the zero-buffer $M_t/G/n/n$ queuing model, we prove a functional strong law of large numbers for the fraction of busy…
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…