In this paper we devise an optimal deterministic algorithm for routing h-relations on-line on an N -input/output multibutterfly. The algorithm, which is obtained by generalizing the circuit-switching techniques of [3], routes any h-relation with messages of X bits in O h(X + logN ) steps in the bit model, and in O hdX= logNe + logN communication steps in the word model. Unlike other recently de...