Consider a two-server parallel queueing system where customers arrive according to a Poisson process with rate λ, and where the service times are exponential with rate μ. Moreover, suppose that arrivals finding both servers busy immediately depart without receiving service (such a customer is said to be lost), whereas those finding at least one free server immediately enter service and then depart when their service is completed. a) If both servers are presently busy, find the expected time until the next customer enters the system.
b) Starting empty, find the expected time until both servers are busy.
c) Find the expected time between two successive lost customers.
The link to the solution is http://www. cramster. com/solution/solution/908010
[source: "Introduction to Probability Models (10th ed) by Ross" Ch.5 question 47 part c.]
Can someone please exaplin the Cramster solution to part c in more detail? Why do we get E(T_1) in step 8? Why is it E(T_1), not E(T_0)??