Abstract
This study mainly concerned with the K-capacity queueing system with recurrent input and two heterogeneous servers. Interarrival times are independent and have an arbitrary distribution. There are two servers and server k has an exponential distribution with parameter \(\mu _k\). Arriving customers choose server from the empty servers with equal probability. At an arrival time the customer joins the queue when both servers are busy. In addition an arrival leaves without having service when the system capacity is achieved. The defined system is represented by semi-Markov process and embedded Markov chain is obtained. Steady-state probabilities are found and loss probability is calculated by analyzing stream of overflows. Moreover loss probabilities are computed numerically for the queueing systems where the interarrival times are assumed as exponential, Erlang and deterministic distribution.
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 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.
