检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]华中科技大学计算机科学与技术学院,武汉430074 [2]佛罗里达大学电气与计算机工程系,佛罗里达州盖恩斯维尔32611
出 处:《计算机研究与发展》2015年第4期806-812,共7页Journal of Computer Research and Development
基 金:国家自然科学基金项目(61173170)
摘 要:由于数据中心网络是云计算和下一代网络技术的平台和基础设施,日益增长的网络数据在满足用户需求的同时,也大幅增加了数据中心的能耗.许多针对数据中心网络的节能策略被提出,多数采用硬件与软件相结合的策略来完成节能模型的设计.为了进一步降低能耗,从网络负载均衡和节能路由设计的角度提出了一种新的节能路由算法,其基本思想是首先对负载均衡进行量化分析,然后提出带宽限定的负载均衡与节能相结合的节能路由算法,充分考虑到网络整体的可达性和可靠性.该算法为数据中心节能提供了一种新的视角.通过与传统的节能路由作比较,验证了该算法能够在保证较高网络可靠性的同时能耗较低.通过对实验数据的分析和解释得到了若干有益的结论,为进一步的研究工作奠定了基础.Because the data center network is a platform for cloud computing and the next generation of netw ork technology ,the increasing netw ork data can meet the requirements of users ,and at the same time greatly increase the energy consumption of data centers .Many energy saving strategies for data center network are studied ,and the combination strategies of hardware and software are mainly used to complete the design of energy‐saving models .In order to further improve energy efficient , from the angle of network load balancing and energy saving routing ,a new energy efficient routing algorithm is presented .Its basic idea is firstly to make quantitative analysis on the load balancing ,and then to put forward energy‐saving routing algorithm combined load balancing and energy saving with bandwidth limited ,and the overall network accessibility and reliability are fully considered . The algorithm provides a new perspective for energy efficient data center . Compared with traditional energy saving routing ,the algorithm can guarantee the high reliability and low energy consumption of the network . Some useful conclusions are obtained through the analysis and explanation of the experimental data ,w hich lay a solid foundation for further research .
分 类 号:TP391[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.28