Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-16T02:29:10.130Z Has data issue: false hasContentIssue false

Oscillating random walk models for GI/G/1 vacation systems with Bernoulli schedules

Published online by Cambridge University Press:  14 July 2016

J. Keilson*
Affiliation:
University of Rochester
L. D. Servi*
Affiliation:
GTE Laboratories
*
∗ Postal address: Graduate School of Management, University of Rochester, Rochester, NY 14627, USA.
∗∗ Postal address: GTE Laboratories Inc., 40 Sylvan Road, Waltham, MA 02254, USA.

Abstract

Processors handling multi-class traffic typically alternate between serving a particular class of traffic and performing other tasks, e.g., secondary service tasks or routine maintenance. The stochastic behavior of such systems is modeled by a newly introduced class of Bernoulli GI/G/1 vacation models. For this model, when a vacation is completed and customers are present, a customer is served. When a customer has just been served and other customers are present, the server accepts a customer with fixed probability p or commences a vacation of prespecified random duration with probability 1 – p. Whenever no customers are present, a vacation is taken. When p = 0 or p = 1 this schedule reduces to the previously introduced single service schedule and the exhaustive service schedule, respectively. An analysis of all three schedules on a state space incorporating server vacations is presented using simple methods in the complex plane. It is shown that the recent decomposition results for exhaustive service extend to the more general class of Bernoulli schedules.

Information

Type
Research Paper
Copyright
Copyright © Applied Probability Trust 1986 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable