Tree Based EM-Prim's Algorithm For Energy Efficient Networking

Network and networking equipment's are one of the biggest contributors to the consumption of energy. To reduce energy consumption in networks, many techniques and algorithms have been developed over the years. But most of the algorithms require complicated computation thus requiring more time and energy. Here, we concentrated on the problem of reducing the number of active links when there is less load on the network. We propose a simple and elegant solution to the problem. We propose to use our EM-Prim's instead of using OSPF, a shortest path-finding algorithms which is used in most cases. Our EM-Prim's algorithm is a tree-based solution to reduce the number of links in a topology. We compared our algorithm with modified Dijkstra's algorithm and tested it against different topologies in case of different demand sizes in this paper and found significant improvements in the reduction of energy in networks.