2007
DOI: 10.1007/s11134-007-9052-7
|View full text |Cite
|
Sign up to set email alerts
|

Exact waiting time and queue size distributions for equilibrium M/G/1 queues with Pareto service

Abstract: This paper solves the problem of finding exact formulas for the waiting time cdf and queue length distribution of first-in-first-out M/G/1 queues in equilibrium with Pareto service. The formulas derived are new and are obtained by directly inverting the relevant Pollaczek-Khinchin formula and involve single integrals of non-oscillating real valued functions along the positive real line. Tables of waiting time and queue length probabilities are provided for certain parameter values under heavy traffic condition… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
23
0

Year Published

2009
2009
2021
2021

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 19 publications
(23 citation statements)
references
References 21 publications
(22 reference statements)
0
23
0
Order By: Relevance
“…Pareto claims, ρ = 0.80 φ = 1.5 example because exact calculations of the ruin probabilities are available in this case, due to [17,18]. We apply the calibration procedure descrubed in Section 4 and approximate the distribution of X as a suitable mixture of scaled versions of Y .…”
Section: Note Thatmentioning
confidence: 99%
See 2 more Smart Citations
“…Pareto claims, ρ = 0.80 φ = 1.5 example because exact calculations of the ruin probabilities are available in this case, due to [17,18]. We apply the calibration procedure descrubed in Section 4 and approximate the distribution of X as a suitable mixture of scaled versions of Y .…”
Section: Note Thatmentioning
confidence: 99%
“…In Tables 1 -4 we compare the obtained approximate ruin probability with the exact (for Pareto claims) numbers of [17,18]. The comparison is performed for a risk reserve process with unit premium rate in terms of the expected net claim amount per unit time, ρ, and the parameter φ of the Pareto distribution.…”
Section: Note Thatmentioning
confidence: 99%
See 1 more Smart Citation
“…Then, we refer here to the case 1 < γ 2, where the Pareto distribution has finite mean and infinite variance. This entails a sort of paradox: the M/P/1 queue is stable {there exists the state probability distribution as well as the distribution of the delay [6]}, but its mean delay is infinite (actually, it does not exists); this is a very special case where the infinite mean delay does not imply the queue instability. Note that in these queuing systems with heavy-tailed distributions of the service time, the interest is not on the study of the mean delay, but rather on the queue overflow probability (case with finite rooms in the queue) on the basis of There are also problems in simulating M/P/1 queues as γ approaches 2 from above; the simulation can be extremely slow to approach the regime condition.…”
Section: 332mentioning
confidence: 99%
“…In [15] this integral representation was generalized to arbritrary (non-integer) m > 0, in [19] to a renewal risk model with Erlang interclaim times and in [16] to the case of compound shifted Pareto sums. In all these cases the used method is akin to the one used in [7] and [8] to determine the density function of the finite sum of certain Pareto variables.…”
Section: Introductionmentioning
confidence: 99%