International Journal of Networking and Computing
Online ISSN : 2185-2847
Print ISSN : 2185-2839
ISSN-L : 2185-2839
Special Issue on the Eighth International Symposium on Computing and Networking
Link Fault Tolerant Routing Algorithms in Mirrored K-Ary N-Tree Interconnection Networks
Yaodong WangYamin Li
Author information
JOURNAL OPEN ACCESS

2021 Volume 11 Issue 2 Pages 140-153

Details
Abstract

This paper investigates the fault tolerance of Mirrored k-Ary n-Tree (MiKANT) networks with link faulty. The MiKANT network is a variant of the traditional k-ary n-tree (Fat-tree) and Clos networks. It doubles the number of compute nodes of the fat-tree by adding a few switches and links and has a shorter average distance to reduce the packet latency. As the scale of MiKANT becomes larger, the probability of link faulty becomes higher. In order to improve the successful routing ratio of MiKANT, we give four link fault tolerant routing algorithms for MiKANT and evaluate their performance through simulations. In addition, the performance of the combined algorithms is also evaluated.

Content from these authors
© 2021 International Journal of Networking and Computing
Previous article Next article
feedback
Top