基于拓扑结构感知的节点多属性网络映射算法  

Node Multi-Attribute Network Mapping Algorithm Based on Topology Aware

作　　者：吴誉兰 舒建文[2] WU Yu-lan;SHU Jian-wen(Science and Technology College,NCHU,Nanchang Jiangxi 332020,China;School of Information Engineering,NCHU,Nanchang Jiangxi 330063,China)

机构地区：[1]南昌航空大学科技学院,江西南昌332020 [2]南昌航空大学信息工程学院,江西南昌330063

出　　处：《计算机仿真》2021年第11期327-330,354,共5页Computer Simulation

基　　金：江西省教育科学“十三五”规划2020年度课题(高校系列)(20200116)。

摘　　要：针对当前节点多属性网络链路映射长度较长、网络请求接受率和收益开销较低的问题,提出基于拓扑结构感知的节点多属性网络映射算法。根据无向图描述节点多属性网络映射问题,采用拓扑结构感知,构建节点多属性网络模型和节点链路映射评测指标,利用回溯算法,计算sumTR值,获得备选网络节点集合。使用子区域作为物理节点映射区域进行资源分配,按照映射优先级排列网络节点依次映射,分析节点多属性,使用最短路径算法,排序跳数最小链路映射,实现节点多属性网络映射。实验结果表明,所提算法能够有效缩短链路映射长度,提高网络请求接受率和收益开销。Aiming at the problems of long link mapping length, low network request acceptance rate and low revenue overhead of node multi-attribute network, a node multi-attribute network mapping algorithm based on topology perception is proposed. Node multi-attribute network mapping was described by undirected graph. Topology awareness was applied to build node multi-attribute network model and node link mapping evaluation index. According to the backtracking algorithm, the sumTR value was calculated to obtain the set of alternative network nodes. The sub area was used as the mapping area of the physical node to allocate resources. Based on the mapping priority, the network nodes were arranged to map in turn. Node multi-attribute was analyzed. The shortest path algorithm was used to sort the link mapping with the minimum number of hops. Eventually, the node multi-attribute network mapping was realized. The experimental results show that the algorithm can shorten the link mapping length and improve the network request acceptance rate and revenue overhead.

关 键 词：拓扑结构感知 节点多属性网络 网络映射 链路带宽 

分 类 号：TP306.2[自动化与计算机技术—计算机系统结构]