Summary
A queueing system has restricted accessibility if not every customer is admitted to the system. For such a system the admittance of a customer will in general depend on the state of the queueing system at the moment of his arrival. In this paper queueing models will be studied for which the accessibility depends on the actual waiting time of the arriving customer. Various queueing situations encountered in the allocation of memory equipment for information processing systems may be described as a single server queueing system with restricted accessibility; the mathematical models for the involved storage problems belong to queueing theory and are discussed in the present paper.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J. W. Cohen,The single server queue, ch. III.6, North Holland Publ. Co. Amsterdam (1969).
L. G. Afanas'eva and A. V. Martynov, On ergodic properties of queues with constraints.Theor. of Prob. and Appl. 1 (1967) 104–109 (Eng. ed.).
A. Erdélyi,Higher transcendental functions, McGraw-Hill Book Co., New York, Vol. 1 (1953).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Cohen, J.W. Single server queues with restricted accessibility. J Eng Math 3, 265–284 (1969). https://doi.org/10.1007/BF01535299
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01535299