Technical Note—A Note on the Busy Period of an M/G/1 Finite Queue

Louis W. Miller

41 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 Probability and Risk Models

Abstract

Recursive formulas for computing the Laplace-Stieltjes transform and the mean of the distribution of the lengths of busy periods for the M/G/1 finite queue are derived by a simple method that avoids simultaneous equations.

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

Cited by

1998On a batch arrival Poisson queue with a random setup time and vacation period 2007Performance Modelling and Analysis of the Sleep-Mode in IEEE802.16e WMAN 1992A unified approach to gi/m(n)/l/k and m(n)/g/1/k queues via finite quasi-birth-death processes

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