Efficient routing algorithms for folded-cube networks

We consider the partial multinode broadcast, the total exchange, and several other prototype communication tasks in a folded-cube network of processors. In the partial multinode broadcast in a N-processor network, each one of M arbitrary nodes (M⩽N) broadcasts a packet to all the remaining N-1 nodes. In the total exchange task each processor sends a separate (personalized) packet to every other processor. We propose algorithms for the folded-cube topology that execute these tasks in optimal or near-optimal time. We also present an efficient scheme for the dynamic version of the broadcasting problem, where broadcast requests are generated at each node of the folded-cube at random times. The dynamic broadcasting scheme has asymptotically optimal stability and average delay properties