Hostname: page-component-586b7cd67f-t7fkt Total loading time: 0 Render date: 2024-11-22T06:19:54.422Z Has data issue: false hasContentIssue false
  • English
  • Français

Preemptive priority queues

Published online by Cambridge University Press:  09 April 2009

G. F. Yeo
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.

Type
Research Article
Information
Journal of the Australian Mathematical Society , Volume 3 , Issue 4 , November 1963 , pp. 491 - 502
Copyright
Copyright © Australian Mathematical Society 1963

References

[1]Feller, W., “An Introduction to Probability Theory and its Applications”, 2nd Ed. Vol. 1, John Wiley and Sons, (1957).Google Scholar
[2]Finch, P. D., “A probability limit theorem with application to a generalisation of queueing theory,” Acta Math. Acad. Sci. Hung. (1959) 10, 113–122.CrossRefGoogle Scholar
[3]Gaver, D. P., “Imbedded Markov chain analysis of a waiting-line process in continuons time,”, Ann. Math. Statist. (1959) 30, 698–720.CrossRefGoogle Scholar
[4]Gaver, D. P., “A waiting line with interrupted service, including priorities,” J. Roy. Statist. Soc. (1962) B24, 73–90.Google Scholar
[5]Lukács, E., “Characteristic Functions”, Charles Griffen (1960).Google Scholar
[6]Miller, R.G., “Priority queues,’ Ann. Math. Statist. (1960) 31, 86–103.CrossRefGoogle Scholar
[7]Takács, L., “Investigation of waiting time problems by reduction to Markov processes,” Acta Math. Acad. Sci. Hung. (1955) 6, 101–129.CrossRefGoogle Scholar
[8]Yeo, G.F. and Weesakul, B., “Distribution of delay to traffic at an intersection”, (1963) (submitted for publication).Google Scholar
[9]Yeo, G.F., “Single server queues with modified service mechanisms”, J. Aust. Math. Soc. (1962) 2, 499–507.CrossRefGoogle Scholar