Abstract
We consider M/ / lqueueing system which is a queueing system with arrival rate follows a Poisson distribution, service rate follows an exponential distribution which is approximated by Coxian 2-phase distribution, service is performed in b-size, and the number of service facility is one. This paper aims to derive the properties of M/ / 1 queueing system when the system is in busy pea riod using latticea path combinatorics approach. We consider a special case which is called pure incomplete busy period (PIBP) Through this approach, the queue system is represented in the form of lattice path. Furthermore, we have determined the number of lattice paths and finally, the probability function in the queue system M/ / 1 in PIBP is derived.
Sign-in/Register to access full text options 
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
