Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated

A unified algorithm for computing the stationary queue length distributions inM(k)/G/1/N and GI/M(k)/1/N queues

13 references·2 citing·35 second hop

FromToDepth

this work references cited by second hop

References

1977Fundamentals of Queueing Theory.2,930 cited
1953Stochastic Processes Occurring in the Theory of Queues and their Analysis by the Method of the Imbedded Markov Chain1,082 cited
1963Introduction to the Theory of Queues.961 cited
1985Fundamentals of queueing theory (2nd ed.).603 cited
1999Fundamentals of Queueing Theory584 cited
1963Introduction to the Theory of Queues420 cited
1962Queues Subject to Service Interruption104 cited
1981The System Point Method in Exponential Queues: A Level Crossing Approach70 cited
1966The Ergodic Queue Length Distribution for Queueing Systems with Finite Capacity68 cited
1971On a Single-Server Finite Queuing Model with State-Dependent Arrival and Service Processes43 cited
1975TheG/M/mqueue with finite waiting room31 cited
1992A unified approach to gi/m(n)/l/k and m(n)/g/1/k queues via finite quasi-birth-death processes24 cited
1991On exact computational analysis of distributions of numbers in systems for M/G/1/N + 1 and GI/M/1/N + 1 queues using roots19 cited

Cited by

2006Analysis and Computational Algorithm for Queues with State-Dependent Vacations I: G/M(n)/1/K17 cited
1998

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work

On the analysis of single server finite queue with state dependent arrival and service processes: $M(n)/G(n)/1/K$

16 cited