基于聚合系数的拓扑抽象算法  

Topology Aggregation Algorithm Based on Polymerization Coefficient

作　　者：丁振全 董开坤 

机构地区：[1]哈尔滨工业大学(威海)网络与信息安全技术研究中心,山东威海264209

出　　处：《计算机工程》2012年第6期111-112,115,共3页Computer Engineering

基　　金：国家"863"计划基金资助重点项目"高性能大规模网络行为模拟系统"(2007AA010503)

摘　　要：针对大规模网络模拟资源消耗较高的问题,提出一种基于聚合系数的拓扑抽象算法。根据最短路径对网络拓扑中所有节点赋予权值,结合聚合系数定义权值阈值,并进行树形抽象和权值估算抽象。树形抽象将孩子节点抽象至根节点,权值估算抽象对低于权值阈值的节点进行抽象。实验结果表明,在最短路径不发生改变的情况下,该算法可抽象70%以上的节点。In order to solve high resource consumption of large-scale network simulation, an topology aggregation algorithm based on polymerization coefficient is presented. All the nodes on the network topology are assigned to weights, and the weight threshold that is defined by methods of combining polymerization coefficient is used to aggregate network topology. Two methods are used by the algorithm： The tree aggregation and weight estimation aggregation, and the tree aggregation aggregates the child nodes to the root node, and the weight estimation aggregation aggregates the nodes whose weights are below the weight threshold. Experimental result shows that the algorithm can aggregate nodes of more than seventy percent when the shortest path keeps constant.

关 键 词：网络模拟 拓扑抽象 聚合系数 权值估算 最短路径 

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