Related papers: Queue Length Behavior in a Switch under the MaxWei…
In many important real-world queueing settings, arrival and service rates fluctuate over time. We consider the MAMS system, where the arrival and service rates each vary according to an arbitrary finite-state Markov chain, allowing…
To boost energy saving for the general delay-tolerant IoT networks, a two-stage and single-relay queueing communication scheme is investigated. Concretely, a traffic-aware $N$-threshold and gated-service policy are applied at the relay. As…
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…
We consider an automatic overload control for two large service systems modeled as multi-server queues, such as call centers. We assume that the two systems are designed to operate independently, but want to help each other respond to…
We consider a connection-level model proposed by Massouli\'{e} and Roberts for bandwidth sharing among file transfer flows in a communication network. We study weighted proportionally fair sharing policies and establish explicit-form bounds…
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…
This paper introduces and analyzes the notion of throughput suboptimality for many-server queueing systems in heavy traffic. The queueing model under consideration has multiple customer classes, indexed by a finite set $\mathcal{I}$, and…
Load balancing plays a critical role in efficiently dispatching jobs in parallel-server systems such as cloud networks and data centers. A fundamental challenge in the design of load balancing algorithms is to achieve an optimal trade-off…
A collection of $k$ mobile agents is arbitrarily deployed in the edges of a directed torus network where agents perpetually move to the successor edge. Each node has a switch that allows one agent of the two incoming edges to pass to its…
We consider the problem of utility optimal scheduling in general \emph{processing networks} with random arrivals and network conditions. These are generalizations of traditional data networks where commodities in one or more queues can be…
Considering a Manhattan mobility model in vehicle-to-vehicle networks, this work studies a power minimization problem subject to second-order statistical constraints on latency and reliability, captured by a network-wide maximal data queue…
This paper studies a multiclass queueing system with an associated risk- sensitive cost observed in heavy traffic at the moderate deviation scale, accounting for convex queue length penalties. The main result is the asymptotic optimality of…
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 $\Delta_{(i)}/G/1$ queue. This paper presents a method for analyzing heavy-traffic…
We study distributed load balancing in bipartite queueing systems where frontends route jobs to heterogeneous backends with workload-dependent service rates. The system's connectivity -- governed by compatibility constraints such as data…
We extend stochastic network optimization theory to treat networks with arbitrary sample paths for arrivals, channels, and mobility. The network can experience unexpected link or node failures, traffic bursts, and topology changes, and…
Let $X$ be the constrained random walk on ${\mathbb Z}_+^2$ with increments $(1,0)$, $(-1,0)$, $(0,1)$ and $(0,-1)$; $X$ represents, at arrivals and service completions, the lengths of two queues working in parallel whose service and…
In this paper we consider the problem of maximum throughput for tandem queueing system. We modeled this system as a Quasi-Birth-Death process. In order to do this we named level the number of customers waiting in the first buffer (including…
The Join-the-Shortest-Queue (JSQ) load-balancing scheme is known to minimise the average delay of jobs in homogeneous systems consisting of identical servers. However, it performs poorly in heterogeneous systems where servers have different…
Service systems like data centers and ride-hailing are popularly modeled as queueing systems in the literature. Such systems are primarily studied in the steady state due to their analytical tractability. However, almost all applications in…
The emerging connected-vehicle technology provides a new dimension in developing more intelligent traffic control algorithms for signalized intersections in networked transportation systems. An important challenge for the scheduling problem…