Energy-aware IP traffic engineering with shortest path routing

Internet energy consumption is rapidly becoming a critical 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 protoco...

Full description

Saved in:
Bibliographic Details
Published in:Computer networks (Amsterdam, Netherlands : 1999) Vol. 57; no. 6; pp. 1503 - 1517
Main Authors: Amaldi, E., Capone, A., Gianoli, L.G.
Format: Journal Article
Language:English
Published: Kidlington Elsevier B.V 22.04.2013
Elsevier
Elsevier Sequoia S.A
Subjects:
Algorithms
Applied sciences
Computer science; control theory; systems
Computer systems and distributed systems. User interface
Energy consumption
Energy-aware
Engineering
Exact sciences and technology
Heuristic
Information retrieval. Graph
Internet
Internet Protocol
Linear programming
Matrices
Network topologies
Networks
Optimization
OSPF
Quality of service
Shortest path
Shortest path algorithms
Software
Studies
Theoretical computing
Traffic
Traffic congestion
Traffic control
Traffic engineering
Weights optimization
Shortest path
Energy-aware
Weights optimization
Traffic engineering
OSPF
Energy consumption
Multiobjective programming
Optimization
Network topology
Infrastructure
UNIX system
Routing protocols
Mathematical programming
Mixed integer programming
Routing
Router
Context aware
Linux system
Distributed system
Energy savings
Traffic management
Heuristic method
Wireless network
Internet
Energy management
Service quality
Traffic congestion
ISSN:1389-1286, 1872-7069
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Internet energy consumption is rapidly becoming a critical 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 sleep mode) network elements (links and routers) and of adjusting the link weights so as to minimize the energy consumption as well as a network congestion measure. To tackle this multi-objective optimization problem with priority (first minimize the energy consumption and then the network congestion), we propose a Mixed Integer Linear Programming based algorithm for Energy-aware Weights Optimization (MILP-EWO). Our heuristic exploits the Interior Gateway Protocol Weight Optimization (IGP-WO) algorithm for optimizing the OSPF link weights so as to minimize the total cost of link utilization. The computational results obtained for eight real network topologies and different types of traffic matrices show that it is possible to switch off a substantial number of nodes and links during low and moderate traffic periods, while guaranteeing that network congestion is low enough to ensure service quality. The proposed approach is also validated on two networks of emulated Linux routers.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:1389-1286
1872-7069
DOI:10.1016/j.comnet.2013.02.006