English
Related papers

Related papers: Queueing for ergodic arrivals and services

200 papers

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 distributional symmetry is invariance of a distribution under a group of transformations. Exchangeability and stationarity are examples. We explain that a result of ergodic theory provides a law of large numbers: If the group satisfies…

Statistics Theory · Mathematics 2021-11-30 Morgane Austern , Peter Orbanz

In this paper, we consider the number of both arrivals and departures seen by a tagged customer while in service in a classical $M/M/1$ processor sharing queue. By exploiting the underlying orthogonal structure of this queuing system…

Performance · Computer Science 2019-04-12 Fabrice Guillemin , Veronica Quintuna Rodriguez

Amid unprecedented times caused by COVID-19, healthcare systems all over the world are strained to the limits of, or even beyond, capacity. A similar event is experienced by some healthcare systems regularly, due to for instance seasonal…

Performance · Computer Science 2020-04-30 Binyamin Oz , Seva Shneer , Ilze Ziedins

In this paper we study the number of customers in infinite-server queues with a self-exciting (Hawkes) arrival process. Initially we assume that service requirements are exponentially distributed and that the Hawkes arrival process is of a…

Probability · Mathematics 2018-05-02 David Koops , Mayank Saxena , Onno Boxma , Michel Mandjes

We study networks of interacting queues governed by utility-maximising service-rate allocations in both discrete and continuous time. For {\em finite} networks we establish stability and some steady-state moment bounds under natural…

Probability · Mathematics 2019-08-21 Seva Shneer , Alexander Stolyar

We study the workload processes of two restricted M/G/1 queueing systems: in Model 1 any service requirement that would exceed a certain capacity threshold is truncated; in Model 2 new arrivals do not enter the system if they have to wait…

Probability · Mathematics 2012-01-04 Martin Kolb , Wolfgang Stadje , Achim Wübker

In this paper we study a non-stationary Markovian queueing model of a two-processor heterogeneous system with time-varying arrival and service rates. We obtain the bounds on the rate of convergence and find the main limiting characteristics…

Probability · Mathematics 2018-06-28 A. Zeifman , Y. Satin , K. Kiseleva , T. Panfilova , V. Korolev

We study occupation time statistics in ergodic continuous-time random walks. Under thermal detailed balance conditions, the average occupation time is given by the Boltzmann-Gibbs canonical law. But close to the non-ergodic phase, the…

Statistical Mechanics · Physics 2015-06-24 Johannes H. P. Schulz , Eli Barkai

Recently, T. Tao gave a finitary proof a convergence theorem for multiple averages with several commuting transformations and soon later, T. Austin gave an ergodic proof of the same result. Although we give here one more proof of the same…

Dynamical Systems · Mathematics 2012-09-27 Bernard Host

We study a double-ended queue which consists of two classes of customers. Whenever there is a pair of customers from both classes, they are matched and leave the system immediately. The matching follows first-come-first-serve principle. If…

Probability · Mathematics 2016-07-18 Xin Liu

Motivated by stability questions on piecewise deterministic Markov models of bacterial chemotaxis, we study the long time behavior of a variant of the classic telegraph process having a non-constant jump rate that induces a drift towards…

Probability · Mathematics 2012-04-27 Joaquin Fontbona , Hélène Guérin , Florent Malrieu

A network belongs to the monotone separable class if its state variables are homogeneous and monotone functions of the epochs of the arrival process. This framework contains several classical queueing network models, including generalized…

Probability · Mathematics 2007-05-23 Marc Lelarge

In this paper, we investigate overlap times in a two-dimensional infinite server tandem queue. Specifically, we analyze the amount of time that a pair of customers spend overlapping in any station of the two dimensional tandem network. We…

Probability · Mathematics 2024-03-13 Ruici Gao , Jamol Pender

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

We study ergodic properties of a family of traffic maps acting in the space of bi-infinite sequences of real numbers. The corresponding dynamics mimics the motion of vehicles in a simple traffic flow, which explains the name. Using…

Dynamical Systems · Mathematics 2015-06-11 Michael Blank

In the literature, retrial queues with batch arrivals and heavy service times have been studied and the so-called equivalence theorem has been established under the condition that the service time is heavier than the batch size. The…

Probability · Mathematics 2020-08-13 Bin Liu , Jie Min , Yiqiang Q. Zhao

Stochastic processes of interacting particles with varying length are relevant e.g. for several biological applications. We try to explore what kind of new physical effects one can expect in such systems. As an example, we extend the…

Statistical Mechanics · Physics 2015-04-28 Christoph Schultens , Andreas Schadschneider , Chikashi Arita

The mean ergodic theorem is equivalent to the assertion that for every function K and every epsilon, there is an n with the property that the ergodic averages A_m f are stable to within epsilon on the interval [n,K(n)]. We show that even…

Dynamical Systems · Mathematics 2016-07-15 Jeremy Avigad , Philipp Gerhardy , Henry Towsner

A "scheduled" arrival process is one in which the n th arrival is scheduled for time n, but instead occurs at a different time. The difference between the scheduled time and the arrival time is called the perturbation. The sequence of…

Probability · Mathematics 2021-02-16 V. F. Araman , H. Chen , P. W. Glynn , L. Xia