Source misrouting in King topologies E. Stafford, C. Martinez, J. L. Bosque, F. Vallejo, C. Camarero, B. Perez and R. Beivide August 2014 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 prob- lems in adverse traffic pattern of the minimal routing, this article presents a missrouting solution. It uses two parameters to control the generation of rout- ing tables. Using the paths on these tables, packets reach their destination nodes through non-minimal paths, without deadlock, livelock 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. 1 Introduction Interconnection networks are becoming fundamental part of any modern com- puter. Their design heavily conditions the performance of the computers built around them. Therefore they receive constant attention in the literature[?]. King networks were proposed as a compromise between high-radix indirect networks and low-radix direct networks. They are eight-degree evolutions of well known two-dimensional networks, meshes and tori. Previous studies re- vealed their tantalizing topological properties, such as low diameter, average distance and high bisection bandwidth[?]. Other interesting properties include straightforward partitioning and resource placement. There is a folding scheme to avoid scalability problems with wrap-around links. And also, their suitability for fault tolerant applications was studied in [?]. Although several minimal routing algorithms were proposed with different degree of success, none seemed able to exploit the full potential of king networks. With uneven traffic distributions, the apparition of hotspots caused partial con- gestion of the network while leaving areas unused, limiting its performance. This paper proposes a misrouting scheme for king networks, denoted Kingǫδ, that is based on source routing. Thus, the capability of the packets to diverge from the minimum path is set at injection time. This will allow packets to flow 1