Data communication and fault tolerance are important issues in multiprocessor systems. One way to achieve fault tolerant communication is by exploiting and e ectively utilizing the disjoint paths that exist between pairs of source, destination nodes. In this paper we construct a structure, called the multiple edgedisjoint spanning trees, on the star network, denoted by Sn. This is used for the ...

Given a (directed or undirected) graph with costs on the edges, the power of a node is the maximum cost of an edge leaving it, and the power of the graph is the sum of the powers of its nodes. Motivated by applications for wireless networks, we consider some fundamental network design problems under the power minimization criteria. Let G = (V, E) be a graph with edge-costs {ce : e ∈ E} and let ...

This thesis proposes a network coding based and easily-realizable composite network topologic model. It is composed of disjoint multi-path routing (DMR) and braided multi-path routing (BMR) in wireless sensor network, and network coding technology is also employed in our multi-path routing. With the use of the Node Coding technology and the multi-path technology, NC-RMR (Network Coding based Re...

Recently, wireless sensor networks (WSNs) have been immensely used in many real-life outlines, and have become very important. These sensors sense some physical phenomenon and then gathered information is processed. Sensor nodes may be affected from a huge distortion in severe surroundings, that causes the network to get split into multiple disjoint segments. Now to join these segments (in WSNs...

Given a weighted directed network G, we consider the problem of computing k balanced paths from given source nodes to given destination nodes of G, i.e. k paths such that the difference in cost between the longest and the shortest path is minimized. The special case in which G is an acyclic network was theoretically investigated in [3]. It was proved that, in such a special case, the balanced p...

We study the inapproximability of the induced disjoint paths problem on an arbitrary n-node m-edge undirected graph, which is to connect the maximum number of the k sourcesink pairs given in the graph via induced disjoint paths. It is known that the problem is NP-hard to approximate within m 1 2 −ε for a general k and any ε > 0. In this paper, we prove that the problem is NP-hard to approximate...

This paper considers the K-edge-disjoint hop-constrained Network Design Problem (HCNDP) which consists in finding a minimum cost subgraph such that there exists at least K-edge-disjoint paths between origins and destinations of demands, and such that the length of these paths is at most equal to a given parameter L. This problem was considered in the past using only design variables. Here, we c...

Random Forest is an Ensemble Supervised Machine Learning technique. Research work in the area of Random Forest aims at either improving accuracy or improving performance. In this paper we are presenting our research towards improvement in learning time of Random Forest by proposing a new approach called Disjoint Partitioning. In this approach, we are using disjoint partitions of training datase...