Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/1366230.1366273acmconferencesArticle/Chapter ViewAbstractPublication PagescfConference Proceedingsconference-collections
research-article

Multi-terabit ip lookup using parallel bidirectional pipelines

Published: 05 May 2008 Publication History

Abstract

To meet growing terabit link rates, highly parallel and scalable architectures are needed for IP lookup engines in next generation routers. This paper proposes an SRAM-based multi-pipeline architecture for multi-terabit rate IP lookup. The architecture consists of multiple bidirectional linear pipelines, where each pipeline stores part of a routing table. We address the challenges of realizing such a solution. Two mapping schemes with different granularity are proposed to balance the memory distribution over different pipelines as well as across different stages in each pipeline. Also, IP caching is adopted to facilitate processing multiple packets per clock cycle. Instead of using large reorder buffers and complex logic, a lightweight scheduler and several small output delay queues are developed to preserve the intra-flow packet order. Simulation experiments using real-life data show that the proposed 4-pipeline architecture can store a core routing table with over 200K unique routing prefixes in less than 2 MB of memory, and can achieve a high throughput of up to 18.75 billion packets per second (GPPS), i.e. 6 Tbps for minimum size (40 bytes) packets.

References

[1]
M.J. Akhbarizadeh, M. Nourani, R. Panigrahy, and S. Sharma. A TCAM-based parallel architecture for high-speed packet forwarding. IEEE Trans. Comput., 56(1):58--72, 2007.
[2]
Baboescu, D. M. Tullsen, G. Rosu, and S. Singh. A tree based router search engine architecture with single port memories. In Proc. ISCA, pages 123--133, 2005.
[3]
Basu and G. Narlikar. Fast incremental updates for pipelined forwarding engines. In Proc. INFOCOM, pages 64--74, 2003.
[4]
CACTI 4.2. http://quid.hpl.hp.com:9081/cacti/.
[5]
Cypress Sync SRAMs. http://www.cypress.com.
[6]
Eatherton, G. Varghese, and Z. Dittia. Tree bitmap: hardware/software IP lookups with incremental updates. SIGCOMM Comput. Commun. Rev., 34(2):97--122, 2004.
[7]
Jiang and V. K. Prasanna. A memory-balanced linear pipeline architecture for trie-based IP lookup. In Proc. Hot Interconnects (HotI '07), pages 83--90, 2007.
[8]
Jiang, Q. Wang, and V. K. Prasanna. Beyond TCAMs: An SRAM-based parallel multi-pipeline architecture for terabit IP lookup. In Proc. INFOCOM, 2008.
[9]
Juniper Networks T1600 Core Router. http://www.juniper.net.
[10]
S. Kim and S. Sahni. Efficient construction of pipelined multibit-trie router-tables. IEEE Trans. Comput., 56(1):32--43, 2007.
[11]
Kleinberg and E. Tardos. Algorithm Design. Addison-Wesley Longman Publishing Co., Inc., 2005.
[12]
Kumar, M. Becchi, P. Crowley, and J. Turner. CAMP: fast and efficient IP lookup architecture. In Proc. ANCS, pages 51--60, 2006.
[13]
Kumar, J. Maschmeyer, and P. Crowley. Exploiting locality to ameliorate packet queue contention and serialization. In Proc. Computing Frontiers (CF '06), pages 279--290, 2006.
[14]
Lu and S. Sahni. Packet forwarding using pipelined multibit tries. In Proc. ISCC, 2006.
[15]
A. McKee. Reflections on the memory wall. In Proc. Computing Frontiers (CF '04), page 162, 2004.
[16]
NLANR network traffic packet header traces. http://pma.nlanr.net/traces/.
[17]
Renesas CAM ASSP Series. http://www.renesas.com.
[18]
RIS Raw Data. http://data.ris.ripe.net.
[19]
A. Ruiz-Sanchez, E. W. Biersack, and W. Dabbous. Survey and taxonomy of IP address lookup algorithms. IEEE Network, 15(2):8--23, 2001.
[20]
Shi, Y. Zhang, J. Yu, B. Xu, B. Liu, and J. Li. On the extreme parallelism inside next-generation network processors. In Proc. INFOCOM, pages 1379--1387, 2007.
[21]
Singhal and R. Jain. Terabit switching: a survey of techniques and current products. Comput. Communications, 25:547--556, 2002.
[22]
Srinivasan and G. Varghese. Fast address lookups using controlled prefix expansion. ACM Trans. Comput. Syst., 17:1--40, 1999.
[23]
Zane, G. J. Narlikar, and A. Basu. CoolCAMs: Power-efficient TCAMs for forwarding engines. In Proc. INFOCOM, pages 42--52, 2003.
[24]
Zheng, C. Hu, H. Lu, and B. Liu. A TCAM-based distributed parallel IP lookup scheme and performance analysis. IEEE/ACM Trans. Netw., 14(4):863--875, 2006.

Cited By

View all

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
CF '08: Proceedings of the 5th conference on Computing frontiers
May 2008
334 pages
ISBN:9781605580777
DOI:10.1145/1366230
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 05 May 2008

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. bidirectional
  2. ip lookup
  3. pipeline
  4. sram
  5. terabit

Qualifiers

  • Research-article

Conference

CF '08
Sponsor:
CF '08: Computing Frontiers Conference
May 5 - 7, 2008
Ischia, Italy

Acceptance Rates

Overall Acceptance Rate 273 of 785 submissions, 35%

Upcoming Conference

CF '25

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 03 Mar 2025

Other Metrics

Citations

Cited By

View all

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media