k-ary n-cube网络中跨区域适应性路由算法
摘要
A new quadrant crossing routing (QCR) algorithm for k-ary n-cube networks is proposed, which is load balanced, deadlock-free and livelock-free. According to the source and destination node of each packet, the network is divided into several quadrants with various weights. QCR sets quadrant crossing rule and allows packets to cross quadrants based on network state, which makes traffic distribution more balanced. Network state is determined by the time interval between the last two requests to the same output. Finally, performance of the proposed routing algorithm is evaluated by OPNET under various traffic modes. The simulation results show that QCR outperforms the previously published routing algorithms, such as dimension order routing (DOR), Duato's algorithm and GAL.