Consider a queueing system, which has one server. To serve a customer, a server requires a random length of time, distributed as Exp$(\backslash$mu $).$ Potential customers arrive at the system according to PP$(\backslash$lambda $).$ If the arrival finds n customers already in the system, then the arrival will enter the system with probability $1/$n$2.$ When n $=0,$ the entering probability is $1.$ Suppose the event that the arrival chooses to enter the system. The arrival will be immediately served if there is an idle server, that is$,$ the arrival finds n $=0$ customers already in the system. Else, if the arrival finds n $>=1$ custo