基于SDN的最小跳数卫星网络路由算法  

SDN-based minimum hop satellite network routing algorithm

作　　者：许向阳[1] 张俊强 黄昊波 XU Xiangyang;ZHANG Junqiang;HUANG Haobo(School of Information Science and Engineering,Hebei University of Science and Technology,Shijiazhuang 050018,Hebei)

机构地区：[1]河北科技大学信息科学与工程学院,河北石家庄050018

出　　处：《长江信息通信》2023年第7期35-39,共5页Changjiang Information & Communications

摘　　要：为解决卫星网络星上计算和存储能力有限、传统路由算法不适用的问题,结合软件定义网络思想,提出了一种基于SDN的最小跳数路由算法。该算法利用SDN的集中控制与全局视图,划分源目节点最小跳数范围求取最小跳数集,计算权重选取满足不同服务质量(QoS)数据包的最优路径并与GEO/LEO双层网络进行路由选择。实验结果表明,该算法较ACO算法和Dijkstra算法在时延、吞吐量和丢包率方面性能较好,同时算法时间复杂度较低。To solve the problems of limited on-star computing and storage capacity of satellite networks and the inapplicability of traditional routing algorithms,a minimum-hop routing algorithm based on SDN is proposed in combination with softwaredefined networking ideas.The algorithm utilizes the centralized control and global view of SDN,divides the minimum hop count range of source destination nodes to find the minimum hop set,calculates the weights to select the optimal paths that satisfy different quality of service(QoS)packets and routes them with the GEO/LEO two-layer network.Experimental results show that this algorithm performs better in latency,throughput,and packet loss rate than ACO algorithm and Dijkstra algorithm,while the algorithm has lower time complexity.

关 键 词：卫星网络 SDN 最小跳数路由 卫星通信 QOS 

分 类 号：TN927.2[电子电信—通信与信息系统]