Paper Info
Title
Minimizing Energy Consumption with a CloneAnt-Based Routing Algorithm for Communication Network
Abstract
Energy saving in the ICT equipments has been an urgent problem recently. Although the average utilization of network is less than 40% most of the time, its energy consumption is almost the same as peak-hour's. In order to minimize energy consumption and improve resource utilization, we aggregate traffic into a network subset and turn off the remaining network elements. The problem is the classical capacitated multi-commodity flow problem (CMCF), which is proved to be NP-complete. In this paper, we propose a new CloneAnt-based Ant Colony Optimization Routing Algorithm (CACO-RA), and improve the classic CMCF model by aggregating traffic demands. Our algorithm transmits each demand pair through multiple paths, and aggregates flows which includes the same destination, then we get a network subset with the minimal consumption. Simulation results show that our algorithm has better performance in power consumption, computation time and reject rate.
Year
DOI
Venue
2015
10.1109/HPCC-CSS-ICESS.2015.21
HPCC/CSS/ICESS
Keywords
Field
DocType
green networks, energy savings, split-flow, ant colony optimization
Ant colony optimization algorithms,Mathematical optimization,Telecommunications network,Computer science,Network topology,Bandwidth (signal processing),Network element,Rejection rate,Energy consumption,Computation
Conference
ISSN
Citations 
PageRank 
2576-3504
1
0.36
References 
Authors
9
6
Name
Order
Citations
PageRank
Yanqing Gao130.73
Hua Wang27614.82
Runshui Zhu310.36
Shanwen Yi4166.34
Chuangen Gao532.08
Fuqiang Huang610.70