Résumé en anglais

The energy consumption of network devices, and, as a consequence, of communication networks, is generally independent from their level of utilization, which results in awaste of energy when the network islightly loaded. Ideally the consumption of a network should be proportional to the amount of traffic it conveys. The most straightforward way to enforce such a proportionality between the network energy consumption and its utilization level, is to dynamically adapt the status of network devices to the load, forcing a subset of them to enter a sleep state during the low activity periods. We present in this paper an algorithm to dynamically put links into a sleep state, based on a cooperative-game approach, named “L-Game”. Our approach decides which links can be switched off based on a measure of the criticality of each link expressed as its Shapley value. This measure combines topological aspects and traffic conditions. Simulation results on real network scenarios show that our solution achieves a better trade off between energy saving and Traffic Engineering than other legacy approaches.