首页> 外文会议>International Multi-Symposiums on Computer and Computational Sciences >AM-Trie: An OC-192 Parallel Multidimensional Packet Classification Algorithm
【24h】

AM-Trie: An OC-192 Parallel Multidimensional Packet Classification Algorithm

机译:AM-TRIE:OC-192并行多维数据包分类算法

获取原文

摘要

Nowadays, many high-speed Internet services and applications require high-speed multidimensional packet classification, but current high-speed classification often use expensive and power-slurping hardware (such as TCAM and FPGA). In this paper, we presented a novel algorithm, called AM-Trie (Asymmetrical Multi-bit Trie). Our algorithm creatively use redundant expression to reduce the height of Trie; use compression to reduce the storage cost and eliminate the trace back to enhance the search speed further. Moreover, AM-Trie is a parallel algorithm and very fit for the "multi-thread and multi-core" features of Network Processor; it has good scalability, the increase of policy number influences little to its performance. A heuristic field division algorithm is also presented, we proved in theoretical that there exists a minimum storage cost dividing solution when the height of the AM-Tire is given. Finally, a prototype is implemented based on Intel IXP2800 Network Processor. The performance testing result proves that AM-Trie is high-speed and scalable, the throughput of the TCP/IP 6-tuple classification achieves OC-192 (10 Gbps, 64 bytes per packet, i.e.20 Mpps) wire-speed in all situations.
机译:如今,许多高速互联网服务和应用需要高速多维数据包分类,但目前的高速分类经常使用昂贵和功率速度的硬件(如TCAM和FPGA)。在本文中,我们介绍了一种名为AM-TRIE(不对称多位Trie)的新型算法。我们的算法创造性地使用冗余表达来减少Trie的高度;使用压缩以降低存储成本并消除漏痕回来进一步增强搜索速度。此外,AM-TRIE是一个并行算法,非常适合网络处理器的“多线程和多核”特征;它具有良好的可扩展性,政策号的增加影响到其性能几乎没有。还提出了一种启发式场分部算法,我们证明了当给出了AM-轮胎的高度时存在最小存储成本分割解决方案。最后,基于Intel IXP2800网络处理器实现了原型。性能测试结果证明,AM-TRIE是高速且可扩展的,TCP / IP 6元组分类的吞吐量在所有情况下实现了OC-192(10 Gbps,每个数据包,IE20 MPPS)线速。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号