A self-routing algorithm for the spiral computer network topology
T.L. Mitchell, A.A. Nilsson · 2003
The authors describe the routing algorithm for an easily expandable, highly fault tolerant, self-routing computer network topology. This computer connectivity scheme is named the spiral topology because the architecture is built around modules of four computer nodes each, connected by top and bottom spirals. Examples of how the routing algorithm operates are provided.>