On Stochastic Decomposition in M/G/1 Type Queues with Generalized Server Vacations

Jeyaveerasingam George Shanthikumar

130 citations0/0 files storedOperations Research

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Advanced Queuing Theory Analysis Probability and Statistical Research Age of Information Optimization

Abstract

Recently, S. W. Fuhrmann and R. B. Cooper showed that the stationary distribution of the number of customers in an M/G/1 queueing system with generalized server vacation is a convolution of the distribution functions of two independent positive random variables. One of these is the stationary distribution of the number of customers in an ordinary M/G/1 queueing system without server vacations. They use an elegant, intuitive approach to establish this result. In this paper, a mechanistic (analytic) proof of this result is given for systems more general than that discussed in Fuhrmann and Cooper. Such systems allow customer arrivals in bulk and some variations with reneging, balking, and in arrival rate that is dependent on system state.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

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

Citations in this library

Citation map →

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

References

1986Queueing systems with vacations ? A survey 1985Stochastic Decompositions in the M/G/1 Queue with Generalized Vacations 1970Queues Served in Cyclic Order: Waiting Times

Cited by

1992A poisson input queue under N-policy and with a general start up time 2004Stochastic Decomposition in M/M/∞ Queues with Markov Modulated Service Rates 2012An M/G/1 queue with single working vacation and vacation interruption under Bernoulli schedule 2009Analysis of the M/G/1 queue with exponentially working vacations—a matrix analytic approach 2004A single-server retrial queue with general retrial times and Bernoulli schedule 1991Queues with Server Vacations and Levy Processes with Secondary Jump Input 1990A single-server queue with vacations and gated time-limited service 1989Blocking Probability for M/G/1 Vacation Systems with Occupancy Level Dependent Schedules

Explore the map →

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

Imported from OpenAlex (CC0) — nothing here is generated.