Broadcast in bijective connection networks with the restricted faulty node set

In the interconnection networks, broadcast is an important communication pattern. In this paper, we introduce a new fault-free broadcast algorithm for the bijective connection networks with restricted faulty node set. We then prove that under the condition that each node of an n-dimensional bijective connection network X_n has at least one fault-free neighbor, all the fault-free nodes will be broadcasted within n + [log (|F| + 1)] + 3 steps from any fault-free node. Finally, we simulate the algorithm on randomly generated bijective connection networks with randomly faulty node set to estimate the real performance.