Equivalence of the 1-rate model to the classical model on strictly nonblocking switching networks

Abstract

In the 1-rate(f) network, each link can carry up to f messages for some integer f. The classical model is the special case when f = 1. We show that a network is strictly nonblocking under the 1-rate(f) model if and only if it is strictly nonblocking under the classical model.