One-to-one and One-to-many node-disjoint Routing Algorithms for WK-Recursive networks

Abstract

Recently, routing with disjoint paths has received much attention to provide more performance and fault tolerance. On the other hand, WK-recursive mesh network has been studied extensively due to its favorable properties such as high degree of stability and resilience. The connectivity of a network is an important measure of fault tolerance, while the diameter represents the worst-case transmission delay between two arbitrary nodes. In this paper, we propose one-to-one and one-to-many disjoint routings mechanisms for WK-recursive mesh networks to further exhibit the performance and fault tolerance of such networks.