An energy-saving multicast routing algorithm in green Internet

Ever-increasing application types and rapidly expanding network size drive the energy consumption problem in the Internet to become a focus of attention concerned by the global related fields. In this context, this paper proposes a one-to-many multicast routing algorithm based on a least cost shortest path tree with a path node-driven strategy. In addition, the energy-saving demand is taken fully into account in the problem modeling and the definition to the fitness function. Finally, the proposed algorithm is simulated on the basis of the network topology of CERNET2 and compared with EHER (Efficient Heuristics for Energy-aware Routing) algorithm for network energy consumption, the success rate of routing and running time, which shows the algorithm proposed in this paper is relatively good in the performance and energy efficient.