The M/G

The M/G

In modern teletraffic applications of queueing theory, service time distributions B(t) with a heavy tail occur, i.e., 1-B(t)~Ct-v for t→∞ with v>1. For such service time distributions, not much explicit information is available concerning the tail probabilities of the corresponding waiting time...

Full description

Bibliographic Details
Published in:IEEE Journal on selected areas in communications 16, 5 (1998).
Main Author: Boxma, O.J
Format: Article
Language:English
Subjects:
M/G/1 queue.
Approximation.
Asymptotic series.
Explicit expression.
Heavy-tailed service time distribution.
Heavy-traffic limit theorem.
Infinite variance.
Queueing theory.
Tail probabilities.
Teletraffic applications.
Waiting time distribution.