Routing algorithms on the bus-based hypercube network

Abstract

In this paper, we study the properties of the bus-based hypercube, denoted as Uðn; bÞ, which is a kind of multiple-bus networks (MBN). Uðn; bÞ consists of 2 n processors and 2 b buses, where 0 b n À 1, and each processor is connected to either d bþ2 2 e or d bþ1 2 e buses. We show that the diameter of Uðn; bÞ is d bþ1 2 e if b ! 2. We also present an algorithm to select the best neighbor processor via which we can obtain one shortest routing path. In Uðn; bÞ, we show that if there exist some faults, the fault diameter DF ðn; b; fÞ b þ 1, where f is the sum of bus faults and processor faults and 0 f d bÀ3 2 e. Furthermore, we also show that the busfault diameter DBðn; b; fÞ b b 2 c þ 3, where 0 f d bÀ1 2 e and f is the number of bus faults. These results improve significantly the previous result that DBðn; b; fÞ b þ 2f þ 1, where f is the number of bus faults.