Abstract
This paper analyzes a discrete-time single-server retrial queue with two classes of customers, where the blocked class-1 customers leave the system forever whereas the blocked class-2 customers leave the service area and enter the orbit and try their luck again some time later. Each class-2 customer after service either immediately returns to the orbit for another service with probability θ or leaves the system forever with probability θ̄=1−θ, where 0≤θ<1. First, we study the Markov chain underlying the queueing system. The generating functions of the number of customers in the orbit and in the system are obtained along with the marginal distributions of the orbit size when the server is idle, busy with class-1 or busy with class-2. Some performance measures of the system in steady-state are also derived. Second, we investigate the relationship between our discrete-time system and its continuous counterpart. Finally, some numerical examples show the influence of the parameters on some crucial performance characteristics of 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.
