QUEUEING MODELS FOR TIME-SHARING SERVICE SYSTEMS
Abstract
In most queueing situations, it is desirable that service to customers be free from interruptions causing time and service losses. It is recognized, however, that in certain circumstances controlled interruptions may improve overall system performance, and this idea is the bais of all time- sharing systems. In the latter, service is given in segments; the customer may be served, uninterrupted, for no longer than some predetermined time interval called a quantum. If the service is not completed within a given quantum, the customer is dismissed and placed in a queue, and the next customer is admitted. This paper is a survey of time-sharing models studied recently by the authors. It covers the following single-server models: (1) single queue with infinite number of potential customers - R.R.1; (2) single queue with finite number of potential customers; (3) r queues with infinite number of potential customers - R.R.r, in which a customer who completes his i-th service segment joins the end of the (i+1)-th queue, the r-th queue is organized on a 'round-robin' basis, and the server, when admitting a customer to service, selects the first in the lowest-index's non-empty queue; (4) R.R.1. with various types of priority regimes. Each model provides a means for achieving desired given properties. The performance parameters of the models are compared numerically, and the advantages and weaknesses of each model are discussed.
Document Details
- Document Type
- Technical Report
- Publication Date
- Oct 01, 1968
- Accession Number
- AD0682958
Entities
People
- B. Avi-itzhak
- I. Adiri
Organizations
- Technion – Israel Institute of Technology