Hostname: page-component-7b7567c8c-8tzhz Total loading time: 0 Render date: 2026-11-19T12:43:19.111Z Has data issue: false hasContentIssue false

Convergence rates for M/G/1 queues and ruin problems with heavy tails

Published online by Cambridge University Press:  14 July 2016

Søren Asmussen*
Affiliation:
University of Lund
Jozef L. Teugels*
Affiliation:
Universiteit Leuven
*
∗ Postal address: Department of Mathematical Statistics, University of Lund, Box 118, 221 00 Lund, Sweden.
∗∗ Postal address: Department of Mathematics, Katholieke Universiteit Leuven, Celestijnenlaan 200B, 3001 Heverlee, Belgium.

Abstract

The time-dependent virtual waiting time in a M/G/1 queue converges to a proper limit when the traffic intensity is less than one. In this paper we give precise rates on the speed of this convergence when the service time distribution has a heavy regularly varying tail.

The result also applies to the classical ruin problem. We obtain the exact rate of convergence for the ruin probability after time t for the case where claims arrive according to a Poisson process and claim sizes are heavy tailed.

Our result supplements similar theorems on exponential convergence rates for relaxation times in queueing theory and ruin probabilities in risk theory.

Information

Type
Research Papers
Copyright
Copyright © Applied Probability Trust 1996 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable