Journal of Computer Applications ›› 2021, Vol. 41 ›› Issue (11): 3309-3318.DOI: 10.11772/j.issn.1001-9081.2021010015

• Network and communications • Previous Articles     Next Articles

Virtual software defined network mapping algorithm based on topology segmentation and clustering analysis

Gang CHEN(), Xiangru MENG, Qiaoyan KANG, Yong YANG   

  1. Information and Navigation School,Air Force Engineering University,Xi’an Shaanxi 710077,China
  • Received:2021-01-07 Revised:2021-02-28 Accepted:2021-03-12 Online:2021-03-29 Published:2021-11-10
  • Contact: Gang CHEN
  • About author:CHEN Gang, born in 1997, M. S. candidate. His research interests include network survivability,network security
    MENG Xiangru,born in 1963,Ph. D.,professor. His research interests include next-generation network,network virtualization
    KANG Qiaoyan,born in 1980,Ph. D.,associate professor. Her research interests include next-generation network,network survivability
    YANG Yong, born in 1998, M. S. candidate. His research interests include network function virtualization, virtual network survivability.
  • Supported by:
    the Key Research and Development Program of Shaanxi Province(2020-GY-026)

基于拓扑分割与聚类分析的虚拟软件定义网络映射算法

陈港(), 孟相如, 康巧燕, 阳勇   

  1. 空军工程大学 信息与导航学院,西安 710077
  • 通讯作者: 陈港
  • 作者简介:陈港(1997—),男,湖南常德人,硕士研究生,主要研究方向:网络可生存性、网络安全
    孟相如(1963—),男,陕西蓝田人,教授, 博士,主要研究方向:下一代网络、网络虚拟化
    康巧燕(1980—),女,福建永春人,副教授,博士,主要研究方向:下一代网络、网络可生存性
    阳勇(1998—),男,湖南衡阳人,硕士研究生,主要研究方向:网络功能虚拟化、虚拟网络可生存性。
  • 基金资助:
    陕西省重点研发计划项目(2020-GY-026)

Abstract:

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.

Key words: network virtualization, virtual Software Defined Network (vSDN), mapping algorithm, topology segmentation, clustering analysis

摘要:

针对目前大部分基于虚拟软件定义网络(vSDN)的映射算法未充分考虑节点与链路之间的相关性的问题,提出了一种基于网络拓扑分割与聚类分析的vSDN映射算法。首先,通过根据最短跳数进行拓扑分割的方法,降低物理网络的复杂度;然后,通过根据节点拓扑和资源属性进行聚类分析的方法,提升映射算法的请求接受率;最后,通过将链路约束分散到节点带宽资源以及节点的度进行约束考量,对不符合链路要求的节点进行重映射,从而优化了节点与链路映射过程。实验结果表明,该算法有效地提升了基于软件定义网络(SDN)架构的虚拟网络映射算法在较低连通概率物理网络下的请求接受率。

关键词: 网络虚拟化, 虚拟软件定义网络, 映射算法, 拓扑分割, 聚类分析

CLC Number: