一种最小化网络能耗的冗余消除路由策略  

A redundancy elimination routing strategyto minimize network energy consumption

作　　者：张霖 张媛媛[3] 刘星 ZHANG Lin;ZHANG Yuanyuan;LIU Xing(School of Intelligent Manufacturing,Sichuan University of Arts and Sciences,Dazhou Sichuan 635000;Dazhou Intelligent Manufacturing Industry Technology Research Institute,Dazhou Sichuan 635000;Sichuan University of Arts and Sciences Library,Dazhou Sichuan 635000)

机构地区：[1]四川文理学院智能制造学院,四川达州635000 [2]达州智能制造产业技术研究院,四川达州635000 [3]四川文理学院图书馆,四川达州635000

出　　处：《首都师范大学学报（自然科学版）》2023年第5期37-40,共4页Journal of Capital Normal University：Natural Science Edition

基　　金：达州智能制造产业技术研究院2022年度开放基金项目(ZNZZ2216);四川文理学院科研启动基金资助项目(软件定义DCNs的节能路由机制研究);四川文理学院校级科研项目(2017XB011Y);四川文理学院校级科研项目(2019KZ006Z)。

摘　　要：拥有海量连接的5G网络中存在大量相同或相似的数据请求,造成网络带宽的严重浪费。因此,从消除冗余数据的角度出发,本文提出一种节能路由策略,用于解决流量高峰和低谷时期下网络流的路由路径选择问题;通过求解最小化网络能耗问题,进一步提出了一种流抢占路由算法。理论推导及仿真结果表明,本文提出的算法在流完成时间和活动链路数量方面均优于传统路由算法。Due to the characteristics of massive connections,there are a large number of identical or similar data requests in the 5G network,resulting in a serious waste of network bandwidth.Therefore,from the perspective of eliminating redundant data,this paper proposes an energy-saving routing strategy to solve the problem of routing paths selection for network flows during traffic peaks and valleys.By solving the problem of minimizing network energy consumption,a flow preemption routing algorithm is proposed.The theoretical derivation and simulation results show that the proposed algorithm outperforms the traditional routing algorithm in terms of flow completion time and number of active links.

关 键 词：网络能耗 软件定义网络 路由策略 数据中心 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]