基于local-area的Internet路由级拓扑抽象算法  

An internet router-level topology aggregation algorithm based on local-area

作　　者：李乔[1] 张兆心[1] 

机构地区：[1]哈尔滨工业大学计算机科学与技术学院,哈尔滨150001

出　　处：《高技术通讯》2011年第9期922-927,共6页Chinese High Technology Letters

基　　金：863计划（2007AA010503）,国家自然科学基金（61100189）和山东省中青年科学家奖励基金（BS2011DX001）资助项目.

摘　　要：通过分析Internet的本地聚集特性，给出了local-area和connect—area的定义，并基于此，为提高并行网络模拟性能，提出一种新型拓扑抽象算法——基于local—area的拓扑抽象（TABLA）算法。TABLA算法在给定的聚合粒度下，迭代搜索网络内的local-area，对拓扑进行抽象。模拟结果表明在Internet路由级拓扑上采用该算法，拓扑规模大约压缩为原先的45％，初始化内存节省约60％，模拟运行时间约缩短80％，大幅度提高了并行网络模拟性能。This paper gives the definitions of local-area and connect-area based on the analysis of the local clustering property of the Internet, and on the basis of this, proposes the TABLA, a novel topology aggregation algorithm based on local area to improve the performance of parallel network simulation. The algorithm searches the local-area through the iteration method in a designated clustering level to perform topology aggregation. The simulation results show that for the Internet router-level topology aggregation, this algorithm can reduce the topology size by 45%, lessen the memory by 60% and shorten the simulation time by 80%.

关 键 词：并行网络模拟 拓扑抽象 聚合粒度 本地域(local-area) 

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