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

The following multiserver queueing model is considered. There is no waiting room (i.e., loss system) and M heterogeneous sources generate messages for B identical servers. Upon an arrival a job requests concurrent service from several servers. If there are not enough available servers upon an arrival, the job is lost. The thinking time for a source and the holding times are assumed to be of a phase distribution type. For such a model, the paper provides a simple proof of a product-form result for the steady-state distribution, as well as an insensitive result. In addition, an arrival theorem is considered. It is proved that the stationary distribution at the arrival epochs is equal to the stationary distribution at arbitrary epochs for a system with one source less. As an immediate consequence, the blocking probability of a source is computed, and turns out to be insensitive, too.