English
Related papers

Related papers: Waves in a Spatial Queue: Stop-and-Go at Airport S…

200 papers

We study a single-server Markovian queueing model with $N$ customer classes in which priority is given to the shortest queue. Under a critical load condition, we establish the diffusion limit of the workload and queue length processes in…

Probability · Mathematics 2018-10-26 Rami Atar , Asaf Cohen

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

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

This paper considers the time evolution of a queue that is embedded in a Poisson point process of moving wireless interferers. The queue is driven by an external arrival process and is subject to a time-varying service process that is a…

Information Theory · Computer Science 2021-04-14 Nithin S. Ramesan , François Baccelli

Several spatially continuous pedestrian dynamics models have been validated against empirical data. We try to reproduce the experimental fundamental diagram (velocity versus density) with simulations. In addition to this quantitative…

Physics and Society · Physics 2010-01-20 Andrea Portz , Armin Seyfried

In discrete time, customers arrive at random. Each waits until one of two servers is available; each thereafter departs at random. We seek the distribution of maximum line length of idle customers. In the context of an emergency room (for…

History and Overview · Mathematics 2019-02-26 Steven Finch

We consider a model for transitory queues in which only a finite number of customers can join. The queue thus operates over a finite time horizon. In this system, also known as the $\Delta_{(i)}/G/1$ queue, the customers decide…

Probability · Mathematics 2018-11-26 Gianmarco Bet

This work studies queues in a Euclidean space. Consider $N$ servers that are distributed uniformly in $[0,1]^d$. Customers arrive at the servers according to independent stationary processes. Upon arrival, they probabilistically decide…

Probability · Mathematics 2024-09-05 B. R. Vinay Kumar , Lasse Leskelä

It is known that in a stationary Brownian queue with both arrival and service processes equal in law to Brownian motion, the departure process is a Brownian motion, that is, Burke's theorem in this context. In this short note we prove…

Probability · Mathematics 2016-06-27 Sergio I. López

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

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

We consider a service system with two Poisson arrival queues. A server chooses which queue to serve at each moment. Once a queue is served, all the customers will be served within a fixed amount of time. This model is useful in studying…

Optimization and Control · Mathematics 2013-07-02 Yuhang Liu , Zizhuo Wang

This paper considers a parallel system of queues fed by independent arrival streams, where the service rate of each queue depends on the number of customers in all of the queues. Necessary and sufficient conditions for the stability of the…

Probability · Mathematics 2010-01-12 Sem Borst , Matthieu Jonckheere , Lasse Leskelä

In this work we propose a model to describe the statistical fluctuations of the self-driven objects (species A) walking against an opposite crowd (species B) in order to simulate the regime characterized by stop-and-go waves in the context…

Statistical Mechanics · Physics 2014-08-12 Roberto da Silva , Agenor Hentz , Alexandre Alves

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

In this paper we consider a single-server cyclic polling system consisting of two queues. Between visits to successive queues, the server is delayed by a random switch-over time. Two types of customers arrive at the first queue: high and…

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

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

Stop-and-go waves are commonly observed in traffic and pedestrian flows. In most traffic models they occur through a phase transition after fine tuning of parameters when the model has unstable homogeneous solutions. Inertia effects are…

Physics and Society · Physics 2019-12-03 Antoine Tordeux , Andreas Schadschneider , Sylvain Lassarre

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
‹ Prev 1 2 3 10 Next ›