A Parallel Approach to Solve Minimum Spanning Tree Problem in Network Routing

Abstract

Abstracthe minimal-weight spanning tree (MST) problem is a famous combinatorial optimization problem worried with finding a spanning tree of an undirected, linked graph, such that the sum of the weights of the selected edges is minimal. Márquez,et al. proposed a minimal spanning tree (MST) set of rules and correctly applied it to wi-fi ad-hoc network routing. The undertaking of finding the shortest route in a network for routing data packets has been dealt in this paper. we've used an algorithm to remedy the MST hassle and we have parallelized it with the assist of Open MP API , we've got implemented the parallelized algorithm to resolve community routing problem with respect to its objective feature. A comparative evaluation with the help of VTune analyzer has also been done whilst the identical algorithm is completed sequentially in a unmarried thread environment. based on this analysis a elegant parallel MST algorithm is offered. The refined set of rules is carried out to a network to solve the routing trouble in it ,and results suggests that this parallel set of rules is a good approach to compute and resolve the network routing trouble.