SPORT: A Shortest Path Routing Algorithm for Triplet-Based Hierarchical Interconnection Network
Zuo Qi · Transactions of Beijing Institute of Technology · 2013
Existing routing algorithm for triplet-based hierarchical interconnection network(THIN) could not be applied to non-balanced THIN.To solve this problem,this paper proposes a new shortest path routing algorithm(SPORT).It computes the shortest path at the source node and constructs the output port lists,which can apply to both balanced THIN and non-balanced THIN.The platform of experiment was established by utilizing Noxim simulator.Simulation results show that the traffic latency of SPORT is lower than existing routing algorithms such as DDRA and Min-DDRA ones.Furthermore,when the localization is considered to compare the latency of THIN with 2D-mesh,results show that,for those networks with high-localized workloads,the performance of THIN is superior to that of 2D-mesh.