检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:吕娜 陈坤[1] 陈柯帆 朱海峰[1] 潘武 LYU Na;CHEN Kun;CHEN Kefan;ZHU Haifeng;PAN Wu(College of Information and Navigation,Air Force Engineering University,Xi'an 710077,China;Unit 94860 of PLA,Nanjing 210000,China)
机构地区:[1]空军工程大学信息与导航学院,西安710077 [2]中国人民解放军94860部队,南京210000
出 处:《航空学报》2020年第7期238-247,共10页Acta Aeronautica et Astronautica Sinica
基 金:国家自然科学基金(61703427)。
摘 要:软件定义网络的出现推动了航空集群机载网络的发展,同时也为机载网络的一致性更新带来了挑战。针对拓扑变化导致的网络更新期间可用路径失效问题,提出适应拓扑变化的拥塞最小化网络更新策略。首先,为减少可用路径失效带来的数据包丢失,在更新之前采用重路由机制进行处理;然后,针对重路由机制可能引起的网络拥塞,设计了贪婪流迁移算法缓解拥塞;最后,通过瞬时拥塞最小化更新算法完成整个网络更新。仿真结果表明:与传统的拥塞一致性更新算法相比,所提更新策略用规则开销、瞬时网络拥塞方面的少量提高换取了网络更新期间数据包丢失的显著降低。The emergence of software-defined networking has accelerated the development of airborne networks of aviation swarm,while also presenting challenges for their consistency update.To solve the failure problem of available paths during network update caused by topology changes,a congestion-minimization network update strategy for topology changes is proposed.Firstly,to reduce the packet loss caused by the failure of available paths,the rerouting mechanism is used for processing before the update.Then,for the network congestion caused by the rerouting mechanism,the greedy flow migration algorithm is designed to reduce the network congestion.Finally,the entire network update is completed by the instantaneous congestion minimization update algorithm.The simulation results show that compared with the traditional congestion consistency update algorithm,the update strategy proposed in this paper allows a small increase in the overhead of rules and instantaneous network congestion in exchange for a significant reduction in packet loss during network update.
关 键 词:航空集群 机载网络 软件定义网络 网络更新 拓扑变化 容量一致性
分 类 号:V249.1[航空宇航科学与技术—飞行器设计]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.249