We study the $G/\mathit{GI}/\infty$ queue in heavy-traffic using tempered distribution-valued processes which track the age and residual service time of each customer in the system. In both cases, we use the continuous mapping theorem together with functional central limit theorem results in order to obtain fluid and diffusion limits for these processes in the space of tempered distribution-valued processes. We find that our diffusion limits are tempered distribution-valued Ornstein-Uhlenbeck processes.
We consider the FCFS $\mathit{GI}/\mathit{GI}/n$ queue in the so-called Halfin-Whitt heavy traffic regime. We prove that under minor technical conditions the associated sequence of steady-state queue length distributions, normalized by $n^{1/2}$, is tight. We derive an upper bound on the large deviation exponent of the limiting steady-state queue length matching that conjectured by Gamarnik and Momcilovic [Adv. in Appl. Probab. 40 (2008) 548-577]. We also prove a matching lower bound when the arrival process is Poisson. Our main proof technique is the derivation of new and simple bounds for th…
This note describes several open questions concerning scaling limits of queue-length processes of symmetric queues in heavy traffic, distinguishing between service-time distributions with finite and infinite variance.
We consider a two-node tandem queueing network in which the upstream queue is M/G/1 and each job reuses its upstream service requirement when moving to the downstream queue. Both servers employ the first-in-first-out policy. We investigate the amount of work in the second queue at certain embedded arrival time points, namely when the upstream queue has just emptied. We focus on the case of infinite-variance service times and obtain a heavy traffic process limit for the embedded Markov chain.
The focus of this paper is on the asymptotics of large-time numbers of customers in time-periodic Markovian many-server queues with customer abandonment in heavy traffic. Limit theorems are obtained for the periodic number-of-customers processes under the fluid and diffusion scalings. Other results concern limits for general time-dependent queues and for time-homogeneous queues in steady state.
Consider the workload process for a single server queue with deterministic service times in which customers arrive according to a scheduled traffic process. A scheduled arrival sequence is one in which customers are scheduled to arrive at constant interarrival times, but each customer actual arrival time is perturbed from her scheduled arrival time by a random perturbation. In this paper, we consider a critically loaded queue in which the service rate equals the arrival rate. Unlike a queue fed by renewal traffic, this queue can be stable even in the presence of critical loading. We identify a…
We consider a model for transitory queues in which only a finite number of customers can join. The queue thus operates over a finite time horizon. In this system, also known as the $Δ_{(i)}/G/1$ queue, the customers decide independently when to join the queue by sampling their arrival time from a common distribution. We prove that, when the queue satisfies a certain heavy-traffic condition and under the additional assumption that the second moment of the service time is finite, the rescaled queue length process converges to a reflected Brownian motion with parabolic drift. Our result holds for…
This paper studies the heavy-traffic asymptotics for the multiclass FIFO M${}^X$/G/1 queue. We first derive the probability generating function of the joint queue length distribution. Using the probability generating function, we then present heavy-traffic asymptotic formulas for the joint queue length distribution and its joint moments (i.e., the joint queue length moments). These formulas are proved under weaker conditions on the service time distributions, compared to the ones reported in the literature. This fact leads us to conjectures that some of the conditions made in the literature ar…
The fixed-cycle traffic-light (FCTL) queue is the standard model for intersections with static signaling, where vehicles arrive, form a queue and depart during cycles controlled by a traffic light. Classical analysis of the FCTL queue based on transform methods requires a computationally challenging step of finding the complex-valued roots of some characteristic equation. Building on the recent work of Oblakova et al. (Exact expected delay and distribution for the fixed-cycle traffic-light model and similar systems in explicit form, 2016), we obtain a contour-integral expression, reminiscent o…
Following recent developments in the application of Stein's method in queueing theory, this paper is intended to be a short treatment showing how Stein's method can be developed and applied to the single server queue in heavy traffic. Here we provide two approaches to this approximation: one based on equilibrium couplings and another involving comparison of generators.
We consider queueing systems with n parallel queues under a Join the Shortest Queue (JSQ) policy in the Halfin-Whitt heavy traffic regime. We use the martingale method to prove that a scaled process counting the number of idle servers and queues of length exactly 2 weakly converges to a two-dimensional reflected Ornstein-Uhlenbeck process, while processes counting longer queues converge to a deterministic system decaying to zero in constant time. This limiting system is comparable to that of the traditional Halfin-Whitt model, but there are key differences in the queueing behavior of the JSQ m…
In this paper we study a two-queue polling model with zero switch-over times and $k$-limited service (serve at most $k_i$ customers during one visit period to queue $i$, $i=1,2$) in each queue. The arrival processes at the two queues are Poisson, and the service times are exponentially distributed. By increasing the arrival intensities until one of the queues becomes critically loaded, we derive exact heavy-traffic limits for the joint queue-length distribution using a singular-perturbation technique. It turns out that the number of customers in the stable queue has the same distribution as th…
Heavy-traffic limit theory deals with queues that operate close to criticality and face severe queueing times. Let $W$ denote the steady-state waiting time in the ${\rm GI}/{\rm G}/1$ queue. Kingman (1961) showed that $W$, when appropriately scaled, converges in distribution to an exponential random variable as the system's load approaches 1. The original proof of this famous result uses the transform method. Starting from the Laplace transform of the pdf of $W$ (Pollaczek's contour integral representation), Kingman showed convergence of transforms and hence weak convergence of the involved ra…
We study a single server FIFO queue that offers general service. Each of n customers enter the queue at random time epochs that are inde- pendent and identically distributed. We call this the random scattering traffic model, and the queueing model RS/G/1. We study the workload process associated with the queue in two different settings. First, we present Gaussian process approximations in a high intensity asymptotic scale and characterize the transient distribution of the approximation. Second, we study the rare event paths of the workload by proving a large deviations principle in the same hi…
In this paper, by the singular-perturbation technique, we investigate the heavy-traffic behavior of a priority polling system consisting of three M/M/1 queues with threshold policy. It turns out that the scaled queue-length of the critically loaded queue is exponentially distributed, independent of that of the stable queues. In addition, the queue lengths of stable queues possess the same distributions as a priority polling system with N-policy vacation. Based on this fact, we provide the exact tail asymptotics of the vacation polling system to approximate the tail distribution of the queue le…
We consider GI/Ph/n+M parallel-server systems with a renewal arrival process, a phase-type service time distribution, n homogenous servers, and an exponential patience time distribution with positive rate. We show that in the Halfin-Whitt regime, the sequence of stationary distributions corresponding to the normalized state processes is tight. As a consequence, we establish an interchange of heavy traffic and steady state limits for GI/Ph/n+M queues.
Traffic-light modelling is a complex task, because many factors have to be taken into account. In particular, capturing all traffic flows in one model can significantly complicate the model. Therefore, several realistic features are typically omitted from most models. We introduce a mechanism to include pedestrians and focus on situations where they may block vehicles that get a green light simultaneously. More specifically, we consider a generalization of the Fixed-Cycle Traffic-Light (FCTL) queue. Our framework allows us to model situations where (part of the) vehicles are blocked, e.g. by p…
We study the load balancing system operating under Join the Shortest Queue (JSQ) in the many-server heavy-traffic regime. If $N$ is the number of servers, we let the difference between the total service rate and the total arrival rate be $N^{1-α}$ with $α>0$. We show that for $α>4$ the average queue length behaves similarly to the classical heavy-traffic regime. Specifically, we prove that the distribution of the average queue length multiplied by $N^{1-α}$ converges to an exponential random variable. Moreover, we show a result analogous to state space collapse. We provide two proofs for our r…
A result of Ward and Glynn (2005) asserts that the sequence of scaled offered waiting time processes of the $GI/GI/1+GI$ queue converges weakly to a reflected Ornstein-Uhlenbeck process (ROU) in the positive real line, as the traffic intensity approaches one. As a consequence, the stationary distribution of a ROU process, which is a truncated normal, should approximate the scaled stationary distribution of the offered waiting time in a $GI/GI/1+GI$ queue; however, no such result has been proved. We prove the aforementioned convergence, and the convergence of the moments, in heavy traffic, thus…
We examine a queue-based random-access algorithm where activation and deactivation rates are adapted as functions of queue lengths. We establish its heavy traffic behavior on a complete interference graph, which turns out to be highly nonstandard in two respects: (1) the scaling depends on some parameter of the algorithm and is not the $N/N^2$ scaling usually found in functional central limit theorems; (2) the heavy traffic limit is deterministic. We discuss how this nonstandard behavior arises from the idleness induced by the distributed nature of the algorithm. In order to prove our main res…
In this paper we analyze a single server queue with batch arrivals and semi-Markovian service times. We also include the feature that the first service of each busy period might have a different distribution than subsequent service times. Our generating function based approach allows us to determine the heavy traffic limit of the scaled queue-length distribution. It turns out that this distribution converges to an exponential distribution. Nonsurprisingly, the exceptional first service does not influence this limiting distribution. We identify a sufficient and necessary condition under which t…
This paper addresses the analysis of the queue-length process of single-server queues under overdispersion, i.e., queues fed by an arrival process for which the variance of the number of arrivals in a given time window exceeds the corresponding mean. Several variants are considered, using concepts as mixing and Markov modulation, resulting in different models with either endogenously triggered or exogenously triggered random environments. Only in special cases explicit expressions can be obtained, e.g. when the random arrival and/or service rate can attain just finitely many values. While for …
Consider a single server queue with renewal arrivals and i.i.d. service times in which the server operates under a processor sharing service discipline. To describe the evolution of this system, we use a measure valued process that keeps track of the residual service times of all jobs in the system at any given time. From this measure valued process, one can recover the traditional performance processes, including queue length and workload. We show that under mild assumptions, including standard heavy traffic assumptions, the (suitably rescaled) measure valued processes corresponding to a sequ…
We consider a queueing system with $n$ parallel queues operating according to the so-called "supermarket model" in which arriving customers join the shortest of $d$ randomly selected queues. Assuming rate $nλ_{n}$ Poisson arrivals and rate $1$ exponentially distributed service times, we consider this model in the heavy traffic regime, described by $λ_{n}\uparrow 1$ as $n\to\infty$. We give a simple expectation argument establishing that majority of queues have steady state length at least $\log_d(1-λ_{n})^{-1} - O(1)$ with probability approaching one as $n\rightarrow\infty$, implying the same …
This paper deals with a single-server queue with modulated arrivals, service requirements and service capacity. In our first result, we derive the mean of the total workload assuming generally distributed service requirements and any service discipline which does not depend on the modulating environment. We then show that the workload is exponentially distributed under heavy-traffic scaling. In our second result, we focus on the discriminatory processor sharing (DPS) discipline. Assuming exponential, class-dependent service requirements, we show that the joint distribution of the queue lengths…
The single server queue with multiple customer types and semi-Markovian service times, sometimes referred to as the $M/SM/1$ queue, has been well-studied since its introduction by Neuts in 1966. In this paper, we apply an extension of this model, with batch arrivals and exceptional first service, to road traffic situations involving multiple streams of conflicting traffic. In particular, we use it in the context of gap acceptance models where low-priority traffic needs to cross (or, depending on the application, merge with) another traffic flow of higher priority. Traditionally, gap acceptance…
This paper considers a GI/GI/1 processor sharing queue in which jobs have soft deadlines. At each point in time, the collection of residual service times and deadlines is modeled using a random counting measure on the right half-plane. The limit of this measure valued process is obtained under diffusion scaling and heavy traffic conditions and is characterized as a deterministic function of the limiting queue length process. As special cases, one obtains diffusion approximations for the lead time profile and the profile of times in queue. One also obtains a snapshot principle for sojourn times…
We consider a two-node tandem queueing network in which the upstream queue is GI/GI/1 and each job reuses its upstream service requirement when moving to the downstream queue. Both servers employ the first-in-first-out policy. To investigate the evolution of workload in the second queue, we introduce and study a process M, called the plateau process, which encodes most of the information in the workload process. We focus on the case of infinite-variance service times and show that under appropriate scaling, workload in the first queue converges, and although the workload in the second queue do…
We study a differential game that governs the moderate-deviation heavy-traffic asymptotics of a multiclass single-server queueing control problem with a risk-sensitive cost. We consider a cost set on a finite but sufficiently large time horizon, and show that this formulation leads to stationary feedback policies for the game. Several aspects of the game are explored, including its characterization via a (one-dimensional) free boundary problem, the semi-explicit solution of an optimal strategy, and the specification of a saddle point. We emphasize the analogy to the well-known Harrison-Taksar …
The model is a "generalized switch", serving multiple traffic flows in discrete time. The switch uses MaxWeight algorithm to make a service decision (scheduling choice) at each time step, which determines the probability distribution of the amount of service that will be provided. We are primarily motivated by the following question: in the heavy traffic regime, when the switch load approaches critical level, will the service processes provided to each flow remain "smooth" (i.e., without large gaps in service)? Addressing this question reduces to the analysis of the asymptotic behavior of the …
We consider a single server queue that serves a finite population of $n$ customers that will enter the queue (require service) only once, also known as the $Δ_{(i)}/G/1$ queue. This paper presents a method for analyzing heavy-traffic behavior by using uniform acceleration, which simultaneously lets $n$ and the service rate grow large, while the initial resource utilization approaches one. A key feature of the model is that, as time progresses, more customers have joined the queue, and fewer customers can potentially join. This diminishing population gives rise to a class of reflected stochasti…
A "scheduled" arrival process is one in which the n th arrival is scheduled for time n, but instead occurs at a different time. The difference between the scheduled time and the arrival time is called the perturbation. The sequence of perturbations is assumed to be iid. We describe here the behavior of a single server queue fed by such traffic in which the processing times are deterministic. A particular focus is on perturbation with Pareto-like tails but with finite mean. We obtain tail approximations for the steady-state workload in both cases where the queue is critically loaded and under a…
We study a double-ended queue which consists of two classes of customers. Whenever there is a pair of customers from both classes, they are matched and leave the system immediately. The matching follows first-come-first-serve principle. If a customer from one class cannot be matched immediately, he/she will stay in a queue and wait for the upcoming arrivals from the other class. Thus there cannot be non-zero numbers of customers from both classes simultaneously in the system. We also assume that each customer can leave the queue without being matched because of impatience. The arrival processe…
We study the heavy-traffic limit of the generalized switch operating under MaxWeight, without assuming that the CRP condition is satisfied and allowing for correlated arrivals. The main contribution of this paper is the steady-state mean of linear combinations of queue lengths in heavy traffic. We showcase the generality of our result by presenting various stochastic networks as corollaries, each of which is a contribution by itself. In particular, we study the input-queued switch with correlated arrivals and we show that if the state space collapses to a full-dimensional subspace, the correla…
We characterize heavy-traffic process and steady-state limits for systems staffed according to the square-root safety rule, when the service requirements of the customers are perfectly correlated with their individual patience for waiting in queue. Under the usual many-server diffusion scaling, we show that the system is asymptotically equivalent to a system with no abandonment. In particular, the limit is the Halfin-Whitt diffusion for the $M/M/n$ queue when the traffic intensity approaches its critical value $1$ from below, and is otherwise a transient diffusion, despite the fact that the pr…
For a multiclass G/G/1 queue with finite buffers, admission and scheduling control, and holding and rejection costs, we construct a policy that is asymptotically optimal in the heavy traffic limit. The policy is specified in terms of a single parameter which constitutes the free boundary point from the Harrison-Taksar free boundary problem, but otherwise depends "explicitly" on the problem data. The c mu priority rule is also used by the policy, but in a way that is novel, and, in particular, different than that used in problems with infinite buffers. We also address an analogous problem where…
We establish a heavy-traffic limit theorem on convergence in distribution for the number of customers in a many-server queue when the number of servers tends to infinity. No critical loading condition is assumed. Generally, the limit process does not have trajectories in the Skorohod space. We give conditions for the convergence to hold in the topology of compact convergence. Some new results for an infinite server are also provided.
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 horizon $[0,T]$ is considered. The main result is the asymptotic optimality of a control policy derived via an underlying differential game. The result is the first to address a queueing control problem at the moderate deviation regime that goes beyond models having the so called pathwise minimality property. Moreover, despite the well known fact that an opti…
The drift method was recently developed to study queueing systems in steady-state. It was successfully used to obtain bounds on the moments of the scaled queue lengths, that are asymptotically tight in heavy-traffic, in a wide variety of systems including generalized switches, input-queued switches, bandwidth sharing networks, etc. In this paper we develop the use of transform techniques for heavy-traffic analysis, with a special focus on the use of moment generating functions. This approach simplifies the proofs of the drift method, and provides a new perspective on the drift method. We prese…
In this paper we investigate Gaussian queues in the light-traffic and in the heavy-traffic regime. The setting considered is that of a centered Gaussian process $X\equiv\{X(t):t\in\mathbb R\}$ with stationary increments and variance function $σ^2_X(\cdot)$, equipped with a deterministic drift $c>0$, reflected at 0: \[Q_X^{(c)}(t)=\sup_{-\infty<s\le t}(X(t)-X(s)-c(t-s)).\] We study the resulting stationary workload process $Q^{(c)}_X\equiv\{Q_X^{(c)}(t):t\ge0\}$ in the limiting regimes $c\to 0$ (heavy traffic) and $c\to\infty$ (light traffic). The primary contribution is that we show for both l…
We study a multiclass M/M/1 queueing control problem with finite buffers under heavy-traffic where the decision maker is uncertain about the rates of arrivals and service of the system and by scheduling and admission/rejection decisions acts to minimize a discounted cost that accounts for the uncertainty. The main result is the asymptotic optimality of a $cμ$-type of policy derived via underlying stochastic differential games studied in [16]. Under this policy, with high probability, rejections are not performed when the workload lies below some cut-off that depends on the ambiguity level. Whe…
This paper studies a scheduling control problem for a single-server multiclass queueing network in heavy traffic, operating in a changing environment. The changing environment is modeled as a finite state Markov process that modulates the arrival and service rates in the system. Various cases are considered: fast changing environment, fixed environment and slow changing environment. In each of the cases, using weak convergence analysis, in particular functional limit theorems for renewal processes and ergodic Markov processes, it is shown that an appropriate "averaged" version of the classical…
We consider a broad class of queueing models with random state-dependent vacation periods, which arise in the analysis of queue-based back-off algorithms in wireless random-access networks. In contrast to conventional models, the vacation periods may be initiated after each service completion, and can be randomly terminated with certain probabilities that depend on the queue length. We examine the scaled queue length and delay in a heavy-traffic regime, and demonstrate a sharp trichotomy, depending on how the activation rate and vacation probability behave as function of the queue length. In p…
This paper studies the asymptotic behavior of the steady-state waiting time, W_infty, of the M/G/1 queue with subexponenential processing times for different combinations of traffic intensities and overflow levels. In particular, we provide insights into the regions of large deviations where the so-called heavy traffic approximation and heavy tail asymptotic hold. For queues whose service time distribution decays slower than e^{-sqrt{t}} we identify a third region of asymptotics where neither the heavy traffic nor the heavy tailed approximations are valid. These results are obtained by derivin…
Setting traffic light signals is a classical topic in traffic engineering, and important in heavy-traffic conditions when green times become scarce and longer queues are inevitably formed. For the fixed-cycle traffic-light queue, an elementary queueing model for one traffic light with cyclic signaling, we obtain heavy-traffic limits that capture the long-term queue behavior. We leverage the limit theorems to obtain sharp performance approximations for one queue in heavy traffic. We also consider optimization problems that aim for optimal division of green times among multiple conflicting traff…
We consider the problem of scheduling a queueing system in which many statistically identical servers cater to several classes of impatient customers. Service times and impatience clocks are exponential while arrival processes are renewal. Our cost is an expected cumulative discounted function, linear or nonlinear, of appropriately normalized performance measures. As a special case, the cost per unit time can be a function of the number of customers waiting to be served in each class, the number actually being served, the abandonment rate, the delay experienced by customers, the number of idli…
This paper examines the performance of multi-class multi-server bipartite queueing systems under a FCFS-ALIS service discipline, where each arriving customer is only compatible with a subset of servers. We analyze the system under conventional heavy-traffic conditions, where the traffic intensity approaches one from below. Building upon the formulation and results of Afeche et al. 2021, we generalize the model by allowing the vector of arrival rates to approach the heavy-traffic limit from an arbitrary direction. We characterize the steady-state waiting times of the various customer classes an…
We study a single station two-stage reneging queue with Poisson arrivals, exponential services, and two levels of exponential reneging behaviors, extending the popular Erlang A model that assumes a constant reneging rate. We derive approximate analytical formulas representing performance measures for our two-stage queue following the Markov chain decomposition approach. Our formulas not only give accurate results spanning the heavy-traffic to the light-traffic regimes, but also provide insight into capacity decisions.
A queueing model has $J\ge2$ heterogeneous service stations, each consisting of many independent servers with identical capabilities. Customers of $I\ge2$ classes can be served at these stations at different rates, that depend on both the class and the station. A system administrator dynamically controls scheduling and routing. We study this model in the central limit theorem (or heavy traffic) regime proposed by Halfin and Whitt. We derive a diffusion model on $\mathbb {R}^I$ with a singular control term that describes the scaling limit of the queueing model. The singular term may be used to …
Two of the most popular approximations for the distribution of the steady-state waiting time, $W_{\infty}$, of the M/G/1 queue are the so-called heavy-traffic approximation and heavy-tailed asymptotic, respectively. If the traffic intensity, $ρ$, is close to 1 and the processing times have finite variance, the heavy-traffic approximation states that the distribution of $W_{\infty}$ is roughly exponential at scale $O((1-ρ)^{-1})$, while the heavy tailed asymptotic describes power law decay in the tail of the distribution of $W_{\infty}$ for a fixed traffic intensity. In this paper, we assume a …
In order to obtain Markov heavy-traffic approximations for infinite-server queues with general non-exponential service-time distributions and general arrival processes, possibly with time-varying arrival rates, we establish heavy-traffic limits for two-parameter stochastic processes. We consider the random variables $Q^e(t,y)$ and $Q^r(t,y)$ representing the number of customers in the system at time $t$ that have elapsed service times less than or equal to time $y$, or residual service times strictly greater than $y$. We also consider $W^r(t,y)$ representing the total amount of work in service…
We establish heavy-traffic stochastic-process limits for waiting times in many-server queues with customer abandonment. If the system is asymptotically critically loaded, as in the quality-and-efficiency-driven (QED) regime, then a bounding argument shows that the abandonment does not affect waiting-time processes. If instead the system is overloaded, as in the efficiency-driven (ED) regime, following Mandelbaum et al. [Proceedings of the Thirty-Seventh Annual Allerton Conference on Communication, Control and Computing (1999) 1095--1104], we treat customer abandonment by studying the limiting …
This paper presents a heavy-traffic analysis of the behavior of a single-server queue under an Earliest-Deadline-First (EDF) scheduling policy in which customers have deadlines and are served only until their deadlines elapse. The performance of the system is measured by the fraction of reneged work (the residual work lost due to elapsed deadlines) which is shown to be minimized by the EDF policy. The evolution of the lead time distribution of customers in queue is described by a measure-valued process. The heavy traffic limit of this (properly scaled) process is shown to be a deterministic fu…
We consider the optimal control of input-queued switches under a cost-weighted variant of MaxWeight scheduling, for which we establish theoretical properties that include showing the algorithm exhibits optimal heavy-traffic queue-length scaling. Our results are expected to be of theoretical interest more broadly than input-queued switches.
