检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:郭小奉 庄毅[1] GUO Xiaofeng;ZHUANG Yi(College of Computer Science and Technology,Nanjing University of Aeronautics and Astronautics,Nanjing 211106,China)
机构地区:[1]南京航空航天大学计算机科学与技术学院,江苏南京211106
出 处:《计算机与现代化》2025年第1期107-112,共6页Computer and Modernization
基 金:国家自然科学基金资助项目(61572253)。
摘 要:针对软件定义网络中控制平面容错布局问题,提出一种基于随机生成树的控制器布局算法DRT2CA(Minimum Two Covering Algorithm Based on Dynamic Random Spanning Tree)。该算法旨在保证冗余容错的前提下,最小化控制器数量,降低控制平面的部署成本。通过不断生成随机生成树,并在树上采用贪心策略进行控制器布局搜索,DRT2CA算法以更少的控制器实现最小的冗余容错覆盖,有效提高系统资源利用率。实验结果表明,在不同网络规模和控制器容量下,DRT2CA算法相较于现有的冗余控制器部署算法,能够以更少的控制器部署数量实现容错控制平面布局,具有更高的冗余布局效率,为构建高效、可靠的SDN控制平面提供了创新性的解决方案。In this study,a random spanning tree-based controller layout algorithm DRT2CA(Minimum Two Covering Algorithm Based on Dynamic Random Spanning Tree)is proposed for the control plane fault-tolerant layout problem in software-defined networks.The algorithm aims to minimize the number of controllers and reduce the deployment cost of the control plane under the premise of guaranteeing redundancy fault tolerance.By continuously generating random spanning trees and employing greedy strategies for controller layout search on the tree,the DRT2CA algorithm achieves the minimum redundancy fault-tolerant coverage with fewer controllers and effectively improves the system resource utilization.The experimental results show that under different network scales and controller capacities,the DRT2CA algorithm is able to realize fault-tolerant control plane layout with fewer controllers deployed compared to existing redundant controller deployment algorithms,has higher redundancy layout efficiency,and is able to provide an innovative solution for constructing an efficient and reliable SDN control plane.
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.185