A new multiprocessor network, Shuffle-Bruijn, is proposed in this thesis. The Shuffle-Bruijn network is a synthesis of k-shuffle and de Bruijn network. This network has a fixed degree and smaller diameter than that of the hypercube. This network has a simple and good routing algorithm and good fault-tolerant properties. When one node or link is failed in this network, we can detour with zero or two additional nodes. The Shuffle-Bruijn network embeds many multiprocessor networks. This network can be partitioned or extended easily. But this network is not vertex-symmetric.
