DEAR: Delay-Guaranteed Energy Profile-Aware Routing Toward the Green Internet

Abstract

The existing energy-efficient routing algorithms have limitations when considering energy profiles and delay guarantees. In order to overcome these limitations, a delay-guaranteed energy profile-aware routing (DEAR) algorithm is proposed for a green Internet. In order to achieve this, a delay-guaranteed least energy path problem is defined, and then, the DEAR algorithm that can heuristically determine the delay-guaranteed least energy path for a flow using the well-known ant colony optimization technique is proposed. The simulation results demonstrate that the energy efficiency of the DEAR algorithm is approximately two times higher than that of the GreenOSPF, whereas the DEAR guarantees delay requirements of the flows, although the network elements have various energy profiles.