N log N dual shuffle-exchange network with error-correcting routing

The parallels between the design philosophies of switching and transmission systems are established, and it is argued that error-correcting routing in switching is analogous to error-correcting coding in transmission. Based on a novel error-correcting and self-routing algorithm, it is shown by analysis and simulation that the dual shuffle-exchange network can achieve the Shannon´s lower bound N log N on switch complexity with arbitrarily small packet-loss probability