A SIMPLE TRANSIENT ANALYSIS OF AN M/M/1/N QUEUE

Ahmed M. K. Tarabia

19 citations0/0 files stored

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

SUMMARY. A simple series form is obtained for the transient state probabilities of a single server Markovian queue with finite waiting space whence all particular cases concerning infinite waiting space and steady-state situations can be derived straight away. Also the coefficients in the series satisfy iterative recurrence relations which enable fast and accurate numerical computations. 1.

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

References

1963Introduction to the Theory of Queues.1982Some New Results for the M/M/1 Queue 1989A sample path analysis of theM/M/1 queue 1989Transient solution to the many-server Poisson queue: a simple approach 1982Transient Behaviour of an M/M/1/N queue 1993On a new formula for the transient state probabilities forM/M/1 queues and computational implications

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.