Summary
We present a discrete-time round-robin queue with a last-in-first-served rule: a newly arriving job receives a quantum of service immediately and only thereafter joins the tail of the queue. For Bernoulli input and general arithmetic service times we compute steady-state probabilities and mean response times.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Adiri, I., Avi-Itzhak, B.: A time sharing queue. Management Sci. 18, 639–657 (1969)
Coffman, E.G., Muntz, R.R., Trotter, H.: Waiting time distribution for processor-sharing systems, JACM 17, 123–130 (1970)
Fayolle, G., Mitrani, I., Iasnogorodsko, R.: Sharing a processor among many job classes, JACM 27, 519–532 (1980)
Feller, W.: An introduction to probability theory and its applications, Vol. 2. New York: John Wiley 1965
Kleinrock, L.: Analysis of a time-shared processor. Naval Res. Logist. Quart. II, 59–73 (1964)
Kleinrock, L.: Queuing systems, Vol. 2. New York: John Wiley 1976
Kobayashi, H.: On discrete-time processes in a packetized communication system. ALOHA System Techn. Rep. B75-28, Univ. of Hawai, 1975
Rasch, P.J.: A queuing theory study of round-robin schedules of time-shared computer systems, JACM 17, 131–145 (1970)
Sakata, M., Noguchi, S., Oizumi, J.: An analysis of the M/G/1 queue under round robin scheduling. Operations Res. 19, 371–385 (1971)
Schassberger, R.: Warteschlangen. Wien: Springer 1973
Wolff, R.W.: Time sharing with priorities. SIAM J. Appl. Math. 19, 566–574 (1970)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Daduna, H., Schassberger, R. A discrete-time round-robin queue with bernoulli input and general arithmetic service time distributions. Acta Informatica 15, 251–263 (1981). https://doi.org/10.1007/BF00289264
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00289264