Green Routing Algorithm for Wired Networks

Abstract

With increase in uses and users of the internet, there has been an enormous increase in data transferred and power consumed in internet networks. With increasing penetration of the internet into developing areas of the world, internet traffic will increase substantially. The authors propose an algorithm which takes into consideration the temperature of servers and the bottlenecks in the network by modifying Linked State Packets of OSPF protocol. Using these parameters, the routing table is updated using a modified Dijkstra's algorithm. This algorithm differs from previous algorithms which switch network components such as links and routers to sleep mode or reduce transfer rate in links. Many of these algorithms require a centralized system and are not very scalable. Also, unlike many previous studies, the authors' algorithm does not require much modification to existing OSPF algorithm prevalent in networking today. Their algorithm delineates the coexistence of performance and energy conservation.