Abstract
This paper treats an M/M/1 retrial queue with constant retrial times. If the server is busy at the arrival epoch, the arriving customer decides to join the retrial orbit with probability q or balk with probability 1-q. Only the customer at the head of the orbit is permitted to access the server. Upon retrial, the customer immediately receives his service if the server is idle; otherwise, he may enter the orbit again or leave the system because of impatience. First, we give the performance analysis for this retrial queue and give some important performance indices. Second, based on a natural reward-cost structure, we analyze the Nash equilibrium customers’ joining strategies and give some numerical examples.
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.
