Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

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

Some explicit formulas and computational methods for infinite-server queues with phase-type arrivals

3 references·6 citing·36 second hop

FromToDepth

this work references cited by second hop

References

1963Introduction to the Theory of Queues.961 cited
1978Markov chains with applications in queueing theory, which have a matrix-geometric invariant probability vector154 cited
1978Renewal processes of phase type105 cited

Cited by

1984On the Overflow Process from a Finite Markovian Queue35 cited
1982The c — Server Queue with Constant Service Times and a Versatile Markovian Arrival Process29 cited
2011Production-inventory systems in stochastic environment and stochastic lead times28 cited
2002Analysis of an Infinite-Server Queue with Batch Markovian Arrival Streams23 cited
1996Calculating the loss probability in aBMAP/G/l/N+1 queue20 cited
2018A central limit theorem for a Markov-modulated infinite-server queue with batch Poisson arrivals and binomial catastrophes12 cited

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