In this paper, we give an algorithm for the nodeto-set disjoint paths problem in rotator graphs with its evaluation results. The algorithm is based on recursion and it is divided into cases according to the distribution of destination nodes in classes into which all the nodes in a rotator graph are categorized. The sum of the length of paths obtained and the time complexity of the algorithm are...

Mobile ad hoc networks (MANETs) are highly vulnerable to both link and node failures due to nodal mobility. The routing resilience against link and/or node failures needs to be enhanced to avoid the degradation of network performance. This can be achieved by multipath routing which uses multiple alternative paths to route the messages via multiple disjoint paths and result in increased bandwidt...

The n-dimensional hypercube network Qn is one of the most popular interconnection networks since it has simple structure and is easy to implement. The n-dimensional augmented cube AQn, an important variation of the hypercube, possesses several embedding properties that hypercubes and other variations do not possess. The advantages of AQn are that the diameter is only about half of the diameter ...

We study the problem of routing on disjoint paths in bounded treewidth graphs with both edge and node capacities. The input consists of a capacitated graph G and a collection of k source-destination pairsM = {(s1, t1), . . . , (sk, tk)}. The goal is to maximize the number of pairs that can be routed subject to the capacities in the graph. A routing of a subsetM′ of the pairs is a collection P o...

One way to improve the reliability of a network is through physical diversity, i.e., via routing of trafic between a given pair of nodes in the network over two or more physically-disjoint paths such that if a node or a physical link fails on one of the disjoint paths, not all of the trafic is lost. Alternatively, enough spare capacity may be allocated on the individual paths such that the lost...

Detecting communities plays a vital role in studying group level patterns of a social network and it can be helpful in developing several recommendation systems such as movie recommendation, book recommendation, friend recommendation and so on. Most of the community detection algorithms can detect disjoint communities only, but in the real time scenario, a node can be a member of more than one ...

Application of multipath routing techniques in mobile ad hoc networks has been explored earlier, as multipath routing may help to reduce end-to-end delay, perform load balancing and consequently improve throughput. However, it has also been shown that the success of multipath routing in ad hoc wireless network depends on network topology and channel characteristics can severely limit the gain o...

Recently, several fully distributed (localized) location-based routing protocols for a mobile ad hoc network were reported in literature. They are variations of directional (DIR), geographic distance (GEDIR) or progress-based (MFR) routing methods. In DIR methods, each node A (the source or intermediate node) transmits a message m to several neighbors whose direction is closest to the direction...

Efficient methods have been developed for constructing m node-disjoint paths from one source node to other m (not necessarily distinct) destination nodes in an n-dimensional hypercube so that not only is their total length minimized, but their maximal length is also minimized in the worst case, where m ≤ n. For general case, their maximal length is not greater than the minimum of n + 1 and the ...

In this paper, we propose an algorithm that solves the node-to-node disjoint paths problem in n-möbius cubes in polynomial-order time of n. We also give a proof of its correctness as well as the estimates of time complexity O(n) and the maximum path length O(n). We conducted a computer experiment for n = 4 to 31 to measure the average performance of our algorithm. The results show that the aver...