Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
