网络安全实验平台K-划分映射方法  

Mapping heuristics of network security testbed based on K-partition

作　　者：王会梅[1] 刘建[1] 荣宏[1] 欧阳红军[2] 鲜明[1] WANG Huimei;LIU Jian;RONG Hong;OUYANG Hongjun;XIAN Ming(College of Electronic Science,National University of Defense Technology,Changsha 410073,China;Teaching and Research Support Center,National University of Defense Technology,Changsha 410073,China)

机构地区：[1]国防科技大学电子科学学院,湖南长沙410073 [2]国防科技大学教学科研保障中心,湖南长沙410073

出　　处：《国防科技大学学报》2018年第5期109-115,共7页Journal of National University of Defense Technology

基　　金：国家863计划资助项目(2014AA7116082)

摘　　要：对网络安全实验平台映射问题进行形式化描述,提出基于K-划分的映射方法,其核心思想是为了尽量减少占用网络资源,尽可能将逻辑拓扑紧密连接的节点映射到同一台交换机上。基于K-划分的映射方法采用贪心法确定初始划分状态,根据评价函数进行节点移动,对生成的子图进行算法迭代,直到所有子图的节点数量不大于物理拓扑端口容量为止。基于K-划分的映射方法弥补了K-L算法中初始划分状态选取的任意性对最终结果产生较大影响的缺陷,实验结果表明该算法的求解时间远小于遗传算法,能在较短的时间内得到映射结果。The network security testbed mapping problem was formally defined and a new mapping heuristics based on K-partition was presented.The insight of the heuristic is that the tightly connected nodes of the logic topology should be mapped in the same switch in order to save more network resources.This novel mapping determines the initial state by greedy method,and moves nodes according to the defined cost function.The iteration partition of subgraph is in progress until that the number of subgraph nodes is not more than the port capacity of the physical switch.The problem that the result is influenced by the random initial partition in K-L partition is resolved by the K-partition mapping heuristics.The experiment result shows that the runtime is far less than the genetic algorithm,and the proposed algorithm can find near-optimal solutions in shorter period.

关 键 词：网络安全实验平台 映射方法 K-划分 评价函数 

分 类 号：TP393.08[自动化与计算机技术—计算机应用技术]