检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:陈港 孟相如[1] 康巧燕[1] 阳勇 CHEN Gang;MENG Xiangru;KANG Qiaoyan;YANG Yong(Information and Navigation School,Air Force Engineering University,Xi’an Shaanxi 710077,China)
机构地区:[1]空军工程大学信息与导航学院,西安710077
出 处:《计算机应用》2021年第11期3309-3318,共10页journal of Computer Applications
基 金:陕西省重点研发计划项目(2020-GY-026)。
摘 要:针对目前大部分基于虚拟软件定义网络(vSDN)的映射算法未充分考虑节点与链路之间的相关性的问题,提出了一种基于网络拓扑分割与聚类分析的vSDN映射算法。首先,通过根据最短跳数进行拓扑分割的方法,降低物理网络的复杂度;然后,通过根据节点拓扑和资源属性进行聚类分析的方法,提升映射算法的请求接受率;最后,通过将链路约束分散到节点带宽资源以及节点的度进行约束考量,对不符合链路要求的节点进行重映射,从而优化了节点与链路映射过程。实验结果表明,该算法有效地提升了基于软件定义网络(SDN)架构的虚拟网络映射算法在较低连通概率物理网络下的请求接受率。Aiming at the problem that most mapping algorithms based on virtual Software Defined Network(vSDN)do not fully consider the correlation between nodes and links,a vSDN mapping algorithm based on network topology segmentation and clustering analysis was proposed.Firstly,the complexity of physical network was reduced by the topology segmentation method based on the shortest hop count.Then,the request acceptance rate of mapping algorithm was improved by the clustering analysis method based on node topology and resource attributes.Finally,the nodes that do not meet the link requirements were remapped,by dispersing the link constraints to the bandwidth resources of nodes and the degrees of nodes to perform the consideration with constraints,so that the mapping process between nodes and links was optimized.Experimental results show that,the proposed algorithm can effectively improves the request acceptance rate of virtual network mapping algorithm based on Software Defined Network(SDN)architecture in physical networks with low connectivity probability.
关 键 词:网络虚拟化 虚拟软件定义网络 映射算法 拓扑分割 聚类分析
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.115