Efficient heuristics for energy-aware routing in networks with bundled links

Abstract

Abstract-Current networks are typically over-provisioned to ensure low delays, redundancy and reliability. These Quality of Service (QoS) guarantees are typically achieved using high end, high power network equipments. Their use, however, has led to concerns regarding green house gas emissions, which garnered a lot of attention recently and have resulted in a number of global initiatives aim at reducing the carbon footprint of Internet Service Providers (ISPs). These initiatives have motivated ISPs and researchers to design novel network algorithms and hardware that scale the usage or active time of a network according to traffic load. To this end, this paper considers the problem of shutting down a subset of bundled links during off-peak periods in order to minimize energy expenditure. Unfortunately, identifying the cables that minimize this objective is an NP-complete problem. Henceforth, we propose several practical heuristics based on Dijkstra's algorithm and Yen's k-shortest paths algorithm.We evaluated our heuristics on the Abilene network -with both real and synthetic traffic matrices and several larger random topologies with various loads. Our results show that the proposed heuristics to be effective and efficient. Moreover, our approaches could potentially reduce the energy usage of cables used in the Abilene network by up to 56.7%, assuming the traffic demands recorded on September 5, 2004.

An Energy Computation in Distributed Computing Environment through Bellman-Ford Algorithm

“…Schien et al [8] have proposed a model to analyze and assessing variability for the energy consumption at the during downloading multimedia applications. Lin et al [9] have proposed a method for minimizing the energy for NP-complete problem solution by Dijkstra's algorithm and Yen's k-shortest paths algorithm. They have evaluated in Abilene network (eg.…”

On the performance of online and offline green path establishment techniques

“…Their work inspired a number of research directions with the common aim of reducing the energy expenditure of routers/switches. In general, these works can be categorized as (i) sleeping [10], which aims to place subcomponents of devices or devices themselves to sleep, (ii) link adaptation [11], which scales the energy consumption according to varying link utilization, (iii) proxying [8], which reduces network chatters by way of a proxy, and lastly (iv) traffic engineering (TE) [12][13][14][15][16], whereby traffic is routed across the minimal number of links and routers. We note that in general energy efficiency is a contemporary research issue that is of considerable interest to researchers.…”

On the effects of energy-aware traffic engineering on routing reliability

“…Note that the multiple paths used in FGH, GreenTE and MSPF [17,18,26] may not be linkdisjoint. While all solutions [17,18,26,27,28] are able to turnoff significant number of redundant links/cables to reduce power consumption, none of them reported their impact on network reliability.…”

“…Lin et al [27] propose another TE solution, called SSPF, which re-route each demand using only a single path. They show that single path routing is attractive for its simplicity as well as fast route and significant energy saving.…”

“…Henceforth, this paper studies the impact of switching off cables using five recent energy-aware routing mechanisms, namely FGH, GreenTE, MSPF, SSPF, and TLDP [17,18,26,27,28], on two reliability measures, i.e., 2-terminal reliability and path reliability. The first reliability measures the probability of obtaining at least one operational path that can be used for route restoration in case of link failures, while the second computes the reliability of each path used to route traffic.…”