English
Related papers

Related papers: Queueing for ergodic arrivals and services

200 papers

We consider the single server queue with service in random order. For a large class of heavy-tailed service time distributions, we determine the asymptotic behavior of the waiting time distribution. For the special case of Poisson arrivals…

Probability · Mathematics 2017-11-29 Onno Boxma , Sergey Foss , Jean-Marc Lasgouttes , Rudesindo Núñez Queija

We study infinite-server queues in which the arrival process is a Cox process (or doubly stochastic Poisson process), of which the arrival rate is given by shot noise. A shot-noise rate emerges as a natural model, if the arrival rate tends…

Probability · Mathematics 2017-03-21 David Koops , Michel Mandjes , Onno Boxma

In many different settings, requests for service can arrive in near or true simultaneity with one another. This creates batches of arrivals to the underlying queueing system. In this paper, we study the staffing problem for the batch…

Performance · Computer Science 2023-05-31 Andrew Daw , Robert C. Hampshire , Jamol Pender

We consider a multi-server queue in the Halfin-Whitt regime: as the number of servers $n$ grows without a bound, the utilization approaches 1 from below at the rate $\Theta(1/\sqrt{n})$. Assuming that the service time distribution is…

Probability · Mathematics 2008-03-19 David Gamarnik , Petar Momcilovic

We investigate the transient and stationary queue-length distributions of a class of service systems with correlated service times. The classical $M^X/G/1$ queue with semi-Markov service times is the most prominent example in this class and…

Probability · Mathematics 2018-01-19 Abhishek , Marko Boon , Onno Boxma , Rudesindo Núñez-Queija

In this paper we consider a single-server cyclic polling system. Between visits to successive queues, the server is delayed by a random switch-over time. The order in which customers are served in each queue is determined by a priority…

Probability · Mathematics 2014-08-05 Marko Boon , Ivo Adan , Onno Boxma

We give uniform proofs of tightness and exponential tightness of the sequences of stationary queue lengths in generalised Jackson networks in a number of setups which concern large, normal and moderate deviations.

Probability · Mathematics 2026-04-09 A. Puhalskii

We calculate asymptotics of the distribution of the number of customers in orbit in a two-class priority retrial $M/G/1$-type queueing model. In this model, priority customers wait in line while non-priority customers join an orbit and…

Probability · Mathematics 2018-01-23 Joris Walraevens , Dieter Claeys , Tuan Phung-Duc

We consider the problem of scheduling a queueing system in which many statistically identical servers cater to several classes of impatient customers. Service times and impatience clocks are exponential while arrival processes are renewal.…

Probability · Mathematics 2007-05-23 Rami Atar , Avi Mandelbaum , Martin I. Reiman

We consider an acyclic network of single-server queues with heterogeneous processing rates. It is assumed that each queue is fed by the superposition of a large number of i.i.d. Gaussian processes with stationary increments and positive…

Probability · Mathematics 2020-09-01 Martin Zubeldia , Michel Mandjes

This note introduces a piecewise-deterministic queueing (PDQ) model to study the stability of traffic queues in parallel-link transportation systems facing stochastic capacity fluctuations. The saturation rate (capacity) of the PDQ model…

Optimization and Control · Mathematics 2018-02-19 Li Jin , Saurabh Amin

This paper presents a comprehensive review of stochastic processes, with a particular focus on Markov chains and jump processes. The main results related to queuing systems are analyzed. Additionally, conditions that ensure the stability,…

Probability · Mathematics 2025-07-30 Carlos E. Martínez-Rodríguez

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

In this paper, we extend recent results on the convergence of ergodic averages along sequences generated by return times to shrinking targets in rapidly mixing systems, partially answering questions posed by the first author, Maass and the…

Dynamical Systems · Mathematics 2026-03-03 Sebastián Donoso , Sovanlal Mondal , Vicente Saavedra-Araya

This paper deals with the exponential stabilization of a time-delay system with an average of the state as the output. A general stability theorem with a guaranteed exponential decay-rate based on a Wirtinger-based inequality is provided.…

Optimization and Control · Mathematics 2017-11-27 Matthieu Barreau , Alexandre Seuret , Frederic Gouaisbaut

We consider a system of N queues with decentralized load balancing such as power-of-D strategies(where D may depend on N) and generic scheduling disciplines. To measure the dependence of the queues, we use the clan of ancestors, a technique…

Probability · Mathematics 2018-09-17 Maria Clara Fittipaldi , Matthieu Jonckheere , Sergio I. Lopez

We study a passenger-taxi double-ended queue with impatient passengers and two-point matching time in this paper. The system considered in this paper is different from those considered in the existing literature, which fully considers the…

Probability · Mathematics 2021-01-29 Zhen Wang , Cheryl Yang , Liwei Liu , Yiqiang Q. Zhao

By means of a novel variational approach we study ergodic properties of a model of a multi lane traffic flow, considered as a (deterministic) wandering of interacting particles on an infinite lattice. For a class of initial configurations…

Chaotic Dynamics · Physics 2007-05-23 Michael Blank

This paper studies a closed queueing network containing a hub (a state dependent queueing system with service depending on the number of units residing here) and $k$ satellite stations, which are $GI/M/1$ queueing systems. The number of…

Probability · Mathematics 2010-02-19 Vyacheslav M. Abramov

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