桂林电子科技大学学报2026，Vol.46Issue(2)：157-162,6.DOI:10.16725/j.1673-808X.202462
基于SDN的路由算法
Routing algorithm based on SDN
摘要
Abstract
As a new network architecture,Software Defined Network(SDN)provides flexibility and centralized control for network traffic management.However,with the development and popularity of SDN,various high-traffic service software emerge endlessly,bringing an increasing amount of data,followed by the demand for efficient and reliable path calculation algorithm,which brings great challenges to the network load.Therefore,how to effectively improve the efficiency of data transmission has become one of the important research directions of SDN.This paper studies the problem of optimal path planning in SDN,and proposes an im-proved path planning method based on bidirectional search-enhanced Dijkstra algorithm.The algorithm improves the efficiency of path search by starting the search from the source point and the destination point at the same time and meeting somewhere in the middle.This algorithm is implemented in a simulated SDN environment and compared with the current common algorithms.The re-sults show that the improved bidirectional search Dijkstra algorithm is more efficient in calculating the shortest path,especially in large networks.In addition,the network link weight is dynamically updated during operation,which verifies the robustness and adaptability of the algorithm.关键词
软件定义网络(SDN)/最短路径/双向搜索/Dijkstra算法/路径规划Key words
software-defined network(SDN)/shortest path/two-way search/dijkstra algorithm/path planning分类
信息技术与安全科学引用本文复制引用
尹鹏,张向利..基于SDN的路由算法[J].桂林电子科技大学学报,2026,46(2):157-162,6.基金项目
广西无线宽带通信与信号处理重点实验室主任基金(GXKL06200104) （GXKL06200104）
广西云计算与大数据协同创新中心(YD1904) （YD1904）
广西自然科学基金(2020GXNSFDA238001) （2020GXNSFDA238001）
