Contention resolution in the loop-augmented ShuffleNet multihop lightwave network

In ShuffleNet multihop lightwave networks with hot-potato routing, when two or more packets simultaneously arrive at a given node and contend for the same outgoing link to achieve minimum distance routing, then all but one will be misrouted to links which produce longer paths to the destination. In this paper, we propose a new topology for multihop lightwave networks, called loop-augmented ShuffleNet, which can shorten the alternate path traveled by misrouted packets. The loop-augmented ShuffleNet is constructed with slight change in the ShuffleNet connectivity while retaining the simple addressing and self-routing properties. Compared with ShuffleNet, the network performance is greatly improved by reducing the expected number of hops using this new network design.