作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2007, Vol. 33 ›› Issue (05): 106-108.

• 网络与通信 • 上一篇    下一篇

网络处理器中最长匹配算法的优化

陈 静,吴 非,黄 祚   

  1. (华中科技大学计算机科学与技术学院信息存储国家专业实验室暨教育部重点实验室,武汉 430074)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2007-03-05 发布日期:2007-03-05

Improvement of Longest Prefix Match Algorithm in Network Processor

CHEN Jing, WU Fei, HUANG Zuo   

  1. (Peripheral Memory System Laboratory of the Ministry of Education, School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan 430074)
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-03-05 Published:2007-03-05

摘要: 传统的最长匹配路由算法都是基于双线程并行查找方法来实现的,没有充分利用新一代网络处理器无延时线程切换和可编程的特点。该文基于IXP2350平台对传统的最长匹配算法进行了优化改进,充分利用硬件特性和微引擎中异步内存读写的特点,用单线程来完成整个路由的查找。实验测试结果表明,这种优化改进使路由器的包转发效率提高了20%。

关键词: 网络处理器, 最长匹配算法, 嵌入式系统, 微引擎, 微码

Abstract: The realization of longest prefix match algorithm traditionally uses double threads to lookup the route information, which not fully utilize the network processor’s no-delay thread switching and programmable characters. This article discusses how to fully utilize the hardware characteristics and asynchronous read/write of memory method in the micro engine on the IXP2350 platform to realize the whole route lookup with only one thread. The test result also shows that a performance improves 20% than double threads realization on the micro engine.

Key words: Network processor, Longest prefix match algorithm, Embedded system, Micro engine, Microcode