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...

Полное описание

Библиографические подробности

Опубликовано в::	IEEE Journal on selected areas in communications 16, 5 (1998).
Главный автор:	Boxma, O.J
Формат:	Статья
Язык:	English
Предметы:	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.