LAUSR

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 or balk with probability . 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.