1 Summary: In this paper, we study the following node-to-node and node-to-set routing problems in r-dimensional torus T r n with r 2 and n 4 nodes in each dimension: given at most 2r 0 1 faulty nodes and non-faulty nodes s and t in T r n , nd a fault-free path s ! t; and given at most 2r 0 k faulty nodes and non-faulty nodes s and t 1 ;. .. ; t k in T r n , nd k fault-free node-disjoint paths s...

The main goal is to find multiple node-disjoint paths that meet the multi-objective optimization problem in terms of energy consumption minimization and network lifetime improvement. Due battery-dependent nodes mobile ad hoc networks, performance will degrade. Hence, it necessary choose optimal between source destination for data transfer. Additionally, improves Quality Service (QoS) wireless n...

A burnt pancake graph is a variant of Cayley graphs and its topology is suitable for massively parallel systems. However, for a burnt pancake graph, there is much room for further research. Hence, in this study, we focus on n-burnt pancake graphs and propose an algorithm to obtain n disjoint paths from a source node to n destination nodes in polynomial order time of n, n being the degree of the...

An n-dimensional hierarchical cubic network (denoted by HCN(n)) contains 2 n n-dimensional hypercubes. The diameter of the HCN(n), which is equal to n+(n+1)/3+1, is about two-thirds the diameter of a comparable hypercube, although it uses about half as many links per node. In this paper, a maximal number of node-disjoint paths are constructed between every two distinct nodes of the HCN(n). Th...

Hypercube-based interconnection networks are one of the most popular network topologies when dealing with parallel systems. In a hypercube of dimension n, node addresses are made of n bits, and two nodes are adjacent if and only if their Hamming distance is equal to 1. In this paper we introduce a fault-tolerant hypercube routing algorithm which constructs n minus the number of faulty nodes f d...

Multipath on-demand routing protocols for mobile ad hoc networks try to reduce control overhead and end-to-end delay by computing multiple paths with a single route discovery process. We propose Graph-based Multipath Routing (GMR), a novel multipath routing protocol that generate the network topology graph to compute all link disjoint paths in the network. The destination node computes link dis...