Waiting time in a preemptive resume system with compound-poisson input

Abstract

A single-server queueing system with N priority classes, general service times, and preemptive resume discipline is investigated. The first two moments of the waiting time are calculated. The mathematical method uses the approximation of the waiting time by lower and upper bounds which converge to one another. These bounds are the solution of certain time-discrete queueing models. © 1980 Springer-Verlag.