Article ID: | iaor20002514 |
Country: | United States |
Volume: | 26 |
Issue: | 3/4 |
Start Page Number: | 285 |
End Page Number: | 300 |
Publication Date: | Nov 1997 |
Journal: | Queueing Systems |
Authors: | Sengupta B., Takine T. |
In this paper we characterize the queue-length distribution as well as the waiting time distribution of a single-server queue which is subject to service interruptions. Such queues arise naturally in computer and communication problems in which customers belong to different classes and share a common server under some complicated service discipline. In such queues, the viewpoint of a given class of customers is that the server is not available for providing service some of the time, because it is busy serving customers from a different class. A natural special case of these queues is the class of preemptive priority queues. In this paper, we consider arrivals according the Markovian Arrival Process and the server is not available for service at certain times. The service times are assumed to have a general distribution. We provide numerical examples to show that our methods are computationally feasible.