Blocking of finite source inputs which require simultaneous servers with general think and holding times

This paper studies a multi-server loss system with a finite source input of sources that require simultaneous serving by several servers. The stationary distribution of busy sources is extended to general think and holding times and proven to be of an insensitive product form. The proof is simple and self-contained. Moreover, the arrival theorem is shown to hold and used to compute blocking probabilities.