计算机工程2012，Vol.38Issue(6)：111-112,115,3.DOI:10.3969/j.issn.1000-3428.2012.06.036
基于聚合系数的拓扑抽象算法
Topology Aggregation Algorithm Based on Polymerization Coefficient
摘要
Abstract
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.关键词
网络模拟/拓扑抽象/聚合系数/权值估算/最短路径Key words
network simulation/ topology aggregation/ polymerization coefficient/ weight estimation/ shortest path分类
信息技术与安全科学引用本文复制引用
丁振全,董开坤..基于聚合系数的拓扑抽象算法[J].计算机工程,2012,38(6):111-112,115,3.基金项目
国家“863”计划基金资助重点项目“高性能大规模网络行为模拟系统”(2007AA010503) （2007AA010503）
