Page 11 - SPM FINAL

PROBLEM STATEMENT

● Introduction : - With increase in the networking and communication device
the need of optimization also increased. Various networking companies use
software to optimize the cost to establish the network and also try to select
the best possible route to establish communication between the end
devices.

● The Problem :- The main problem is to optimize the algorithm which helps in
finding the minimum cost and shortest path to establish a network. When the
number of input increases the result delivered by the algorithm is less efficient
and the power consumption is very high. The main task is to make optimize
these algorithm(s) and lower the power consumptions.

● Proposal :- The above problem statement can be solved by using various
minimum spanning tree algorithms with dynamic programming paradigm.
Converting the greedy approach to dynamic algorithms will make these
algorithms to work fast and also help to lower the power consumption of the
mainframe system(s).

For example :- Prim's algorithm uses greedy method to get the solution if
the same algorithm is implemented using dynamic approach then the
efficiency of the algorithm will get increase because we will be able to look

for global optimum solutions instead of local optimum solutions.