Hostname: page-component-76fb5796d-9pm4c Total loading time: 0 Render date: 2024-04-29T23:47:40.721Z Has data issue: false hasContentIssue false
  • English
  • Français

Basic analysis of a head-of-the-line priority queue with renewal type input

Published online by Cambridge University Press:  14 July 2016

R. Schassberger
R. Schassberger*
Affiliation:
University of Calgary
Get access Rights & Permissions [Opens in a new window]

Abstract

A single server is fed by a renewal stream of individual customers. These are of type k with probability πk, k = 1, …, N, and are all served individually. Upon completion of a service the server proceeds immediately with a customer of the lowest type (= highest priority) present, if any. Service times for type k are drawn from a general distribution function Bk(t) concentrated on (0, ∞).

We lay the foundations for a broad analysis of the model.

Keywords

QUEUINGPRIORITIESWIENER-HOPF TECHNIQUERENEWAL PROCESSPHASE METHOD
Type
Short Communications
Information
Journal of Applied Probability , Volume 12 , Issue 2 , June 1975 , pp. 346 - 352
Copyright
Copyright © Applied Probability Trust 1975 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1] Hooke, J. (1969) Some limit theorems for priority queues. Technical Report No. 91, Department of Operational Research, Cornell University.Google Scholar
[2] Jaiswal, N. K. (1968) Priority Queues. Academic Press, New York.Google Scholar
[3] Muskhelishvili, N. I. (1946) Singular Integral Equations. Nordhoff, Groningen.Google Scholar
[4] Schassberger, R. (1972) On the work load process in a general preemptive resume priority queue. J. Appl. Prob. 9, 588–603.Google Scholar
[5] Schassberger, R. (1973) Warteschlangen. Springer, Vienna.Google Scholar
[6] Schassberger, R. (1974) A broad analysis of single server priority queues with two independent input streams, one of them Poisson. Adv. Appl. Prob. 6, 666–668.Google Scholar
[7] Wolff, R. (1970) Work conserving priorities. J. Appl. Prob. 7, 327–337.Google Scholar