Paper Info
Title
Energy saving heuristics in backbone networks.
Abstract
The paper presents an approach aimed to reduce the overall power consumption of a backbone network by exploiting the power behavior of green network devices. This approach is based on the solution of an optimization problem that has a Mixed Integer NonLinear Programming (MINLP) formulation. Given that the problem is NP-hard, exact methods for finding optimal solutions can be used only for scenarios of limited size. To cope with the case of complex networks, the paper proposes two variations of the Fast Greedy Heuristic (FGH), denoted as Time Limited PAR Heuristic (TLPH) and PAR Meta Heuristic (PMH). The simulation study highlights the capability of the proposed heuristics to obtain solutions near the optimum and to outperform the other approaches in terms of power savings and CPU times needed to find a solution in complex network scenarios.
Year
Venue
Keywords
2012
SustainIT
Internet,energy conservation,integer programming,nonlinear programming,power consumption,PAR meta heuristic,backbone networks,energy saving heuristics,fast greedy heuristic,green network devices,mixed integer nonlinear programming,power consumption,power savings,time limited PAR heuristic
Field
DocType
ISSN
Mathematical optimization,Heuristic,Nonlinear programming,Greedy algorithm,Heuristics,Integer programming,Complex network,Backbone network,Optimization problem,Mathematics
Conference
2377-5580
Citations 
PageRank 
References 
6
0.39
5
Authors
5
Name
Order
Citations
PageRank
Rosario Giuseppe Garroppo112617.92
Stefano Giordano260986.56
Gianfranco Nencioni311711.38
Michele Pagano419831.51
Maria Grazia Scutellà525320.63