Source Misrouting in King Topologies

King networks were proposed as higher degree alternatives to 2D tori and meshes. These networks offer improved throughput and latency with minimum distance routing in benign traffic patterns. As a solution to performance problems in adverse traffic pattern of the minimal routing, this article presents a misrouting solution. It uses two parameters to control the generation of routing tables. Using the paths on these tables, packets reach their destination nodes through non-minimal paths, without deadlock, live lock or starvation. Optimal values for the parameters are empirically determined. This routing strategy slightly improves the throughput while hardly increasing the base latency and extending the linear behaviour of the network. Experimental results confirm the good properties of this algorithm compared to minimal routing and Valiant algorithms.