OSPF路由协议离散分组算法研究  

Research on the Dispersion and Grouping Algorithm for OSPF Routing Protocol

作　　者：钟廷龙[1] 贾凤根[1] 郭云飞[1] 

机构地区：[1]解放军信息工程学院国家数字交换系统工程技术研究中心,郑州450002

出　　处：《计算机工程与应用》2005年第15期145-147,175,共4页Computer Engineering and Applications

摘　　要：在较大型的OSPF网络中,OSPF路由器常会在短时间内生成大量的LSA,以致会因LSA的刷新而引起网络资源的周期性耗竭。离散分组算法通过对LSA的刷新时刻进行离散和分组,成功地消除了上面的问题。该文详细论述了离散分组算法,并对离散分组算法的应用进行了适当地扩展。Routers in larger OSPF networks tend to originate a great lot of LSAs within a short period of time,thus causing periodical network resource exhaustion by LSA refreshments.And this problem is solved by the dispersion and grouping algorithm through which the points of LSA refreshment are dispersed and grouped.This paper discusses the dispersion and grouping algorithm in detail and enlarges its application properly.

关 键 词：OSPF LSA 离散 分组 

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