Single-server queues in which the server takes vacations arise naturally as models for a wide range of computer-, communication- and production systems. In almost all studies on vacation models, the vacation lengths are assumed to be independent of the arrival, service, workload and queue length processes. In the present study we allow the length of a vacation to depend on the length of the previous active period, viz., the period since the previous vacation. Under rather general assumptions regarding the offered work during active periods and vacations, we determine the steady-state workload distribution. We conclude by discussing several special cases including polling models, and relate our findings to results obtained earlier.
Lévy process, storage process, busy and idle periods, queues with server vacations
Queueing theory (msc 60K25)
Logistics (theme 3), Energy (theme 4)
CWI. Probability, Networks and Algorithms [PNA]
Part of this work was done while the third author visited EURANDOM and CWI as a Stieltjes visiting professor.

Boxma, O.J, Mandjes, M.R.H, & Kella, O. (2006). On a queueing model with service interruptions. CWI. Probability, Networks and Algorithms [PNA]. CWI.