Busy period for the first subsystem in a matched queueing network

We formulate the busy period for the first subsystem in the matched queueing network PH/M/c→∘PH/PH/1 as the first passage time of a Markov process and then present an approximate algorithm with uniform error for it. A numerical example is presented to illustrate the algorithm.