Related papers: Exact Sampling of Stationary and Time-Reversed Que…
Motivated by applications such as urban traffic control and make-to-order systems, we study a fluid model of a single-server, on-off system that can accommodate multiple queues. The server visits each queue in order: when a queue is served,…
The interest to retrial queueing systems is due to their application to telephone systems. The paper studies multiserver retrial queueing systems with $n$ servers. Arrival process is a quite general point process. An arriving customer…
We consider the coupling of a single server queue and a storage model defined as a Queue/Store model in Draief et al. 2004. We establish that if the input variables, arrivals at the queue and store, satisfy large deviations principles and…
The discrete time queueing system is highly applicable to modern telecommunication systems, where it provides adaptive packet handling, congestion controlled security/inspection, energy efficient operation, and supports bursty traffic…
In many service systems, especially those in healthcare, customer waiting times can result in increased service requirements. Such service slowdowns can significantly impact system performance. Therefore, it is important to properly account…
We develop diffusion approximations for parallel-queueing systems with the randomized longest-queue-first scheduling algorithm by establishing new mean-field limit theorems as the number of buffers $n\to\infty$. We achieve this by allowing…
Finite-capacity single-server queues with general service-time distributions form the backbone of numerous real-world systems, yet classical simulation of performance metrics such as blocking probabilities and delay becomes computationally…
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…
This paper studies the effect of an overdispersed arrival process on the performance of an infinite-server system. In our setup, a random environment is modeled by drawing an arrival rate $\Lambda$ from a given distribution every $\Delta$…
A multi-class single-server queueing model with finite buffers, in which scheduling and admission of customers are subject to control, is studied in the moderate deviation heavy traffic regime. A risk-sensitive cost set over a finite time…
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…
We consider learning outcomes in games with carryover effects between rounds: when outcomes in the present round affect the game in the future. An important example of such systems is routers in networking, as they use simple learning…
We consider a single server queue which has a threshold to change its arrival process and service speed by its queue length, which is referred to as a two-level single server queue. This model is motivated by an energy saving problem for a…
Motivated by demand prediction for the custodial prison population in England and Wales, this paper describes an approach to the study of service systems using infinite server queues, where the system has non-empty initial state and the…
We consider a queueing system composed of a dispatcher that routes deterministically jobs to a set of non-observable queues working in parallel. In this setting, the fundamental problem is which policy should the dispatcher implement to…
One practical open problem is the development of a distributed algorithm that achieves near-optimal utility using only a finite (and small) buffer size for queues in a stochastic network. This paper studies utility maximization (or cost…
We establish sufficient conditions for the existence of moments of the steady-state queue in polling systems operating under the binomial-exhaustive policy (BEP). We assume that the server switches between the different buffers according to…
The Join-the-Shortest-Queue routing policy is studied in an asymptotic regime where the number of processors $n$ scales with the arrival rate. A large deviation principle (LDP) for the occupancy process is established, as $n\to \infty$, in…
In this paper we consider a single-server, cyclic polling system with switch-over times. A distinguishing feature of the model is that the rates of the Poisson arrival processes at the various queues depend on the server location. For this…
We develop rare-event simulation methodology for the analysis of loss events in a many-server loss system under quality-driven regime, focusing on the steady-state loss probability (i.e. fraction of lost customers over arrivals) and the…