Tandem behaviour of a finite-capacity G/M/1 queueing system with instantaneous Bernoulli feedback: an algorithm
From MaRDI portal
Publication:4763825
DOI10.1080/00207729408949352zbMath0819.90034OpenAlexW1997962238MaRDI QIDQ4763825
Publication date: 22 May 1995
Published in: International Journal of Systems Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207729408949352
first-come-first-served queueing disciplinetandem behaviourBernoulli feedback mechanismfinite-capacity G/M/1 queueing system
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal selection of buffers in a tandem finite capacity G/M/1 queueing system
- Queueing Networks: A Survey of Their Random Processes
- Approximating a Point Process by a Renewal Process, I: Two Basic Methods
- Characterising the Finite Capacity GI/M/1 Queue with Renewal Output
- Queueing output processes
- Approximate Analysis of General Queuing Networks by Decomposition
This page was built for publication: Tandem behaviour of a finite-capacity G/M/1 queueing system with instantaneous Bernoulli feedback: an algorithm