Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1109/GreenCom-CPSCom.2010.147 | GreenCom/CPSCom |
Keywords | Field | DocType |
network interface,used link,power consumption,practical results,network topology,heuristic algorithm,minimizing routing energy consumption,energy consumption,polynomial-time constant-factor approximation algorithm,active network element,energy efficient routing,medium-sized backbone network,routing,network interfaces,computational complexity,approximation theory,active networks,fault tolerant,fault tolerance,algorithms,integer linear programming,polynomial time,complete graph,satisfiability,linear programming,topology,integer programming,active network,graphs | Mathematical optimization,Multipath routing,Hierarchical routing,Computer science,Static routing,Routing domain,Destination-Sequenced Distance Vector routing,Network topology,Backbone network,Routing protocol | Conference |
Citations | PageRank | References |
26 | 0.98 | 10 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Frederic Giroire | 1 | 68 | 3.99 |
| Dorian Mazauric | 2 | 82 | 13.34 |
| Joanna Moulierac | 3 | 122 | 11.24 |
| Brice Onfroy | 4 | 26 | 1.32 |