Abstract
We analyze a single-server retrial queueing system with finite buffer, Poisson arrivals, and general distribution of service time. If an arriving customer finds the queue completely occupied he joins a retrial group (or orbit) in order to seek service again after an exponentially distributed amount of time. We obtain a stationary distribution of the primary queue size, a recurrent algorithm for the factorial moments of the number of retrial customers and an expression for the expected number of customers in the system.
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.
