Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Routing, Flow, and Capacity Design in Communication and Computer Networks
Routing, Flow, and Capacity Design in Communication and Computer Networks
Achieving near-optimal traffic engineering solutions for current OSPF/IS-IS networks
IEEE/ACM Transactions on Networking (TON)
Energy-aware traffic engineering
Proceedings of the 1st International Conference on Energy-Efficient Computing and Networking
Reducing power consumption in backbone networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
GreenTE: Power-aware traffic engineering
ICNP '10 Proceedings of the The 18th IEEE International Conference on Network Protocols
Introducing routing standby in network nodes to improve energy savings techniques
Proceedings of the 3rd International Conference on Future Energy Systems: Where Energy, Computing and Communication Meet
Computer Networks: The International Journal of Computer and Telecommunications Networking
Energy efficient online routing of flows with additive constraints
Computer Networks: The International Journal of Computer and Telecommunications Networking
Energy-aware IP traffic engineering with shortest path routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
Internet energy consumption is rapidly becoming an issue due to the exponential traffic growth and the rapid expansion of communication infrastructures worldwide. We address the problem of energy-aware intra-domain traffic engineering in networks operated with a shortest path routing protocol. We consider the problem of switching off (putting in sleeping mode) network elements (links and routers) and of adjusting the link weights so as to minimize the energy consumption as well as maximizing a measure of effectiveness of the routing weight configuration. We propose a three-phase MILP-based heuristic for tackling this multi-objective problem with priority (first minimize the energy consumption and then the overall cost of link utilization), which exploits the IGPWO heuristic proposed for optimizing the link weights so as to minimize the total cost of link utilization. For comparison purposes, we also developed a greedy randomized search procedure with path-relinking. The computational results for four real network topologies and different types of traffic matrices show that it is possible to switch off a substantial number of core nodes during low and moderate traffic periods, while guaranteeing the same point-to-point service quality and moderately increasing the network total cost of link utilization.