Abstract
This paper discusses a two-state multiserver retrial queueing system with balking. Entering customer is admitted to join any idle server and receive his service immediately. On the other hand, if all the servers are busy, then the entering customer joins the orbit or balks from the system. Arrival of primary calls and repetition of repeating calls both follow Poisson distribution. Service times of each server follow exponential distribution. By solving the difference-differential equations recursively, we obtained transient probabilities of exact number of arrivals and exact number of departures at when all some or none servers are busy. Results for particular cases are also discussed.
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.
