This paper focuses on an M/M/s queue with multiple working vacations such that the server works with different service rates rather than no service during the vacation period. We show that this is a generalization of an M/M/1 queue with working vacations in the literature. Service times during vacation period, or during service period and vacation times are all exponentially distributed. We obt...

We consider a MAP-modulated fluid flow queueing model with multiple vacations. As soon as the fluid level reaches zero, the server leaves for repeated vacations of random length V until the server finds any fluid in the system. During the vacation period, fluid arrives from outside according to the MAP (Markovian Arrival Process) and the fluid level increases vertically at the arrival instance....

We consider the busy period in the GI/M/1 queue with multiple exponential vacations. We derive the transform of the joint distribution of the length of a busy period, the number of customers served during the busy period, and the residual interarrival time at the instant the busy period ends.

OBJECTIVE The objective of this study was to determine the risk for various causes of posttrial death associated with vacation frequency during the Multiple Risk Factor Intervention Trial (MRFIT). METHODS Middle-aged men at high risk for coronary heart disease (CHD) were recruited for the MRFIT. As part of the questionnaires administered during the first five annual visits, men were asked whe...

This article presents the analysis of a finite buffer M/M/1 queue with multiple and single working vacations. The arriving customers balk (that is do not join the queue) with a probability and renege (that is leave the queue after joining) according to exponential distribution. The inter-arrival times, service times during a regular service period, service times during a vacation period and vac...

We study an M/G/1 processor sharing queue with multiple vacations. The server only takes a vacation when the system has become empty. If he finds the system still empty upon return, he takes another vacation, and so on. Successive vacations are identically distributed, with a general distribution. When the service requirements are exponentially distributed we determine the sojourn time distribu...

This paper presents an analysis of a cyclic-service tandem queue (M/C/l type queue) with exhaustive services and multiple server vacations, in which a single server takes repeated vacations until it finds at least one message in the first queue after emptying the queueing system. It is assumed that the vacation time is generally distributed, and switch-over times are zero. This paper analyzes q...