On an M/G/1 quorum queueing system under T-policy

Abstract

We study in this paper an M/G/1 quorum queueing system under T-policy. First, we consider the system size stochastic process embedded at departure epoch times and show that it is an ergodic Markov chain. Then, we consider the system size stochastic process at arbitrary instants of time and show that it is an ergodic semi-regenerative process. We derive the steady-state distribution for both processes. Various system characteristics of related processes (idle and busy periods) are also obtained and special cases are discussed.

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 — 28 citations exist upstream.

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