论文部分内容阅读
访问控制列表查找作为路由器的关键技术,可以根据IP数据包头信息对数据包进行更细粒度的分类,特别是对高速路由器中的快速查找技术的研究需求非常紧迫.访问控制列表根据几何分割可以生成决策树,查找过程可以通过遍历决策树加流水线的方式来实现.简单的流水线实现会带来内存利用不均匀的问题,为了解决该问题,本文采用双端口静态随机存储器技术,提出环形线性流水线结构来实现遍历树.该方法能均匀分布流水线中各段的内存,支持100Gbps线速处理.
Access control list lookup, as the key technology of routers, can classify data packets according to IP header information more granularly, especially the research on fast search technology in high-speed routers is very urgent.Access control lists can be generated according to geometric partitioning Decision tree, the search process can be traversed through the decision tree and pipelined way to achieve a simple pipeline implementation will bring uneven memory utilization issues, in order to solve this problem, this paper uses a two-port static random access memory technology, the circular linear pipeline structure To achieve traversal tree.This method can evenly distribute the memory of each section in the pipeline and support 100Gbps wire speed processing.