On a queuing model with service interruptions

  • Authors:
  • Onno Boxma;Michel Mandjes;Offer Kella

  • Affiliations:
  • Eurandom and department of mathematics and computer science, eindhoven university of technology, 5600 mb eindhoven, the netherlands e-mail: boxma@win.tue.nl;Korteweg-de vries institute for mathematics, the university of amsterdam, 1018 tv amsterdam, the netherlands and cwi, 1090 gb amsterdam, the netherlands e-mail: mmandjes@science.uva.nl;Department of statistics, the hebrew university of jerusalem, mount scopus, jerusalem 91905, israel e-mail: offer.kella@huji.ac.il

  • Venue:
  • Probability in the Engineering and Informational Sciences
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

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, both for single and multiple vacations. We conclude by discussing several special cases, including polling models, and relate our findings to results obtained earlier.