English
Related papers

Related papers: Diffusion Models for Double-ended Queues with Rene…

200 papers

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…

Probability · Mathematics 2020-04-21 Onno Boxma , Mariska Heemskerk , Michel Mandjes

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

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\lambda_{n}$ Poisson arrivals and…

Probability · Mathematics 2017-01-19 Patrick Eschenfeldt , David Gamarnik

Inspired by the work of Atar and Miyazawa [1] (2026) as well as applications to energy-saving problems, we are interested in the heavy-traffic limit of the stationary queue length distribution, which is not addressed in [1]. In this paper,…

Probability · Mathematics 2026-04-13 Masahiro Kobayashi , Masakiyo Miyazawa , Yutaka Sakuma

We develop a heavy traffic diffusion limit theorem under nonstandard spatial scaling for the queue length process in a single server queue employing shortest remaining processing time (SRPT). For processing time distributions with unbounded…

Probability · Mathematics 2015-10-29 Amber L. Puha

In this paper, we study the $G/\mathit{GI}/N$ queue in the Halfin--Whitt regime. Our first result is to obtain a deterministic fluid limit for the properly centered and scaled number of customers in the system which may be used to provide a…

Probability · Mathematics 2009-12-16 Josh Reed

This work considers a many-server queueing system in which customers with i.i.d., generally distributed service times enter service in the order of arrival. The dynamics of the system is represented in terms of a process that describes the…

Probability · Mathematics 2007-08-08 Haya Kaspi , Kavita Ramanan

We propose a unified approach to establishing diffusion approximations for queues with impatient customers within a general framework of scaling customer patience time. The approach consists of two steps. The first step is to show that the…

Probability · Mathematics 2015-10-06 Junfei Huang , Hanqin Zhang , Jiheng Zhang

We develop a cross-border market model for two countries based on a continuous trading mechanism, in which the transmission capacities that enable transactions between market participants from different countries are limited. Our market…

Probability · Mathematics 2024-11-26 Cassandra Milbradt , Dörte Kreher

We present a heavy traffic analysis for a single server queue with renewal arrivals and generally distributed i.i.d. service times, in which the server employs the Shortest Remaining Processing Time (SRPT) policy. Under typical heavy…

Probability · Mathematics 2012-10-04 H. Christian Gromoll , Łukasz Kruk , Amber L. Puha

In this paper we establish a diffusion limit for a multivariate continuous time Markov chain whose components are indexed by vertices of a finite graph. The components take values in a common finite set of non-negative integers and evolve…

Probability · Mathematics 2025-09-15 Anatolii Puhalskii , Vadim Shcherbakov

Atar and Miyazawa recently introduced a single server queue with queue length dependent arrival and service processes, and name it a multi-level queue. They prove that the heavy traffic limit of its queue length process weakly converges to…

Probability · Mathematics 2025-05-07 Masahiro Kobayashi , Masakiyo Miyazawa , Yutaka Sakuma

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

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…

Probability · Mathematics 2019-02-20 Marko Boon , Erik Winands

This paper derives a diffusion approximation for a sequence of discrete-time one-sided limit order book models with non-linear state dependent order arrival and cancellation dynamics. The discrete time sequences are specified in terms of an…

Probability · Mathematics 2017-08-25 Ulrich Horst , Dörte Kreher

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…

Probability · Mathematics 2007-05-23 H. Christian Gromoll

This paper contains an asymptotic analysis of a fluid model for a heavily loaded processor sharing queue. Specifically, we consider the behavior of solutions of critical fluid models as time approaches \infty. The main theorems of the paper…

Probability · Mathematics 2009-09-29 Amber L. Puha , Ruth J. Williams

We consider a reaction-diffusion system for two densities lying in adjacent domains of $\mathbb{R}^N$. We treat two configurations: either a cylinder and its complement, or two half-spaces. Diffusion and reaction heterogeneities for the two…

Analysis of PDEs · Mathematics 2025-06-06 Henri Berestycki , Luca Rossi , Andrea Tellini

In this paper, we consider queueing systems where the dynamics are non-stationary and state-dependent. For performance analysis of these systems, fluid and diffusion models have been typically used. Although they are proven to be…

Probability · Mathematics 2016-09-08 Young Myoung Ko , Natarajan Gautam

This paper studies the diffusion limit for a network of infinite-server queues operating under Markov modulation (meaning that the system's parameters depend on an autonomously evolving background process). In previous papers on (primarily…

Probability · Mathematics 2017-12-13 H. M. Jansen , M. Mandjes , K. De Turck , S. Wittevrongel