Abstract
In the paper, a finite-capacity queueing model is considered in which jobs arrive according to a Poisson process and are being served according to hyper-exponential service times. A system of equations for the time-sensitive queue-size distribution is established by applying the paradigm of embedded Markov chain and total probability law. The solution of the corresponding system written for Laplace transforms is obtained via an algebraic approach in a compact form. Numerical illustration results are attached as well.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
