English
Related papers

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

200 papers

In previous papers we developed a deterministic fluid approximation for an overloaded Markovian queueing system having two customer classes and two service pools, known in the call-center literature as the X model. The system uses the…

Probability · Mathematics 2013-01-24 Ohad Perry , Ward Whitt

In the present paper, we study the evolution of an overloaded cyclic polling model that starts empty. Exploiting a connection with multitype branching processes, we derive fluid asymptotics for the joint queue length process. Under passage…

Probability · Mathematics 2014-10-24 Maria Frolkova , Sergey Foss , Bert Zwart

We consider a regulated multi-class instantaneous matching system with reneging, in which each event requires $K \geq 2$ distinct impatient agents who wait in their respective queues. Each agent class is subject to a buffer capacity,…

Probability · Mathematics 2025-07-15 Bowen Xie

We consider a one-dimensional stochastic reaction-diffusion generalizing the totally asymmetric simple exclusion process, and aiming at describing single lane roads with vehicles that can change speed. To each particle is associated a jump…

Statistical Mechanics · Physics 2011-09-09 Cyril Furtlehner , Jean-Marc Lasgouttes

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…

Probability · Mathematics 2015-12-01 Gianmarco Bet , Remco van der Hofstad , Johan S. H. van Leeuwaarden

This is an expository review paper illustrating the ``martingale method'' for proving many-server heavy-traffic stochastic-process limits for queueing models, supporting diffusion-process approximations. Careful treatment is given to an…

Probability · Mathematics 2007-12-28 Guodong Pang , Rishi Talreja , Ward Whitt

We consider a processor sharing queue where the number of jobs served at any time is limited to $K$, with the excess jobs waiting in a buffer. We use random counting measures on the positive axis to model this system. The limit of this…

Probability · Mathematics 2012-07-02 Jiheng Zhang , J. G. Dai , Bert Zwart

We study $n$ parallel queues in an extreme heavy-traffic regime: each server works at rate $n$, while jobs arrive to a dispatcher at rate $n^2-(a-b)\sqrt{n}$, with fixed $a>b>0$. Arrivals are routed by a marginal join-the-shortest-queue…

Probability · Mathematics 2026-05-19 Sayan Banerjee , Amarjit Budhiraja , Eva Loeser

This paper introduces a discrete limit order book model where new orders are placed with a fixed displacement from the mid-price. Further, the trade event occurs whenever the mid-price hits the price level on which there is some volume.…

Probability · Mathematics 2020-07-16 Friedrich Hubalek , Dragana Radojicic

In traditional priority queues, we assume that every customer upon arrival has a fixed, class-dependent priority, and that a customer may not commence service if a customer with a higher priority is present in the queue. However, in…

We consider open multi-class queueing networks with general arrival processes, general processing time sequences and Bernoulli routing. The network is assumed to be operating under an arbitrary work-conserving scheduling policy that makes…

Probability · Mathematics 2021-11-23 Sarat Babu Moka , Yoni Nazarathy , Werner Scheinhardt

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…

Probability · Mathematics 2014-01-14 J. G. Dai , A. B. Dieker , Xuefeng Gao

We study an ordinary differential equation (ODE) arising as the many-server heavy-traffic fluid limit of a sequence of overloaded Markovian queueing models with two customer classes and two service pools. The system, known as the X model in…

Probability · Mathematics 2010-08-10 Ohad Perry , Ward Whitt

We study many-server queues with abandonment in which customers have general service and patience time distributions. The dynamics of the system are modeled using measure- valued processes, to keep track of the residual service and patience…

Probability · Mathematics 2013-08-27 Jiheng Zhang

In this paper, we study an $N$ server fork-join queue with nearly deterministic arrival and service times. Specifically, we present a fluid limit for the maximum queue length as $N\to\infty$. This fluid limit depends on the initial number…

Probability · Mathematics 2021-08-24 Dennis Schol , Maria Vlasiou , Bert Zwart

In this paper, we analyze a two-queue random time-limited Markov modulated polling model. In the first part of the paper, we investigate the fluid version: Fluid arrives at the two queues as two independent flows with deterministic rate.…

Probability · Mathematics 2021-12-10 Stella Kapodistria , Mayank Saxena , Onno Boxma , Offer Kella

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$…

Probability · Mathematics 2016-02-02 Mariska Heemskerk , Johan van Leeuwaarden , Michel Mandjes

A micro-scale model is proposed for the evolution of the limit order book. Within this model, the flows of orders (claims) are described by doubly stochastic Poisson processes taking account of the stochastic character of intensities of bid…

Probability · Mathematics 2014-12-09 V. Yu. Korolev , A. V. Chertok , A. Yu. Korchagin , A. I. Zeifman

Motivated by growing applications in two-sided markets, we study a parallel matching queue with reneging. Demand and supply units arrive to the system and are matched in an FCFS manner according to a compatibility graph specified by an…

Probability · Mathematics 2023-12-27 Francisco Castro , Hamid Nazerzadeh , Chiwei Yan

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…

Probability · Mathematics 2019-08-23 Chihoon Lee , Amy R. Ward , Heng-Qing Ye