English
Related papers

Related papers: Zero-automatic queues and product form

200 papers

In this paper, we consider a simple test case of multiparameter product systems that arise out of random measures. We associate a product system to a stationary Poisson process and a stationary compound Poisson process. We show that the…

Operator Algebras · Mathematics 2020-08-03 S. Sundar

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 investigate the long-run behavior of single-server queues with Hawkes arrivals and general service distributions and related optimization problems. In detail, utilizing novel coupling techniques, we establish finite moment bounds for the…

Probability · Mathematics 2023-11-14 Xinyun Chen , Guiyu Hong

In this paper, we consider a new queueing model where queues balance themselves according to a mean field interaction with a time delay. Unlike other work with delayed information our model considers multi-server queues with customer…

Dynamical Systems · Mathematics 2021-12-14 Philip Doldo , Jamol Pender

We consider the Erlang A model, or $M/M/m+M$ queue, with Poisson arrivals, exponential service times, and $m$ parallel servers, and the property that waiting customers abandon the queue after an exponential time. The queue length process is…

Probability · Mathematics 2014-12-10 Charles Knessl , Johan S. H. van Leeuwaarden

We study a single station two-stage reneging queue with Poisson arrivals, exponential services, and two levels of exponential reneging behaviors, extending the popular Erlang A model that assumes a constant reneging rate. We derive…

Probability · Mathematics 2020-12-21 Katsunobu Sasanuma , Alan Scheller-Wolf

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

This paper studies the asymptotic behavior of the steady-state waiting time, W_infty, of the M/G/1 queue with subexponenential processing times for different combinations of traffic intensities and overflow levels. In particular, we provide…

Probability · Mathematics 2011-03-22 Mariana Olvera-Cravioto , Peter W. Glynn

Pedestrian dynamics exhibits various collective phenomena. Here we study bidirectional pedestrian flow in a floor field cellular automaton model. Under certain conditions, lane formation is observed. Although it has often been studied…

Physics and Society · Physics 2012-07-25 Stefan Nowak , Andreas Schadschneider

We review recent progress on the zero-range process, a model of interacting particles which hop between the sites of a lattice with rates that depend on the occupancy of the departure site. We discuss several applications which have…

Statistical Mechanics · Physics 2009-11-11 M. R. Evans , T. Hanney

Priority queues with parallel access are an attractive data structure for applications like prioritized online scheduling, discrete event simulation, or branch-and-bound. However, a classical priority queue constitutes a severe bottleneck…

Data Structures and Algorithms · Computer Science 2014-11-06 Hamza Rihani , Peter Sanders , Roman Dementiev

Motivated by the growing interest in today's massive parallel computing capabilities we analyze a queueing network with many servers in parallel to which jobs arrive a according to a Poisson process. Each job, upon arrival, is split into…

Probability · Mathematics 2015-07-20 Mariana Olvera-Cravioto , Octavio Ruiz-Lacedelli

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

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 a single server system with infinite waiting room in a random environment. The service system and the environment interact in both directions. Whenever the environment enters a prespecified subset of its state space the service…

Probability · Mathematics 2013-12-03 Ruslan Krenzler , Hans Daduna

A FORTRAN program to simulate the operation of infinite servers queues is presented in this work. Poisson arrivals processes are considered but not only. For many parameters of interest in queuing systems study or application, either there…

Performance · Computer Science 2021-10-20 Manuel Alberto M. Ferreira

We consider stochastically modeled chemical reaction systems with mass-action kinetics and prove that a product-form stationary distribution exists for each closed, irreducible subset of the state space if an analogous deterministically…

Probability · Mathematics 2010-01-31 David F. Anderson , Gheorghe Craciun , Thomas G. Kurtz

This paper develops a generalization of Brownian motion with stationary, autocorrelated increments as a tractable model for problems in business and finance. We show that any real continuous Gaussian Markov process with stationary…

Probability · Mathematics 2012-12-03 Kerry Fendick

We consider the problem of customer equilibrium strategies in an M/M/1 queue under dynamic service control. The service rate switches between a low and a high value depending on system congestion. Arriving customers do not observe the…

Optimization and Control · Mathematics 2011-12-07 Y. Dimitrakopoulos , A. Burnetas

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