2017
DOI: 10.2139/ssrn.3003376
|View full text |Cite
|
Sign up to set email alerts
|

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 selfexcitation 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 equati… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

3
49
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
6

Relationship

1
5

Authors

Journals

citations
Cited by 23 publications
(52 citation statements)
references
References 32 publications
3
49
0
Order By: Relevance
“…In the following, a numerical example is given for a simple Hawkes process. From (10) and (11) As shown in Figure 1, we see that correlation coefficient ρ(t) of N(t) and λ(t) is a decreasing function of time t and lim t↓0 ρ(t) = 1, lim t↑∞ ρ(t) = 0, as we intuitively expect.…”
Section: Applications To a Simple Hawkes Processsupporting
confidence: 54%
See 1 more Smart Citation
“…In the following, a numerical example is given for a simple Hawkes process. From (10) and (11) As shown in Figure 1, we see that correlation coefficient ρ(t) of N(t) and λ(t) is a decreasing function of time t and lim t↓0 ρ(t) = 1, lim t↑∞ ρ(t) = 0, as we intuitively expect.…”
Section: Applications To a Simple Hawkes Processsupporting
confidence: 54%
“…In fact these are not so easy to describe in general, but results for low-order moments are easy to obtain. Results for all first-and second-order moments can be found: from (10) and (11) for first-order moments, and from (8), (12), (13), and (14) for second-order moments; see Example 1 below. All expectations of order m can be found as follows.…”
Section: Applications To a Simple Hawkes Processmentioning
confidence: 99%
“…While the arrival process of visitors to the Web site may well be a Poisson process, its rate may jump up due to some (external) event, then decay gradually, only to jump up again because of another event. Such an example formed one of the motivations for [2,7,8], which all study infinite-server queues with an overdispersed arrival process.…”
Section: Main Goals and Resultsmentioning
confidence: 99%
“…Infinite-server queues are also studied in [2] and [8], but the arrival process there is a Hawkes process, the so-called self-exciting process-jumps in the shot-noise process in turn increase the intensity of the occurrence of the jumps. Daw and Pender [2] present several interesting motivating examples. They consider deterministic jump sizes in the shot-noise process and study in particular the Hawkes/Ph/∞ and Hawkes/D/∞ queues, obtaining detailed expressions for moments and autocovariances.…”
Section: Introductionmentioning
confidence: 99%
“…Because the relationships between the true quantities and their approximations are conditioned only on the service and abandonment rate, it may be possible for this to be extended to stochastic-intensity, non-Poisson arrival processes, such as the Hawkes process or shot noise driven queues studied in [23], [24], and [6]. Finally, in a similar manner it would be interesting to extend this to networks of Erlang-A queues; however, we would have to keep track of the routeing probabilities carefully to keep track of the convexity/concavity of the rate functions.…”
mentioning
confidence: 99%