Hostname: page-component-586b7cd67f-r5fsc Total loading time: 0 Render date: 2024-11-24T08:04:30.505Z Has data issue: false hasContentIssue false
  • English
  • Français

Weak convergence theorems for priority queues: preemptive-resume discipline

Published online by Cambridge University Press:  14 July 2016

Ward Whitt
Ward Whitt*
Affiliation:
Yale University
Get access Rights & Permissions [Opens in a new window]

Extract

We shall consider a single-server queue with r priority classes of customers and a preemptive-resume discipline. In this system customers are served in order of their priority while customers of the same priority are served in order of their arrival. Higher priority customers, immediately upon arrival, replace lower priority customers at the server, while customers displaced in this way return to the server before any other customers of the same priority receive service. When a displaced customer returns to the server, his remaining service time is the uncompleted portion of his original service time (cf. Jaiswal (1968)).

Type
Research Papers
Information
Journal of Applied Probability , Volume 8 , Issue 1 , March 1971 , pp. 74 - 94
Copyright
Copyright © Applied Probability Trust 1971 

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] Benes, V. (1963) General Stochastic Processes in the Theory of Queues. Addison-Wesley, Reading, Mass.Google Scholar
[2] Billingsley, P. (1968) Convergence of Probability Measures. John Wiley and Sons, New York.Google Scholar
[3] Hooke, J. and Prabhu, N. (1969) Priority queues in heavy traffic. Technical Report No. 83, Department of Operations Research, Cornell University.Google Scholar
[4] Hooke, J. (1969) Some Limit Theorems for Priority Queues. Ph. D. thesis. Cornell University (Technical Report No. 91, Department of Operations Research, Cornell University.).Google Scholar
[5] Iglehart, D. (1969) Multiple channel queues in heavy traffic, IV: law of the iterated logarithm. Technical Report No. 8, Department of Operations Research, Stanford University.Google Scholar
[6] Iglehart, D. and Kennedy, D. (1970) Weak convergence of the average of flag processes. J. Appl. Prob. 7, 747–753.CrossRefGoogle Scholar
[7] Iglehart, D. and Whitt, W. (1969) The equivalence of functional central limit theorems for counting processes and associated partial sums. Technical Report No. 5, Department of Operations Research, Stanford University.Google Scholar
[8] Iglehart, D. and Whitt, W. (1970a) Multiple channel queues in heavy traffic. I. Adv. Appl. Prob. 2, 150–177.CrossRefGoogle Scholar
[9] Iglehart, D. and Whitt, W. (1970b) Multiple channel queues in heavy traffic. II: sequences, networks, and batches. Adv. Appl. Prob. 2, 355–369.CrossRefGoogle Scholar
[10] Jaiswal, N. (1968) Priority Queues. Academic Press, New York.Google Scholar
[11] Karlin, S. (1966) A First Course in Stochastic Processes. Academic Press, New York.Google Scholar
[12] Whitt, W. (1969a) Weak Convergence Theorems for Queues in Heavy Traffic. Ph. D. thesis, Cornell University. (Technical Report No. 2, Department of Operations Research, Stanford University, 1968.).Google Scholar
[13] Whitt, W. (1969b) Weak convergence theorems for queues in heavy traffic. Paper submitted to Adv. Appl. Prob. Google Scholar
[14] Whitt, W. (1970) Multiple channel queues in heavy traffic. III: random server selection. Adv. Appl. Prob. 2, 370–375.CrossRefGoogle Scholar