Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-18T23:08:05.780Z Has data issue: false hasContentIssue false

Preemptive priority queues

Published online by Cambridge University Press:  09 April 2009

G. F. Yeo
Affiliation:
Australian National University, Canberra
Rights & Permissions [Opens in a new window]

Summary

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

In this paper priority queues with K classes of customers with a preemptive repeat and a preemptive resume policy are considered. Customers arrive in independent Poisson processes, are served, within classes, in order of arrival, and have general requirements for service. Transforms of stationary waiting time and queue size distributions and busy period distributions are obtained for individual classes and for the system; the moments of the distributions are considered.

Information

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 1963