Link-fault-tolerant routing in Folded Hypercube using Directed Routing Probability

Today, with the rapid development of information technology in all areas of life, a large amount of information is created every second. In recent years, many network topologies have been proposed to find the most effective communication method. The folded hypercube is one of those networks, which is a variant of the hypercube, which is one of the most popular topologies for interconnection networks. In this paper, we propose a link-fault-tolerant routing algorithm in folded hypercube based on directed routing probabilities. The probabilities represent the routing ability of a vertex for an arbitrary vertex at a specific distance. Each vertex delivers message to one of its neighbor vertices by considering directed routing probabilities.