SearcharxivSearch

arXiv · 1707.05143

Queues Driven by Hawkes Processes

Abstract

Many stochastic systems have arrival processes that exhibit clustering behavior. In these systems, arriving entities influence additional arrivals to occur through self-excitation of the arrival process. In this paper, we analyze an infinite server queueing system in which the arrivals are driven by the self-exciting Hawkes process and where service follows a phase-type distribution or is deterministic. In the phase-type setting, we derive differential equations for the moments and a partial differential equation for the moment generating function; we also derive exact expressions for the transient and steady-state mean, variance, and covariances. Furthermore, we also derive exact expressions for the auto-covariance of the queue and provide an expression for the cumulant moment generating function in terms of a single ordinary differential equation. In the deterministic service setting, we provide exact expressions for the first and second moments and the queue auto-covariance. As motivation for our Hawkes queueing model, we demonstrate its usefulness through two novel applications. These applications are trending internet traffic and arrivals to nightclubs. In the web traffic setting, we investigate the impact of a click. In the nightclub or "Club Queue" setting, we design an optimal control problem for the rate to admit club-goers.

Explore related subjects

Keep this discovery

BibTeXRIS

Andrew Daw, Jamol Pender. 2017-07-17. Queues Driven by Hawkes Processes. https://arxiv.org/abs/1707.05143

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR