A Genetic Algorithm to Find the Minimum Cost Paths Tree with Bandwidth Constraint in the Computer Networks

Through the communication network, several communication applications need a source to transfer information to different destinations. In order to support the applications, it is essential to evaluate the shortest paths tree of minimal cost to connect source to destination nodes with respect to the bandwidth conditions on the information communication. In order to solve the problem, the genetic algorithm is applied. The paper highlights the generic algorithm to manage shortest path tree problem in relation to bandwidth and cost constraints. The aim of the presented algorithm is to determine the group of edges that connecting all nodes, value of bandwidth and sum of costs will be constrained. To demonstrate the efficiency the propose algorithm has applied to two sample networks.