首页> 外文会议>2010 18th IEEE Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM 2010) >A High-Speed and Memory Efficient Pipeline Architecture for Packet Classification
【24h】

A High-Speed and Memory Efficient Pipeline Architecture for Packet Classification

机译:一种用于数据包分类的高速且高效存储的管道架构

获取原文
获取原文并翻译 | 示例

摘要

Multi-field Packet classification is the main function in high-performance routers. The current router design goal of achieving a throughput higher than 40 Gbps and supporting large rule sets simultaneously is difficult to be fulfilled by software approaches. In this paper, a set pruning trie based pipelined architecture called Set Pruning Multi-Bit Trie (SPMT) is proposed for multi-field packet classification. However, the problem of rule duplications in SPMT that may cause a memory blowup must be solved in order to implement SPMT with large rule sets in FPGA devices consisting of limited on-chip memory. We will propose two rule grouping schemes to reduce rule duplications in SPMT. The first scheme called Partition by Wildcards (PW) divides the rules into subgroups based on the positions of their wildcard fields. The second scheme called Partition by Length (PL) rules partitions the rules into subgroups according to their prefix lengths. Based on our performance experiments on Xilinx Virtex-5 FPGA device, the proposed pipeline architecture can achieve a throughput of over 100 Gbps with dual port memory. Also, the rule sets of up to 10k rules can be fit into the on-chip memory of Xilinx Virtex-5 FPGA device.
机译:多字段数据包分类是高性能路由器的主要功能。当前的路由器设计目标是要实现高于40 Gbps的吞吐量并同时支持大型规则集,这很难通过软件方法来实现。本文提出了一种基于集合修剪树的流水线架构,称为集合修剪多比特树(SPMT),用于多字段数据包分类。但是,必须解决SPMT中规则重复的问题,该问题可能导致存储器崩溃,以便在包含有限片上存储器的FPGA器件中使用大型规则集来实现SPMT。我们将提出两种规则分组方案,以减少SPMT中的规则重复。第一种方案称为通配符分区(PW),根据通配符字段的位置将规则分为子组。第二种方案称为按长度划分(PL)规则,根据其前缀长度将规则划分为子组。根据我们在Xilinx Virtex-5 FPGA器件上进行的性能实验,提出的流水线体系结构可以通过双端口存储器实现超过100 Gbps的吞吐量。此外,最多可将10k规则的规则集放入Xilinx Virtex-5 FPGA器件的片上存储器中。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号