Skip to main content

High Performance Embedded Route Lookup Coprocessor for Network Processors

  • Conference paper
Networking and Mobile Computing (ICCNMC 2005)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 3619))

Included in the following conference series:

  • 691 Accesses

Abstract

Embedded Route Lookup Coprocessors (RLCs) are attractive for their potential in building high-performance Network Processors. But compared with conventional lookup schemes, it always imposes more severe restrictions on table size and power consumption, which poses challenge in the state of art. In this paper, we propose a novel lookup mechanism, Compounded CAM with Optimized Bitmap Compression (CCAM-OBC), which employs different lookup methods for prefixes of different length ranges, so as to combine the benefits of CAMs and bitmap compressed tries. With this scheme, table size, power consumption and update complexity are all well optimized while very high lookup throughput is achieved, which makes it a perfect solution to embedded RLC. For a real-life 130K-prefix route table, the implemented prototype performs more than 100 Million Packets Per Second (MPPS) with only 24KB TCAM, 48KB BCAM and 251KB SRAM. Furthermore, each update needs only 2 memory accesses averagely.

This work is supported by NSFC (No. 60173009 and 60373007), China 863 High-tech Plan (No. 2002AA103011-1 and 2003AA115110), China/Ireland Science and Technology Collaboration Research Fund (CI-2003-02) and the Specialized Research Fund for the Doctoral Program of Higher Education of China (No. 20040003048).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 149.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Gupta, P., Lin, S., McKeown, N.: Routing lookups in hardware at memory access speed. In: Proc. of IEEE INFOCOM 1998, pp. 1240–1247 (1998)

    Google Scholar 

  2. Degermark, M., Brodnik, A., Carlsson, S., Pink, S.: Small Forwarding Tables for Fast Routing Lookups. In: Proc. of ACM/SIGCOMM 1997, pp. 3–14 (1997)

    Google Scholar 

  3. Huang, N.F., Zhao, S.M., Pan, J.Y., Su, C.A.: A Fast Routing Lookup Scheme for Gigabit Switching Routers. In: Proc. of INFOCOM 1999, vol. 3, pp. 21–25 (1999)

    Google Scholar 

  4. Database of the Mae-West router from the IPMA Project (A joint effort of the University of Michigan and Merit Network), http://www.merit.edu/ipma

  5. Database of the SD_NAP route server (sd-nap-dmz.pch.net), from, http://archive.pch.net/archive/

  6. Database of the route-views.wide.routeviews.org route server from the Route-view Project (University of Oregon), http://www.routeviews.org

  7. Database of the RRC06 router from the RRCC Project (Routing Registry Consistency Check Project), http://www.ripe.net/rrcc/

  8. Shah, D., Gupta, P.: Fast Updating Algorithms for TCAMs. IEEE Micro Magazine 21(1), 36–47 (2001)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zheng, K., Liu, Z., Liu, B. (2005). High Performance Embedded Route Lookup Coprocessor for Network Processors. In: Lu, X., Zhao, W. (eds) Networking and Mobile Computing. ICCNMC 2005. Lecture Notes in Computer Science, vol 3619. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11534310_22

Download citation

  • DOI: https://doi.org/10.1007/11534310_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28102-3

  • Online ISBN: 978-3-540-31868-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics