论文部分内容阅读
摘要随着近几年因特网上业务的飞速发展,基于第三层交换技术的路由器研究也有了很大的突破。基于硬件的快速路由查找技术是下一代路由器设计的核心技术之一。文章将讨论一种基于树型结构的IPv4快速路由查找算法,对这种算法的性能进行分析,提出算法本身存在的问题和性能上的不足,然后按照研究结果,提出了一种改进的算法———扩展压缩树算法。最后,将证明无论在性能和还是在可实现性上,扩展压缩树算法都比原算法有较大的提高。
Abstract With the rapid development of the business on the Internet in recent years, there has been a great breakthrough in the research of routers based on the Layer 3 switching technology. Hardware-based fast route lookup technology is one of the core technologies of next-generation router design. This paper will discuss a tree-based IPv4 fast route lookup algorithm, analyze the performance of this algorithm, put forward the existing problems and performance deficiencies of the algorithm itself, and then propose an improved algorithm based on the research results - - Extended compression tree algorithm. Finally, it will be shown that both the performance and the implementability of the extended compression tree algorithm are greatly improved compared with the original one.