AM-Trie: A High-Speed Parallel Packet Classification Algorithm for Network Processor

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3994)


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 present a novel algorithm, called AM-Trie (Asymmetrical Multi-bit Trie). Our algorithm creatively use redundant expression to shorten 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. Finally, a prototype is implemented based on Intel IXP2400 Network Processor. The performance testing result proves that AM-Trie is high-speed and scalable, the throughput of the whole system achieves 2.5 Gbps wire-speed in all situations.


  1. 1.
    Baboescu, F., Varghese, G.: Scalable packet classification. In: SIGCOMM, pp. 199–210 (2001)Google Scholar
  2. 2.
    Sumeet Singh, G.V., Baboescu, F., Wang, J.: Packet classification using multidimensional cutting. In: SIGCOMM, pp. 213–224 (2003)Google Scholar
  3. 3.
    Baboescu, F., Varghese, G.: Packet classification for core routers: Is there an alternative to cams? In: INFOCOM, pp. 53–63 (2003)Google Scholar
  4. 4.
    Karthik Lakshminarayanan, A.R., Venkatachary, S.: Algorithms for advanced packet classification with ternary cams. In: SIGCOMM (2005)Google Scholar
  5. 5.
    Shah, N.: Understanding network processors, Tech. Rep. (2001)Google Scholar
  6. 6.
    Network processing forum (npf),
  7. 7.
    Network systems design conference,
  8. 8.
    Wolf, T., Franklin, M.A.: Design tradeoff for embedded network processors. In: Schmeck, H., Ungerer, T., Wolf, L. (eds.) ARCS 2002. LNCS, vol. 2299, pp. 149–164. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  9. 9.
    BGP routing table analysis reports,
  10. 10.
    Srinivasan, V., Varghese, G.: Faster IP lookups using controlled prefix expansion. In: Measurement and Modeling of Computer Systems, pp. 1–10 (1998)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  1. 1.Dept. of Computer Science and TechnologyTsinghua UniversityBeijingP.R. China

Personalised recommendations