Minimum concave-cost network flow problems: applications, complexity, and algorithms
Annals of Operations Research
On the fixed charge transportation problem
ACM '64 Proceedings of the 1964 19th ACM national conference
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
On the complexity of time table and multi-commodity flow problems
SFCS '75 Proceedings of the 16th Annual Symposium on Foundations of Computer Science
Reducing network energy consumption via sleeping and rate-adaptation
NSDI'08 Proceedings of the 5th USENIX Symposium on Networked Systems Design and Implementation
A Power Benchmarking Framework for Network Devices
NETWORKING '09 Proceedings of the 8th International IFIP-TC 6 Networking Conference
Power-efficient radio configuration in fixed broadband wireless networks
Computer Communications
Reducing power consumption in backbone networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Saving energy in IP-over-WDM networks by switching off line cards in low-demand scenarios
ONDM'10 Proceedings of the 14th conference on Optical network design and modeling
Exact solution of multicommodity network optimization problems with general step cost functions
Operations Research Letters
Dynamic topologies for sustainable and energy efficient traffic routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Energy saving in fixed wireless broadband networks
INOC'11 Proceedings of the 5th international conference on Network optimization
Power Savings in Packet Networks via Optimised Routing
Mobile Networks and Applications
Minimization of network power consumption with redundancy elimination
IFIP'12 Proceedings of the 11th international IFIP TC 6 conference on Networking - Volume Part I
| Hi-index | 0.00 |
Several studies exhibit that the traffic load of the routers only has a small influence on their energy consumption. Hence, the power consumption in networks is strongly related to the number of active network elements, such as interfaces, line cards, base chassis. The goal thus is to find a routing that minimizes the (weighted) number of active network elements used when routing. In this paper, we consider a simplified architecture where a connection between two routers is represented as a link joining two network interfaces. When a connection is not used, both network interfaces can be turned off. Therefore, in order to reduce power consumption, the goal is to find the routing that minimizes the number of used links while satisfying all the demands. We first define formally the problem and we model it as an integer linear program. Then, we prove that this problem is not in APX, that is there is no polynomial-time constant-factor approximation algorithm. Thus, we propose a heuristic algorithm for this problem and we present a study on specific topologies, such as trees and complete graphs, that provide bounds and results useful for real topologies. We then exhibit the gain in terms of number of network interfaces for a set of existing network topologies: we see that for almost all topologies more than one third of the network interfaces can be spared for usual ranges of operation, leading to a global reduction of approximately 33 MWh for a medium-sized backbone network. Finally, we discuss the impact of energy efficient routing on the stretch factor and on fault tolerance.