English

Bounds for the loss probability in large loss queueing systems

Probability 2009-11-20 v7 Statistics Theory Statistics Theory

Abstract

Let G(g1,g2)\mathcal{G}(\frak{g}_1,\frak{g}_2) be the class of all probability distribution functions of positive random variables having the given first two moments g1\frak{g}_1 and g2\frak{g}_2. Let G1(x)G_1(x) and G2(x)G_2(x) be two probability distribution functions of this class satisfying the condition G1(x)G2(x)<ϵ|G_1(x)-G_2(x)|<\epsilon for some small positive value ϵ\epsilon and let G^1(s)\widehat{G}_1(s) and, respectively, G^2(s)\widehat{G}_2(s) denote their Laplace-Stieltjes transforms. For real μ\mu satisfying μg1>1\mu\frak{g}_1>1 let us denote by γG1\gamma_{G_1} and γG2\gamma_{G_2} the least positive roots of the equations z=G^1(μμz)z=\widehat{G}_1(\mu-\mu z) and z=G^2(μμz)z=\widehat{G}_2(\mu-\mu z) respectively. In the paper, the upper bound for γG1γG2|\gamma_{G_1}-\gamma_{G_2}| is derived. This upper bound is then used to find lower and upper bounds for the loss probabilities in different large loss queueing systems.

Keywords

Cite

@article{arxiv.0804.2310,
  title  = {Bounds for the loss probability in large loss queueing systems},
  author = {Vyacheslav M. Abramov},
  journal= {arXiv preprint arXiv:0804.2310},
  year   = {2009}
}

Comments

27 pages, double spaced, completely rewritten

R2 v1 2026-06-21T10:30:54.009Z