Approximation of the Overflow Process from a G/M/N/K Queueing System

Behnam Pourbabai

10 citations0/0 files storedManagement Science

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

The overflow process from a G/M/N/K queueing system with a stationary counting arrival process, Markovian service times, N parallel homogeneous servers, and K waiting spaces, is asymptotically approximated by a two parameter method. Numerical results are presented and approximation outcomes are compared against those from a simulation study.

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

References

1982Approximating a Point Process by a Renewal Process, I: Two Basic Methods 1979Introduction to Simulation and SLAM 1963Stochastic Service Systems.1973The Interrupted Poisson Process As An Overflow Process 1976Queueing output processes 1978Renewal processes of phase type 1986Server utilization factors in queueing loss systems with ordered entry and heterogeneous servers 1981Distribution of the Interoverflow Time for the GI / G /1 Loss System

Cited by

1990Tandem behavior of a telecommunication system with finite buffers and repeated calls

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.