Skip to main content

Low Power and Storage Efficient Parallel Lookup Engine Architecture for IP Packets

  • Conference paper
Advances in Computer Science and Engineering (CSICC 2008)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 6))

Included in the following conference series:

  • 678 Accesses

Abstract

Ternary Content-Addressable Memories are becoming very popular for designing high-throughput address lookup engines on routers: they are fast, cost-effective and simple to manage. Despite the TCAMs speed, their high power consumption is their major drawback.In this document, we designed a heuristic to match entries in TCAM stages so that only a bounded number of entries are looked up during the search operation.

The performance evaluation of the proposed approach shows that it can save considerable amount of routing table’s power consumption.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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.: Algorithms for Routing Lookups and Packet Classification. doctoral dissertation, Dept. Computer Science, Stanford Univ. (2000)

    Google Scholar 

  2. Ravikumar, V.C., Mahapatra, R.N.: TCAM Architecture for IP lookup Using Prefix Properties. IEEE Micro. 24(2), 60–69 (2004)

    Article  Google Scholar 

  3. Taylor, D.E.: Models, Algorithms, and Architectures for scalable packet classification, Doctoral Thesis, Washington Univ. (August 2004)

    Google Scholar 

  4. Zane, F., Narlikar, G., Basu, A.: CoolCAMs: Power-Efficient TCAMs for Forwarding Engines. In: Proc. IEEE Infocom 2003, pp. 42–52. IEEE Press, Los Alamitos (2003)

    Google Scholar 

  5. Panigrahy, R., Sharma, S.: Reducing TCAM Power Consumption and Increasing Throughput. In: Proc. 10th Symp. High- Performance Interconnects (HOTI 2002), pp. 107–112. IEEE CS Press, Los Alamitos (2002)

    Chapter  Google Scholar 

  6. Liu, H.: Routing Table Compaction in Ternary CAM. IEEE Micro. 22(1), 58–64 (2002)

    Article  Google Scholar 

  7. Akhbarizadeh, M.J., Nourani, M.: An IP Packet Forwarding Technique Based on Partitioned Lookup Table. In: Proc. IEEE Int’lConf. Comm (ICC 2002), pp. 2263–2267 (2002)

    Google Scholar 

  8. Lysecky, R., Vahid, F.: On-chip logic minimization. In: Proceedings of the 40th conference on Design automation, pp. 334–337. ACM Press, New York (2003)

    Google Scholar 

  9. Mahini, A., Berangi, R., Mahini, H.: A Power Efficient Approach for Ternary Content Addressable Memory based, IP Lookup Engines in Internet Routers. In: CSICC 2007, pp. 748–755 (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mahini, A., Berangi, R., Mohtashami, H., Mahini, H. (2008). Low Power and Storage Efficient Parallel Lookup Engine Architecture for IP Packets. In: Sarbazi-Azad, H., Parhami, B., Miremadi, SG., Hessabi, S. (eds) Advances in Computer Science and Engineering. CSICC 2008. Communications in Computer and Information Science, vol 6. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89985-3_88

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-89985-3_88

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-89984-6

  • Online ISBN: 978-3-540-89985-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics