摘要
距离向量路由算法和链路状态路由算法是网络中普遍应用的两种路由算法。距离向量算法交换的路由信息较少,但存在"计数到无穷"的问题,不能保证无路由环;链路状态算法需交换的路由信息多,路由开销较大。针对上述算法的缺陷,基于最短路径树交换的路由原理,本文提出轻权邻接状态路由算法,它只需交换必要的路由信息,既避免了路由环问题,又减少了所需交换的路由信息,降低了通信开销,提高了效率。
The distance vector algorithm and the link state algorithm are two commonly-used algorithms in networks. In the former algorithm, there exists little information, but the count-to-infinite problem may exist, so it can not avoid circle routing. The latter one exchanges much information, and the cost of updating is high. The paper presents a new algorithm called light-weight adjacent-state algorithm for large-scale networks,which is based on the shortest path tree exchange. In this algorithm, only necessary information is to be exchanged, not only avoids circle routing, but also decreases the information to be exchanged. Thus this algorithm reduces communication cost, and improves efficiency greatly.
出处
《计算机工程与科学》
CSCD
北大核心
2009年第2期56-57,111,共3页
Computer Engineering & Science
