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

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.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 127 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.