Customers request service from a group of m servers according to a Poisson process with mean inter-arrival timeλ1. Suppose the service times of the servers are mutually independent and exponentially distributed with the same mean μ-1.
At time zero, you find all m servers occupied and no customers waiting. Find the probability that exactly k additional customers request service from the system before the first completion of a service request.