Ergodicity Properties of Queueing Networks with Group Arrivals and Group Service

We consider queueing networks with group arrivals and group service under conditions that make it impossible to obtain explicit expressions for the stationary probabilities. The method of Lyapounov functions is used for determination of the ergodicity criterion. Also exponentially fast convergence to the stationary distribution is proved.