English
Related papers

Related papers: Many-server asymptotics for Join-the-Shortest Queu…

200 papers

We consider a stochastic network with mobile users in a heavy-traffic regime. We derive the scaling limit of the multi-dimensional queue length process and prove a form of spatial state space collapse. The proof exploits a recent result by…

Probability · Mathematics 2013-05-24 Sem Borst , Florian Simatos

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…

Probability · Mathematics 2014-06-03 Anatolii A. Puhalskii

In this paper, we study optimal control problems for multiclass GI/M/n+M queues in an alternating renewal (up-down) random environment in the Halfin-Whitt regime. Assuming that the downtimes are asymptotically negligible and only the…

Optimization and Control · Mathematics 2019-08-20 Ari Arapostathis , Guodong Pang , Yi Zheng

A service system with multiple types of customers, arriving according to Poisson processes, is considered. The system is heterogeneous in that the servers also can be of multiple types. Each customer has an independent exponentially…

Probability · Mathematics 2016-05-20 Alexander Stolyar

In this work, we study the stationary distribution of the scaled queue length vector process in multiclass queueing networks operating under static buffer priority service policies. We establish that when subjected to a multi-scale heavy…

Probability · Mathematics 2024-11-06 J. G. Dai , Dongyan Huo

Recent workload measurements in Google data centers provide an opportunity to challenge existing models and, more broadly, to enhance the understanding of dispatching policies in computing clusters. Through extensive data-driven…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-04-27 Mert Yildiz , Alexey Rolich , Andrea Baiocchi

Inspired by quantum switches, we consider a discrete-time multi-way matching system with two classes of arrivals: requests for entangled pair of qubits between two nodes, and qubits from each node that can be used to serve the requests. An…

Performance · Computer Science 2023-10-05 Martin Zubeldia , Prakirt R. Jhunjhunwala , Siva Theja Maguluri

We consider Markovian many-server systems with admission control operating in a QED regime, where the relative utilization approaches unity while the number of servers grows large, providing natural Economies-of-Scale. In order to determine…

Probability · Mathematics 2014-11-12 Jaron Sanders , S. C. Borst , A. J. E. M. Janssen , J. S. H. van Leeuwaarden

We consider a system with N unit-service-rate queues in tandem, with exogenous arrivals of rate lambda at queue 1, under a back-pressure (MaxWeight) algorithm: service at queue n is blocked unless its queue length is greater than that of…

Probability · Mathematics 2010-02-23 Alexander Stolyar

This paper studies many-server limits for multi-server queues that have a phase-type service time distribution and allow for customer abandonment. The first set of limit theorems is for critically loaded $G/Ph/n+GI$ queues, where the…

Probability · Mathematics 2010-11-10 J. G. Dai , Shuangchi He , Tolga Tezcan

Steady-state solutions for a variety of relevant queueing systems are known today, e.g., from queueing theory, effective bandwidths, and network calculus. The behavior during transient phases, on the other hand, is understood to a much…

Networking and Internet Architecture · Computer Science 2015-06-16 Nico Becker , Markus Fidler

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…

Performance · Computer Science 2015-12-21 Daniel Marian Merezeanu , Daniela Andone

We consider a discrete-time parallel service system consisting of $n$ heterogeneous single server queues with infinite capacity. Jobs arrive to the system as an i.i.d. process with rate proportional to $n$, and must be immediately…

Performance · Computer Science 2025-05-30 Yishun Luo , Martin Zubeldia

A many-server queueing system is considered in which customers with independent and identically distributed service times enter service in the order of arrival. The state of the system is represented by a process that describes the total…

Probability · Mathematics 2010-10-05 Haya Kaspi , Kavita Ramanan

We use an Ornstein--Uhlenbeck (OU) process to approximate the queue length process in a $GI/GI/n+M$ queue. This one-dimensional diffusion model is able to produce accurate performance estimates in two overloaded regimes: In the first…

Probability · Mathematics 2013-12-17 Shuangchi He

This paper investigates a partially observable queueing system with $N$ nodes in which each node has a dedicated arrival stream. There is an extra arrival stream to balance the load of the system by routing its customers to the shortest…

Probability · Mathematics 2021-01-01 Qihui Bu , Liwei Liu , Jiashan Tang , Yiqiang Q. Zhao

In this paper, we study the asymptotic behavior of a fully-coupled slow-fast McKean-Vlasov stochastic system. Using the non-linear Poisson equation on Wasserstein space, we first establish the strong convergence in the averaging principle…

Probability · Mathematics 2022-07-14 Yun Li , Longjie Xie

Max weighted queue (MWQ) control policy is a widely used cross-layer control policy that achieves queue stability and a reasonable delay performance. In most of the existing literature, it is assumed that optimal MWQ policy can be obtained…

Systems and Control · Computer Science 2013-11-20 Junting Chen , Vincent K. N. Lau

We introduce a "system-wide safety staffing" (SWSS) parameter for multiclass multi-pool networks of any tree topology, Markovian or non-Markovian, in the Halfin-Whitt regime. This parameter can be regarded as the optimal reallocation of the…

Probability · Mathematics 2021-06-17 Hassan Hmedi , Ari Arapostathis , Guodong Pang

This paper introduces a new asymptotic regime for simplifying stochastic models having non-stationary effects, such as those that arise in the presence of time-of-day effects. This regime describes an operating environment within which the…

Probability · Mathematics 2018-07-19 Zeyu Zheng , Harsha Honnappa , Peter W. Glynn