Analysis of M/G/ 1 queueing model with state dependent arrival and vacation

Abstract

This investigation deals with single server queueing system wherein the arrival of the units follow Poisson process with varying arrival rates in different states and the service time of the units is arbitrary (general) distributed. The server may take a vacation of a fixed duration or may continue to be available in the system for next service. Using the probability argument, we construct the set of steady state equations by introducing the supplementary variable corresponding to elapsed service time. Then, we obtain the probability generating function of the units present in the system. Various performance indices, such as expected number of units in the queue and in the system, average waiting time, etc., are obtained explicitly. Some special cases are also deduced by setting the appropriate parameter values. The numerical illustrations are provided to carry out the sensitivity analysis in order to explore the effect of different parameters on the system performance measures.

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

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