Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/1088149.1088159acmconferencesArticle/Chapter ViewAbstractPublication PagesicsConference Proceedingsconference-collections
Article

A heterogeneously segmented cache architecture for a packet forwarding engine

Published: 20 June 2005 Publication History

Abstract

As network traffic continues to increase and with the requirement to process packets at line rates, high performance routers need to forward millions of packets every second. Even with an efficient lookup algorithm like the LC-trie, each packet needs upto 5 memory accesses. Earlier work shows that a single cache for the nodes of an LC-trie can reduce the number of external memory accesses.We observe that the locality characteristics of the level-one nodes of an LC-trie are significantly different from those of lower-level nodes. Hence, we propose a heterogeneously segmented cache architecture (HSCA) which uses separate caches for level-one and lower-level nodes each with carefully chosen sizes. We further improve the hit rate of the level-one nodes cache by introducing a weight-based replacement policy and an intelligent index bit selection scheme. To evaluate our cache scheme with realistic traces, we propose a synthetic trace generation method which emulates real traces and can generate traces with varying locality characteristics. The base HSCA scheme gives us upto 16% reduction in misses over the unified scheme. The optimizations further enhance this improvement to upto 25% for core router traces.

References

[1]
J-L. Baer, D. Low, P. crowley and N. Sidhwaney. Memory hierarchy design for a multiprocessor look-up engine. In Proc. of 12th Int. Conf. on Parallel Architectures and Compilation Techniques, 2003.
[2]
A. Brodnik, S. Carlsson, M. Degermark, and S. Pink. Small forwarding tables for fast routing lookups. In Proc. of ACM SIGCOMM'97, 1997.
[3]
T. Chieueh and K. Gopalan. Improving Route Lookup performance using network processer cache. In IEEE/ACM SC2002 Conf., 2002.
[4]
T. Chieueh and P. Pradhan, Cache memory design for network processors. In Proc. 6th Int. Symp. on High Performance Computer Architecture, 2000.
[5]
T. Chieueh and P. Pradhan. High-performance IP routing table lookup using CPU caching. In Proc. of ACM Communication Architectures, Protocols, and Applications (SIGCOMM'97), 1997.
[6]
K. C. Claffy. Internet Traffic Characterization. PhD thesis, University of California, San Diego, 1994
[7]
J. Hasan, S. Chandra, and T. N. Vijaykumar. Efficient use of memory bandwidth to improve network processor throughput. In Proc. of Int. Symp. on Computer Architecture, 2003.
[8]
R. Jain. Characteristics of destination address locality in computer networks: a comparison of caching schemes. Computer Networks and ISDN Systems, 1990.
[9]
B. Lampson, V. Srinivasan, and G. Varghese. IP lookup using multiway and multicolumn search. In Proc. of IEEE Infocom, 1998
[10]
S. Nilsson and G. Karlsson. IP-address lookup using LC-tries. IEEE Journal on Selected Areas in Communications, 1999.
[11]
G. Narlikar and F. Zane, Performance modeling for fast IP lookups. In Proc. of ACM SIGMETRICS, 2001
[12]
V. C. Ravikumar, R. Mahapatra, J. C. Liu. Modified LC-trie based efficient routing lookup. IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems (MASCOTS'02), 2002.
[13]
M. Ruiz-Sanchez, E. Biersack, and W. Dabbous. Survey and taxonomy of IP address lookup algorithms. IEEE Network Nagazine, 2001.
[14]
T. Sherwood, G. Varghese, and B. Calder. A pipelined memory architecture for high throughput network processors. In Proc. of Int. Symp. on Computer Architecture, 2003.
[15]
W. Shi, M. H. MacGregor, and P. Gburzynski. Synthetic trace generation for internet.IEEE Workshop on Workload Characterization (WWC-4), 2001.
[16]
D. Thiebaut, J. L. wolf, H. S. Stone. Synthetic traces for trace-driven simulation of cache memories. IEEE Transactions on Computers, 1992.
[17]
B. Talbot, T. Sherwood, and B. Lin. IP caching for terabit speed routers. Proc. of IEEE Globcom, 1999.
[18]
M. Waldvogel, G. Varghese, J. Turner and B. Plattner. Scalable high speed IP routing lookup. In Proc. of ACM SIGMETRICS, 2001
[19]
http://www.nadh.kth.se/~snilsson.

Cited By

View all
  • (2009)A Novel Cache Architecture and Placement Framework for Packet Forwarding EnginesIEEE Transactions on Computers10.1109/TC.2009.1858:8(1009-1025)Online publication date: 1-Aug-2009
  • (2008)Revisiting the Cache Effect on Multicore Multithreaded Network ProcessorsProceedings of the 2008 11th EUROMICRO Conference on Digital System Design Architectures, Methods and Tools10.1109/DSD.2008.41(317-324)Online publication date: 3-Sep-2008
  • (2006)Two-level mapping based cache index selection for packet forwarding enginesProceedings of the 15th international conference on Parallel architectures and compilation techniques10.1145/1152154.1152188(212-221)Online publication date: 16-Sep-2006

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
ICS '05: Proceedings of the 19th annual international conference on Supercomputing
June 2005
414 pages
ISBN:1595931678
DOI:10.1145/1088149
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: 20 June 2005

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Article

Conference

ICS05
Sponsor:
ICS05: International Conference on Supercomputing 2005
June 20 - 22, 2005
Massachusetts, Cambridge

Acceptance Rates

Overall Acceptance Rate 629 of 2,180 submissions, 29%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)2
  • Downloads (Last 6 weeks)0
Reflects downloads up to 01 Sep 2024

Other Metrics

Citations

Cited By

View all
  • (2009)A Novel Cache Architecture and Placement Framework for Packet Forwarding EnginesIEEE Transactions on Computers10.1109/TC.2009.1858:8(1009-1025)Online publication date: 1-Aug-2009
  • (2008)Revisiting the Cache Effect on Multicore Multithreaded Network ProcessorsProceedings of the 2008 11th EUROMICRO Conference on Digital System Design Architectures, Methods and Tools10.1109/DSD.2008.41(317-324)Online publication date: 3-Sep-2008
  • (2006)Two-level mapping based cache index selection for packet forwarding enginesProceedings of the 15th international conference on Parallel architectures and compilation techniques10.1145/1152154.1152188(212-221)Online publication date: 16-Sep-2006

View Options

Get Access

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media