Analytical results for the error free spiral computer network topology
T.L. Mitchell, A.A. Nilsson · 2003
Spiral is an easily expandable, high fault-tolerant self-routing computer network topology. The architecture is built around modules of four fully connected computer nodes each, connected by top and bottom spirals. Six theorems (without proof) and analytical results based on those theorems are reported. The theorems concern disjoint paths, maximum path length, traffic between source-destination pairs, expected average link traffic, total one-way link traffic, and mean path length.>