The hyper-deBruijn networks: scalable versatile architecture

Both Hypercube and deBruijn networks possess desirable properties. It should be understood, though, that some of the attractive features of one are not found in the other. The architecture proposed in this paper is a combination of these architectures, providing some of the desirable properties of both the networks such as admitting many computationally important networks, flexibility in terms of connections per node as well as level of fault-tolerance. Also the network allows a simple VLSI layout, scalability as well as decomposability. Thus, these networks can be a potential candidate for VLSI multiprocessor networks. The proposed network possesses logarithmic diameter, optimal connectivity, and simple routing algorithms amendable to networks with faults. Importantly, in addition to being pancyclic, these hyper-deBruijn networks admit most computationally important subnetworks including rings, multidimensional meshes, complete binary trees, and mesh of trees with perfect dilation. Techniques for optimal one-to-all (OTA) broadcasting in these networks are presented. As an intermediate result, this technique provides the fastest OTA broadcasting in binary deBruijn networks as well. The recent renewed interest in binary deBruijn networks makes this later result valuable