The matched queueing network \(PH/M/c\to\circ PH/PH/1\) (Q2368082)

The authors consider a general matched queueing network \(PH/M/c\to\circ PH/PH/1\). Each departing customer (type-1) of the first subsystem is matched with \(r\) (\(r\geq 1\)) customers (type-2) of the second subsystem and they are served as a batch. The first subsystem is of infinite capacity whereas the second subsystem has different finite capacities for type-1 and type-2 customers. The authors derive the stationary state probabilities, the distribution of the virtual waiting times in the two subsystems, and the distribution of the total virtual waiting time.