English
Related papers

Related papers: Queues Driven by Hawkes Processes

200 papers

We consider a queueing system consisting of two non-identical exponential servers, where each server has its own dedicated queue and serves the customers in that queue FCFS. Customers arrive according to a Poisson process and join the queue…

Probability · Mathematics 2017-03-20 Jori Selen , Ivo J. B. F. Adan , Stella Kapodistria , Johan S. H. van Leeuwaarden

We consider a service system where agents (or, servers) are invited on-demand. Customers arrive as a Poisson process and join a customer queue. Customer service times are i.i.d. exponential. Agents' behavior is random in two respects.…

Probability · Mathematics 2016-09-09 Lam Nguyen , Alexander Stolyar

We consider a stochastic fluid queue served by a constant rate server and driven by a process which is the local time of a certain Markov process. Such a stochastic system can be used as a model in a priority service system, especially when…

Probability · Mathematics 2007-09-11 Takis Konstantopoulos , Andreas Kyprianou , Marina Sirvio , Paavo Salminen

Due to the stochastic nature of departure operations, working at full capacity makes major US airports very sensitive to uncertainties. Consequently, airport ground operations face critically congested taxiways and long runway queues. In…

Other Computer Science · Computer Science 2008-07-08 Pierrick Burgain , Eric Feron , John-Paul Clarke

Motivated by timeouts in Internet services, we consider networks of infinite server queues in which routing decisions are based on deadlines. Specifically, at each node in the network, the total service time equals the minimum of several…

Performance · Computer Science 2016-09-20 Neal Master , Nicholas Bambos

We study infinite server queues driven by Cox processes in a fast oscillatory random environment. While exact performance analysis is difficult, we establish diffusion approximations to the (re-scaled) number-in-system process by proving…

Probability · Mathematics 2021-08-31 Harsha Honnappa , Yiran Liu , Samy Tindel , Aaron Yip

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 address a single server queue control problem (QCP) in heavy traffic originating from Lee and Weerasinghe (2011). The state process represents the offered waiting time, the customer arrival has a state-dependent intensity, and the…

Optimization and Control · Mathematics 2025-07-18 Bowen Xie , Haoyu Yin

We consider multi-component matching systems in heavy traffic consisting of $K\geq 2$ distinct perishable components which arrive randomly over time at high speed at the assemble-to-order station, and they wait in their respective queues…

Probability · Mathematics 2024-05-21 Bowen Xie

Efficiently exploiting servers in data centers requires performance analysis methods that account not only for the stochastic nature of demand but also for server heterogeneity. Although several recent works proved optimality results for…

Networking and Internet Architecture · Computer Science 2021-09-03 Mark van der Boor , Céline Comte

The non-stationary Erlang-A queue is a fundamental queueing model that is used to describe the dynamic behavior of large scale multi-server service systems that may experience customer abandonments, such as call centers, hospitals, and…

Probability · Mathematics 2026-01-14 Andrew Daw , Jamol Pender

In this paper, we analyse a single server polling model with two queues. Customers arrive at the two queues according to two independent Poisson processes. There is a single server that serves both queues with generally distributed service…

Probability · Mathematics 2017-07-14 Mayank Saxena , Onno Boxma , Stella Kapodistria , Rudesindo Núñez Queija

We consider the heavy-traffic approximation to the $GI/M/s$ queueing system in the Halfin-Whitt regime, where both the number of servers $s$ and the arrival rate $\lambda$ grow large (taking the service rate as unity), with…

Probability · Mathematics 2013-02-14 Brian H. Fralix , Charles Knessl , Johan S. H. van Leeuwaarden

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

Multi-server queueing systems describe situations in which users require service from multiple parallel servers. Examples include check-in lines at airports, waiting rooms in hospitals, queues in contact centers, data buffers in wireless…

Probability · Mathematics 2019-07-30 Johan S. H. van Leeuwaarden , Britt W. J. Mathijsen , Bert Zwart

This paper examines the performance of multi-class multi-server bipartite queueing systems under a FCFS-ALIS service discipline, where each arriving customer is only compatible with a subset of servers. We analyze the system under…

Probability · Mathematics 2023-03-31 Lisa Aoki Hillas , Rene Caldentey , Varun Gupta

In many stochastic service systems, decision-makers find themselves making a sequence of decisions, with the number of decisions being unpredictable. To enhance these decisions, it is crucial to uncover the causal impact these decisions…

Methodology · Statistics 2023-07-18 Juan C. David Gomez , Amy L. Cochran , Gabriel Zayas-Caban

Network capacity region of multi-queue multi-server queueing system with random ON-OFF connectivities and stationary arrival processes is derived in this paper. Specifically, the necessary and sufficient conditions for the stability of the…

Information Theory · Computer Science 2010-01-14 Hassan Halabian , Ioannis Lambadaris , Chung-Horng Lung

These days enterprise applications try to integrate online processing and batch jobs into a common software stack for seamless monitoring and driverless operations. Continuous integration of these systems results in choking of the poorly…

Performance · Computer Science 2015-12-16 Subrata Ashe

We study an optimal-control problem of polling systems with large switchover times, when a holding cost is incurred on the queues. In particular, we consider a stochastic network with a single server that switches between several buffers…

Probability · Mathematics 2020-09-01 Yue Hu , Jing Dong , Ohad Perry