首页|基于改进GA和JAVPRS的数据中心网络设备能耗降低研究

基于改进GA和JAVPRS的数据中心网络设备能耗降低研究

扫码查看
在数据中心的耗能中,网络设备的耗能占比最大.为了降低网络设备的能耗,提高网络服务质量.针对不同类型业务的特点,研究分别提出了基于改进遗传算法和业务感知的虚拟机放置及路由调度算法来面向不同类型的业务.经测试,改进遗传算法相较于多边形扫描转换算法和导向滤波算法,可以降低约70%的能源消耗;减少约22%和64%的数据包延时和丢包率;增加40%左右的网络吞吐量.基于业务感知的虚拟机放置及路由调度算法相较于贪婪随机自适应西尔斯程序和模拟退火算法在接入层和汇聚层交换机中分别节约了约20%和18%的能耗,数据包延时减少了 8%左右.可见在相应类型的业务时,改进遗传算法和基于业务感知的虚拟机放置及路由调度算法均可以实现网络设备的节能.
Research on Energy Consumption Reduction of Data Center Network Equipment Based on Improved GA and JAVPRS
In the energy consumption of data centers,network devices account for the largest proportion of energy consumption.In order to reduce the energy consumption of network devices and improve the quality of network services.Based on the characteristics of different types of businesses,research has proposed virtual machine placement and routing scheduling algorithms based on improved genetic algorithms and business awareness to cater to different types of businesses.After testing,improved genetic algorithms can re-duce energy consumption by about 70%compared to polygon scanning conversion algorithms and guided filtering algorithms;Reduce packet latency and loss rates by approximately 22%and 64%;Increase network throughput by about 40%.Compared with greedy ran-dom adaptive Sears program and simulated annealing algorithm,the business aware virtual machine placement and routing scheduling algorithm saves about 20%and 18%of energy consumption in the access layer and aggregation layer switches,respectively,and re-duces packet latency by about 8%.It can be seen that both improved genetic algorithms and business aware virtual machine placement and routing scheduling algorithms can achieve energy-saving of network devices in corresponding types of services.

computer network equipmentenergy savinggenetic algorithmsimulated annealing algorithm

邓卜侨、谢岫峰、纪明阳、艾青、王康、冯光磊

展开 >

北京中电飞华通信有限公司,北京 100070

计算机网络设备 节能 遗传算法 模拟退火算法

北京中电飞华通讯有限公司科技项目

52680021N01H

2024

自动化与仪器仪表
重庆工业自动化仪表研究所,重庆市自动化与仪器仪表学会

自动化与仪器仪表

CSTPCD
影响因子:0.327
ISSN:1001-9227
年,卷(期):2024.(1)
  • 12