基于Internet阶层结构的域间路由聚合增强算法  

Enhanced Inter-Domain Routing Aggregation Algorithm Based on Internet Hierarchical Structure

作　　者：王瑞军[1] 王洪君[1] 陈东明[1] 高远[1] 

机构地区：[1]东北大学秦皇岛分校,河北秦皇岛066004

出　　处：《东北大学学报（自然科学版）》2004年第9期829-832,共4页Journal of Northeastern University(Natural Science)

基　　金：国家自然科学基金资助项目(60073059;60273078)

摘　　要：提出了一种域间路由聚合的增强算法,它利用Internet阶层结构特性,以自治系统间关系为依据,强化路由聚合行为并约束可聚合路由的通告范围,给出了原形系统的实现算法·算法所需数据全部来自自治系统内部,没有全局协调数据,并有效回避了聚合行为对负载均衡和链路冗余的负面影响·数据实测和分析显示,算法能有效降低路由表规模,从而缓解当前Internet域间路由表高速增长的局面,加强了Internet的可扩展性·An enhanced inter-domain routing aggregation algorithm is proposed to strengthen routing aggregation behavior and constrain route advertising scope, based on the properties of Internet hierarchical structure and the relationship between autonomous systems. A prototype system implementation algorithm is thus provided, in which all the required data will be got from the interior of autonomous systems without global coordination data. The algorithm proposed can efficiently avoid the negative impact of aggregation on load balancing and link redundancy. Testing data statistics and analysis show that this algorithm can evidently reduce the routing table size so as to relax the pressure due to high-speed expansion of routing table at present and enhance the Internet expandability.

关 键 词：域间路由 聚合 自治系统 阶层结构 可扩展性 

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