Abstract
In the present paper, a single server retrial queue with impatient customers is studied. The primary arrivals and repeating calls follow the Poisson distribution. The service time is exponentially distributed. Explicit time-dependent probabilities of an exact number of arrivals and departures from the orbit are obtained by solving the differential-difference equations recursively. Steady state solution of the number of busy servers is obtained. The numerical results are graphically displayed to illustrate the effect of arrival rate, retrial rate and service rate on different probabilities against time. Some special cases of interest are also deduced.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: MATHEMATICAL JOURNAL OF INTERDISCIPLINARY SCIENCES
Disclaimer: 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.