English
Related papers

Related papers: On Transitory Queueing

200 papers

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

Probability · Mathematics 2013-12-04 David Gamarnik , David A. Goldberg

While many classical traffic models treat the spatial extension of streets continuously or by discretization into cells of a certain length, we will subdivide roads into comparatively long homogeneous road sections of constant capacity with…

Statistical Mechanics · Physics 2009-11-10 Dirk Helbing

We consider a point process $i+\xi_i$, where $i\in \bZ$ and the $\xi_{i}$'s are i.i.d. random variables with variance $\sigma^{2}$. This process, with a suitable rescaling of the distribution of $\xi_i$'s, converges to the Poisson process…

Probability · Mathematics 2009-02-11 G. Guadagni , S. Ndreca , B. Scoppola

Motivated by demand prediction for the custodial prison population in England and Wales, this paper describes an approach to the study of service systems using infinite server queues, where the system has non-empty initial state and the…

Applications · Statistics 2023-02-23 Nikki Sonenberg , Victoria Volodina , Peter G. Challenor , Jim Q. Smith

We consider a generalized processing system having several queues, where the available service rate combinations are fluctuating over time due to reliability and availability variations. The objective is to allocate the available resources,…

Networking and Internet Architecture · Computer Science 2011-05-04 Kevin Ross , Nicholas Bambos , George Michailidis

In this paper, we present a functional fluid limit theorem and a functional central limit theorem for a queue with an infinity of servers M/GI/$\infty$. The system is represented by a point-measure valued process keeping track of the…

Probability · Mathematics 2009-09-29 Laurent Decreusefond , Pascal Moyal

Understanding the detailed queueing behavior of a networking session is critical in enabling low-latency services over the Internet. Especially when the packet arrival and service rates at the queue of a link vary over time and moreover…

Networking and Internet Architecture · Computer Science 2017-04-25 Wonjun Hwang , Yoora Kim , Kyunghan Lee

We consider an $M/G/\infty$ queue with infinite expected service time. We then provide the transience/recurrence classification of the states (the system is said to be at state $n$ if there are $n$ customers being served), observing also…

Probability · Mathematics 2024-07-12 Serguei Popov

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

A vibrational model of transport properties of dense fluids assumes that solid-like oscillations of atoms around their temporary equilibrium positions dominate the dynamical picture. The temporary equilibrium positions of atoms do not form…

Soft Condensed Matter · Physics 2024-01-09 Sergey Khrapak

We study a system, where a random flow of customers is served by servers (called agents) invited on-demand. Each invited agent arrives into the system after a random time; after each service completion, an agent returns to the system or…

Probability · Mathematics 2017-11-28 Lam M. Nguyen , Alexander Stolyar

We study a generalization of the $M/G/1$ system (denoted by $rM/G/1$) with independent and identically distributed (iid) service times and with an arrival process whose arrival rate $\lambda_0f(r)$ depends on the remaining service time $r$…

Probability · Mathematics 2017-10-05 Benjamin Legros , Ali Devin Sezer

This paper proposes a stochastic framework to evaluate the performance of public transit systems under short random service suspensions. We aim to derive closed-form formulations of the mean and variance of the queue length and waiting…

Probability · Mathematics 2023-01-04 Baichuan Mo , Li Jin , Haris N. Koutsopoulos , Zuo-Jun Max Shen , Jinhua Zhao

This contribution investigates asymptotic properties of transient queue length process $$ Q(t)=\max\left(x+X(t)-ct, \sup_{0\leq s\leq t}\left(X(t)-X(s)-c(t-s)\right)\right),\ \ \ t\geq 0 $$ in Gaussian fluid queueing model, where input…

Probability · Mathematics 2018-06-18 Krzysztof Debicki , Peng Liu

We introduce a macroscopic model for a network of conveyor belts with various speeds and capacities. In a different way from traffic flow models, the product densities are forced to move with a constant velocity unless they reach a maximal…

Analysis of PDEs · Mathematics 2018-10-23 Adriano Festa , Simone Göttlich , Marion Pfirsching

We study a queueing network with a single shared server, that serves the queues in a cyclic order according to the gated service discipline. External customers arrive at the queues according to independent Poisson processes. After…

Probability · Mathematics 2014-09-11 Marko Boon , Rob van der Mei , Erik Winands

One-dimensional non-equilibrium models of particles subjected to a coagulation-diffusion process are important in understanding non-equilibrium dynamics, and fluctuation-dissipation relation. We consider in this paper transport properties…

Statistical Mechanics · Physics 2015-06-18 Jean-Yves Fortin

We consider a queueing network operating under a strictly upper-triangular routing matrix with per column at most one non-negative entry. The root node is fed by a Gaussian process with stationary increments. Our aim is to characterize the…

Probability · Mathematics 2025-03-24 Nikolai Kriukov , Krzysztof Dȩbicki , Michel Mandjes

A single queueing system with time-dependent exponentially distributed arrival processes and exponential machine processes (Kendall notation $M_t/M_t/1$) is analyzed. Modeling the time evolution for the discrete queue-length distribution by…

Probability · Mathematics 2018-12-21 Dieter Armbruster , Simone Göttlich , Stephan Knapp