Abstract
System designers often implement priority queueing disciplines in order to improve overall system performance; however, improvement is often gained at the expense of lower priority cystomers. Shortest Processing Time is an example of a priority discipline wherein lower priority customers may suffer very long waiting times when compared to their waiting times under a democratic service discipline. In what follows, we shall investigate a queueing system where customers are divided into a finitie number of priority classes according to their service times.
We develop the multivariate generating function characterizing the joint workload among the priority classes. First moments obtained from the generating function yield traffic intensities for each priority class. Second moments address expected workloads, in particular, we obtain simple Pollaczek-Khinchine type formulae for the classes. Higher moments address variance and covariance among the workloads of the priority classes.
References
J. Jacod, Multivariate point processes: predictable projection, Radon-Nikodym derivatives, representation of martingales, Z. Wahrscheinlichk. 31 (1975) 235–253.
P. Brémaud,Point Processes and Queues (Springer, New York, 1981).
J. Jacod and A.N. Shiryaev,Limit Theorems for Stochastic Processes (Springer, New York, 1987).
F. Papangelou, Integrability of expected increments of point processes and a related change of scale, Trans. Amer. Math Soc. 165 (1972) 483–506.
F. Baccelli and P. Brémaud,Palm Probabilities and Stationary Queues (Springer, New York, 1987).
P. Brémaud, Characteristics of queueing systems observed at events and the connection between stochastic intensity and Palm probability, Queueing Systems 5 (1989) 99–112.
S.L. Brumelle, On the relation between customer and time averages in queues, J. Appl. Prob. 8 (1971) 508–520.
W. Whitt, An interpolation approximation for the mean workload in theGI/G/1 queue, Oper. Res. 37 (1989) 936–952.
J.W. Cohen,The Single Server Queue, 2nd ed. (North-Holland, Amsterdam, 1982).
Author information
Authors and Affiliations
Additional information
This work was supported in part by National Science Foundation Grant DDM-8913658.
Rights and permissions
About this article
Cite this article
Kiessler, P.C., Wortman, M.A. Workload in queues having priorities assigned according to service time. Queueing Syst 10, 403–408 (1992). https://doi.org/10.1007/BF01193328
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01193328