Interconnection networks with efficient custom routing, exploiting small-world effect

We design a new interconnection network topology and a custom routing algorithm, which targets solving new challenging issues posed by recent advanced studies in the areas of massively parallel computing and large-scale data centers. We follow the design principles of Distributed Shortcut Networks (DSN) [1], which construct non-random topologies with the creation of long-range Shortcuts inspired by observations in small-world networks. As a result, our new DSN-α networks performs significantly better than the basic DSN in term of communication latency while provide an surprisingly load balance which helps the network become robust against burst of traffic demand while topology-agnostic deadlock-free routing (e.g. the up*/down*) suffers a lot.