Energy-aware survivable networks

doi:10.1016/j.endm.2016.03.018

Electronic Notes in Discrete Mathematics

Volume 52, June 2016, Pages 133-140

https://doi.org/10.1016/j.endm.2016.03.018 Get rights and content

Abstract

We consider an energy-aware network management problem with shared protection. Energy consumption is due to the devices that are active in the nominal scenario. We propose a complete formulation and a projected one (which uses only primary path variables) and we compare their computational performances.

References (14)

B. Addis et al.
On the energy cost of robustness and resiliency in IP networks
Computer Networks
(2014)
P. Avella et al.
Metric inequalities and the network loading problem
Discrete Optimization
(2007)
D. Bienstock et al.
Using mixed-integer programming to solve power grid blackout problems
Discrete Optimization
(2007)
S. Mattia
Separating tight metric inequalities by bilevel programming
Operations Research Letters
(2012)
B. Addis et al.
Dynamic and coordinated energy management through optimized routing and device powering for greener communication networks
IEEE Transation on Networking
(2014)
B. Addis et al.
SRG-disjoint design with dedicated and shared protection
P. Belotti et al.
A Lagrangian relaxation approach to network design with shared protection

There are more references available in the full text version of this article.

Cited by (0)

View full text

Energy-aware survivable networks

Abstract

Computer Networks

Discrete Optimization

Discrete Optimization

Operations Research Letters

Dynamic and coordinated energy management through optimized routing and device powering for greener communication networks

IEEE Transation on Networking

SRG-disjoint design with dedicated and shared protection

A Lagrangian relaxation approach to network design with shared protection