Energy Saving Based Routing Algorithms in SDN Environment

Saving energy has many profits such as reducing the costs which lead to saving money, reducing the risk. This paper aims to reducing a cost of computer network communication by reducing the energy consumption based on selecting appropriate shortest path routing algorithm, We used two algorithms Dijkstras algorithm and new novel algorithm (energy saving algorithm) and depicted the most different between these algorithms which serve our object, we used SDN network environment where the network can be changed dynamically easily and the control over all the network logically centralized which facilitate re-configuration of the data path without need for individual modification for each switch as in the traditional network.