Abstract
It has been demonstrated by Takacs that combinatorial methods can be successfully applied to derive certain probability distributions in queueing processes. Mohanty further illustrated the usefulness of combinatorial techniques and determined the stochastic law of the busy period in two queueing systems particularly involving batches. This paper describes an analysis of a simple queueing process based on the number of minimal lattice paths, which is counted in terms of the Catalan number as the special case. The proposed procedure is comparatively convenient and practical.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
