Abstract
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 (MAP) 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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
R. Bellman, Introduction to Matrix Analysis (McGraw-Hill, New York, 1960).
H. Bruneel, Analysis of an infinite buffer system with random server interruption, Computers & Oper. Res. 11 (1994) 373–386.
G.L. Choudhury, D.M. Lucantoni and W. Whitt, Multi-dimensional transform inversion with applications to the transient M/G/1 queue, Ann. Appl. Probab. 4 (1994) 719–740.
G.L. Choudhury, D.M. Lucantoni and W. Whitt, Numerical solution of piecewise-stationary Mt/Gt1 queues, to appear in Oper. Res. (1997).
B. Doshi, Queueing systems with vacations - A survey, Queueing Systems 1 (1986) 29–66.
A. Federgruen and L. Green, Queueing systems with service interruptions, Oper. Res. 34 (1986) 752–768.
A. Federgruen and L. Green, Queueing systems with service interruptions II, Naval Res. Logist. Quart. 35 (1988) 345–358.
D.M. Lucantoni, K.S. Meier-Hellstern and M.F. Neuts, A single-server queue with server vacations and a class of non-renewal arrival processes, Adv. Appl. Probab. 22 (1990) 676–705.
R. Izmailov, D.-S. Lee and B. Sengupta, Design and analysis of a congestion-free overlay on a conventional high-speed network, IEEE Globecom (1996).
N.K. Jaiswal, Priority Queues (Academic Press, 1969).
D.-S. Lee, Analysis of a single server queue with semi-Markovian service interruptions, submitted for publication (1995).
D.M. Lucantoni, New results on the single-server queue with a batch Markovian arrival process, Stoch. Mod. 7 (1991) 1–48.
M.F. Neuts, Structured Stochastic Matrices of the M/G/1 Type and Their Applications (Marcel Dekker, New York, 1989).
B. Sengupta, A queue with service interruptions in an alternating random environment, Oper. Res. 38 (1990) 308–318.
T. Takine and Y. Takahashi, On the relationship between queue lengths at a random instant and at a departure in the stationary queue with BMAP arrivals, to appear in Stoch. Mod. 14 (1998).
T. Takine and T. Hasegawa, The workload in the MAP/G/1 queue with state-dependent services: Its application to a queue with preemptive resume priority, Stoch. Mod. 10 (1994) 183–204.
T. Takine and B. Sengupta, A single server queue with service interruptions, NEC USA Technical Report No. 95-C050–4–5007–5, Princeton, NJ (1995).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Takine, T., Sengupta, B. A single server queue with service interruptions. Queueing Systems 26, 285–300 (1997). https://doi.org/10.1023/A:1019189326131
Issue Date:
DOI: https://doi.org/10.1023/A:1019189326131