Green Routing Algorithm for Data Networks

Abstract: The explosive development of Information and Communication Technology (ICT) has significantly increased both energy demands and carbon dioxide emission. This leads to the energy crisis and global warming problems worse. The escalating energy costs and the environmental concerns have already created an urgent need for more energy-efficient “GREEN” computational methods. Energy efficient coding may involve improving computational efficiency so that data is processed as quickly as possible and the processor can go into a lower power "idle" state. In this paper we, modified the existing routing algorithm to minimize the energy loss by minimizing the computational time in selecting the routes between source and destination in a data network. This work shows that the proposed algorithm takes less computational time than the expected proximity algorithm (EP) and maximum proximity (MP) algorithm. The performance is studied computationally on various networks under static traffic model.

Keywords: Green Computing, Global Warming, Routing Algorithm, Congestion