Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-15T17:11:56.800Z Has data issue: false hasContentIssue false

A note on stochastic decomposition in a GI/G/1 queue with vacations or set-up times

Published online by Cambridge University Press:  14 July 2016

Bharat T. Doshi*
Affiliation:
AT&T Bell Laboratories
*
∗ Postal address: AT&T Bell Laboratories, Holmdel, H04K428, NJ 07733, USA.

Abstract

In this note we prove some stochastic decomposition results for variations of the GI/G/1 queue. Our main model is a GI/G/1 queue in which the server, when it becomes idle, goes on a vacation for a random length of time. On return from vacation, if it finds customers waiting, then it starts serving the first customer in the queue. Otherwise it takes another vacation and so on. Under fairly general conditions the waiting time of an arbitrary customer, in steady state, is distributed as the sum of two independent random variables: one corresponding to the waiting time without vacations and the other to the stationary forward recurrence time of the vacation. This extends the decomposition result of Gelenbe and Iasnogorodski [5]. We use sample path arguments, which are also used to prove stochastic decomposition in a GI/G/1 queue with set-up time.

Information

Type
Research Papers
Copyright
Copyright © Applied Probability Trust 1985 

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