Minimizing ISP Network Energy Cost: Formulation and Solutions

Chiaraviglio, Luca; Mellia, Marco; Neri, F.

doi:10.1109/tnet.2011.2161487

Cited by 262 publications

(259 citation statements)

References 15 publications

Supporting

Mentioning

258

Contrasting

Unclassified

Order By: Relevance

“…The project also proposed energy-aware adaptive routing solutions (EA-ARSs) for the network operators. Chiaraviglio et al proposed a approach to reduce the power consumption of backbone networks by turning off network nodes and links while guaranteeing full connectivity and link utilization constraints [18].…”

Section: Related Workmentioning

confidence: 99%

Greening the NetFPGA Reference Router

et al. 2016

View full text Add to dashboard Cite

Abstract:Energy efficiency is an important criterion in the design of next generation networks for both economic and environmental concerns. This paper presents an energy-efficient router that is able to dynamically adapt its routing capability in response to real-time traffic load, achieving energy proportional routing. The NetFPGA reference router, which operates at one of two frequencies (125 MHz or 62.5 MHz), requires a board reset to switch frequencies. We have modified the reference router to allow dynamic switching among five operating frequencies. Experiments with real traces indicate that, compared to the reference router, a 10% power reduction can be achieved through dynamic frequency scaling. When the router is further modified to support green traffic engineering and Ethernet port shut-down, power consumption can be reduced by 46% while maintaining the required quality of service. This allows the router to meet the instantaneous performance requirements while minimizing power dissipation. Similar results can be expected when these general power-saving principles are applied in future commercial routers.

show abstract

Section: Related Workmentioning

confidence: 99%

Greening the NetFPGA Reference Router

et al. 2016

View full text Add to dashboard Cite

show abstract

“…There has been a handful of works on energy-aware Traffic Engineering (TE), some of which uses distributed optimization [17,18,19,20] while others utilize centralized optimization [13,16,21,22,23,24]. Vasic et al [17] present EATe, a technique that takes energy consumption into account while achieving the same traffic rates between source and destination nodes as energy oblivious approaches.…”

Section: Related Workmentioning

confidence: 99%

“…Thus, when the algorithm incorrectly removes a sub-optimal link, it will never backtrack to correct its mistake for the period. Other centralized optimization solutions on energy-aware TE, like ours, use shortest paths routing [13,16,21,22,24]. However, these studies do not consider links with bundled cables except [13].…”

Section: Related Workmentioning

confidence: 99%

“…However, these studies do not consider links with bundled cables except [13]. In [21], the authors formulate the problem of power consumption as multi-commodity minimum cost flow problems, and provide methods to switch off routers according to policies such as random, least link, least-flow and most-power. Their algorithms in [21], running on a centralized controller, select the minimum set of devices that must be switched on to meet current traffic demands.…”

Section: Related Workmentioning

confidence: 99%

“…In [21], the authors formulate the problem of power consumption as multi-commodity minimum cost flow problems, and provide methods to switch off routers according to policies such as random, least link, least-flow and most-power. Their algorithms in [21], running on a centralized controller, select the minimum set of devices that must be switched on to meet current traffic demands. Further, they consider a scenario that reconfigures the network periodically, e.g., every 30 minutes, to match the daily traffic variation in current backbone networks.…”

Section: Related Workmentioning

confidence: 99%

See 2 more Smart Citations

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

et al. 2013

View full text Add to dashboard Cite

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.

show abstract