Abstract
Consider a general system (or subsystem) with a single queue. In this context, we compare three different disciplines:ROS (Random Order of Service),RI (Random Insertion), andRAP (Randomly Assigned Priorities). The first of these (ROS) is a classical discipline; the other two are introduced in this paper. It turns out that the waiting time distributions for two of these disciplines are exactly the same, while the third discipline has strikingly different characteristics.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
P.J. Burke, Equilibrium delay distribution for one channel with constant holding time, Poisson input, and random service, Bell Syst. Techn. J. 38 (1959) 1021–1031.
S.W. Fuhrmann, Second moment relationships for waiting times in queueing systems with Poisson input, Queueing Syst. 8 (1991) 397–406.
S.W. Fuhrmann and M.M. Nassehi,ROS andRI are stochastically equivalent, manuscript in preparation.
D.P. Heyman and M.J. Sobel,Stochastic Models in Operations Research, Vol. 1 (McGraw-Hill, New York, 1982).
D.P. Heyman and S. Stidham, Jr., The relation between customer and time averages in queues, Oper. Res. 28 (1980) 983–994.
I. Iliadis, Head of the line arbitration of packet switches with combined input and output queueing, Int. J. Digital and Analog Commun. Syst. 4 (1991) 181–190.
M.J. Karol, M.G. Hluchyj and S.P. Morgan, Input versus output queueing on a space-division packet switch, IEEE Trans. Commun. COM-35 (1987) 1347–1356.
J.F.C. Kingman, On queues in which customers are served in random order, Proc. Cambridge Phil. Soc. 58 (1962) 79–91.
J.W. Mellor, Delayed call formulae when calls are served in a random order, P.O.E.E.J. 25 (1942) 53–56.
L.K. Platzman, J.C. Ammons and J.J. Bartholdi III, A simple and efficient algorithm to compute tail probabilities from transforms, Oper. Res. 36 (1988) 137–144.
F. Pollaczek, La loi d'attente des appels téléphoniques, C.R. Acad Sci. Paris 222 (1946) 353–355.
J. Riordan, Delay curves for calls served at random, Bell Syst. Techn. J. 32 (1953) 100–119.
S.M. Ross,Stochastic Processes (Wiley, New York, 1983).
J.G. Shanthikumar and U. Sumita, Convex ordering of sojourn times in single server queues: Extremal properties of FIFO and LIFO service disciplines, J. Appl. Prob. 24 (1987) 737–748.
L. Takács,Introduction to the Theory of Queues (Oxford University Press, New York, 1962).
O.A. Vasicek, An inequality for the variance of waiting time under a general queueing discipline, Oper. Res. 25 (1977) 879–884.
E. Vaulot, Delais d'attente des appels téléphoniques traités en hazard, C.R. Acad. Sci. Paris 222 (1946) 268–269.
R.I. Wilkinson, Delayed exponential calls served in random order, Bell Syst. Techn. J. 32 (1953) 360–383.
Author information
Authors and Affiliations
Additional information
Work done by this author while he was with IBM Zurich Research Laboratory.
Rights and permissions
About this article
Cite this article
Fuhrmann, S.W., Iliadis, I. A comparison of three random disciplines. Queueing Syst 18, 249–271 (1994). https://doi.org/10.1007/BF01158764
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01158764