Efficient Implementation of Symmetric Multistage Repackable Networks

We revisited the problem of efficient implementation of large scale switching systems using repackable networks, which offer performance approaching that of strict sense nonblocking networks. In particular, we study repackable networks with more than three stages. Our method uses bypass path(s) for designing the repackable network to maintain path continuity while at repacking. This is essential if networks are not to be limited to time-slatted operations. We investigate the minimum number of bypass links required for different network sizes. The required minimum number of bypass links for a network depends on the number of links forming a rearrangement chain. This paper shows minimum number of links required to complement a repackable and thereby demonstrate its attractive scaling properties. It also proposes some future applications where these network can be applicable.