Hostname: page-component-cd9895bd7-mkpzs Total loading time: 0 Render date: 2024-12-23T16:45:00.561Z Has data issue: false hasContentIssue false
  • English
  • Français

A broad analysis of single server priority queues with two independent input streams, one of them Poisson

Published online by Cambridge University Press:  01 July 2016

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

Abstract

A single server faces a renewal stream of low and another one of high priority customers, one of them being a Poisson stream. For the preemptive resume and head-of-the line disciplines the transient behaviour of the queue is studied. Various limiting distributions are also obtained.

Keywords

QUEUINGPREEMPTIVE PRIORITYHEAD-OF-THE LINE PRIORITYPHASE METHODWIENER-HOPF FACTORIZATION
Type
Research Article
Information
Advances in Applied Probability , Volume 6 , Issue 4 , December 1974 , pp. 666 - 688
Copyright
Copyright © Applied Probability Trust 1974 

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] Cohen, J. W. (1969) The Single Server Queue. North Holland, Amsterdam.Google Scholar
[2] Hooke, J. A. (1972) A priority queue with low-priority arrivals general. Operat. Res. 20, 373–380.Google Scholar
[3] Hooke, J. A. (1972) Some heavy-traffic limit theorems for a priority queue with general arrivals. Operat. Res. 20, 381–388.Google Scholar
[4] Hooke, J. A. and Prabhu, N. U. (1971) Priority queues in heavy traffic. Opsearch 8, 1–9.Google Scholar
[5] Jaiswal, N. K. (1968) Priority Queues. Academic Press, New York.Google Scholar
[6] Muskhelishvili, N. I. (1946) Singular Integral Equations. P. Noordhoff, Groningen.Google Scholar
[7] Sahin, I. (1970) Some stochastic systems with secondary inputs. , Department of Operations Research, Case Western University.Google Scholar
[8] Schassberger, R. (1972) On the work load process in a general preemptive resume priority queue. J. Appl. Prob. 9, 588–603.Google Scholar
[9] Schassberger, R. (1973) Investigation of queuing and related systems with the phase method. Proceedings of 7th International Teletraffic Congress. Google Scholar
[10] Schassberger, R. (1973) Warteschlangen. Springer, Wien.Google Scholar
[11] Whitt, W. (1971) Weak convergence theorems for priority queues: preemptive resume discipline. J. Appl. Prob. 8, 74–94.Google Scholar