A total of N customers move about among r servers in the following manner.

When a customer is served by server i, he then goes over to server j, j = i, with probability 1/(r − 1). If the server he goes to is free, then the customer enters service; otherwise he joins the queue. The service times are all independent, with