一种新的路由优化计算方法

随着网络规模的扩大，路由算法的优劣对改善整个网络的可扩展性起到至关重要的作用。传统中分级路由算法既保持源路由算法的优点，又有分布式路由算法的优越性，但因路由计算由许多节点承担必然带来路由质量的代价，如聚合信息不精确会严重影响路由的质量甚至影响网络的连通性。为了适当地减少路由计算的频度并快速提高计算效率，本文基于传统的路由算法提出了一种新的并行路由优化计算方法。

A New Computing Scheme for Routing Optimization

The performance of routing algorithms is vital for the expansibility of the whole network with the scope of the network becoming larger and larger. A hierarchical router algorithm not only has the advantages of the source routing algorithm,but also has the advantages of distributed routing algorithms. However, many of the routing nodes bearing the route calculation brings the cost of routing quality. As to reducing the router's computational frequency and improving the computational efficiency, this paper describes an optimized parallel routing algorithm which is based on traditional routing algorithms.