Extended Cutset Inequalities for the Network Power Consumption Problem

Abstract

In this paper, we enhance the MIP formulation for the Network Power Consumption problem, proposed by Giroire et al. We derive cutting planes, extending the wellknown cutset inequalities, and report on preliminary computations.

Robust energy-aware routing with redundancy elimination

“…Indeed, such link will certainly be part of the final solution. In addition, we can add some valid cut-inequalities to speed-up the resolution of the MILP [31].…”

Energy management in communication networks: a journey through modeling and optimization glasses

“…x [72] x x [73,74] x x [75,76] x x [77] x Multi-topology routing [78,79] x Energy-Levels [80][81][82][83] x Node expansion, Multiple sleeping states [48,84] x x [85] x x x [86] x x [87,88] x x x x x [89] x [90] x x x x [91] x x Bi-objective function for energy and delay [92] x x x x hop-by-hop routing [93,94] x x x x Two macro-periods [95] x x [96] [97] x [55,98,99] x Redundancy elimination [100,101] x x x x [102] x x x Approximated shared and dedicated protection [103] x x x x [104] x x Failure probabilities x New power state [110] x x [111] x ECMP and robustness [53] Fully splittable [112] free splitting ratio [113,114] [ 115,116] x x Traffic unaware because only link loads considered [117,118] x x OSPF is modified [119] x OSPF is mo...…”

“…The authors define and solve a convex programming formu-lation. In [55,98] and [99], the authors address a very particular IP-BEANM problem to model the redundancy elimination mechanism, according to which, a subset of routers equipped with enhanced and power hungry capabilities can store the content of the transmitted packets: every time the same content has to be retransmitted toward another "capable" router, the routers does not send a full packet, but a simple hash which allows the receiver router to identify the content in its memory. This mechanism produces a bandwidth reduction, which can be exploited to save energy.…”

“…In [98], a MILP formulation and a heuristic algorithm to put to sleep nodes and links while assuming fully splittable routing and deciding whether to activate the redundancy elimination function are presented. New cutset inequalities for the same problem are presented in [99], while in [55] the robust version of the problem is formulated. As in [54] and [61], the robust MILP exploits the cardinality-constrained approach formulated in [56] to balance the solution robustness.…”

Robust Redundancy Elimination for Energy-Aware Routing

“…Although solving the GreenRE model is already a complex task [20], it does not take traffic redundancy fluctuations into account. Instead, each of the demands contains a constant factor of redundant traffic.…”