Main Article Content
Abstract
There are many network topologies designs related problem which include CMST, this tells us about the finding the minimum cost that in a given spanning tree.There is a central node and someother nodes which are connected with central node and they have their capacity constraints. Each link is having their cost which is totally based on the distance, quality of lines, capacity etc. and one main property that every node associate as a demand value with it. Basically, most of the networks are static in CMST, but there are situations when it needs to change for adding or deletinglinks of this type of connections is called dynamic network and such type of cases is called DCMST (dynamic CMST).EW algorithm is abasic method to solve the DCMST algorithm issues, but it may not always provide optimal output. we are using genetic algorithm to find the best result than EW algorithm to manage dynamic CMST.