Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-17T15:20:49.996Z Has data issue: false hasContentIssue false

Sojourn times in vacation and polling systems with Bernoulli feedback

Published online by Cambridge University Press:  14 July 2016

T. Takine*
Affiliation:
Kyoto University
H. Takagi*
Affiliation:
IBM Research Division
T. Hasegawa*
Affiliation:
Kyoto University
*
∗Postal address: Department of Applied Mathematics and Physics, Faculty of Engineering, Kyoto University, Kyoto 606, Japan.
∗∗Postal address: IBM Tokyo Research Laboratory, 5–9, Sanbancho, Chiyodaku, Tokyo 102, Japan.
∗Postal address: Department of Applied Mathematics and Physics, Faculty of Engineering, Kyoto University, Kyoto 606, Japan.

Abstract

We study sojourn times in M/G/1 multiple vacation systems and multiqueue cyclic-service (polling) systems with instantaneous Bernoulli feedback. Three service disciplines, exhaustive, gated, and 1-limited, are considered for both M/G/1 vacation and polling systems. The Laplace-Stieltjes transforms of the sojourn time distributions in the three vacation systems are derived. For polling systems, we provide explicit expressions for the mean sojourn times in symmetric cases. Furthermore a pseudo-conservation law with respect to the mean sojourn times is derived for a polling system with a mixture of the three service disciplines.

Information

Type
Research Papers
Copyright
Copyright © Applied Probability Trust 1991 

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