Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

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

Combinatorial approach to Markovian queueing models

5 references·6 citing·28 second hop

FromToDepth

this work references cited by second hop

References

1963Elements of Queueing Theory: With Applications.223 cited
1962Elements of Queueing Theory with Applications138 cited
1956An Elementary Method of Solution of the Queueing Problem with a Single Server and Constant Parameters73 cited
1993Lattice path approach to transient solution of M/M/1 with (0,k) control policy19 cited
1964The Distribution of the Maximum Length of a Poisson Queue During a Busy Period18 cited

Cited by

2002Lattice paths combinatorics applied to transient queue length distribution of C2/M/1 queues and busy period analysis of bulk queues C2b/M/112 cited
2005Transient Probabilities for Queues with Applications to Hospital Waiting List Management11 cited
2002Distribution of number served during a busy period of GI/M/1/N queues-lattice path approach11 cited
2006Lattice path approach for busy period density of M/G/1 queues using C3 Coxian distribution10 cited
1995Lattice path counting andM/M/c queueing systems10 cited
2002Lattice path approach to transient analysis of M/G/1/N non-Markovian queues using Cox distributions9 cited

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