Greedy-based distributed algorithms for green traffic routing

Green networking has become a hot research area in recent years. Most works just focus on centralized algorithms, where a central controller is used to collect all the information of the network and compute the energy aware traffic routing. However, these centralized algorithms only fit to the scenario when the network is not large and assume that all the network´s information can be timely collected. When the above condition is not satisfied, the centralized algorithms will not work any more. In this paper, we study the basic principles of energy aware traffic routing and use them to explore a greedy-based distributed algorithm. The evaluation shows that our algorithm can reduce more energy consumption (almost 15%) than the existing distributed algorithms.