research-article

Progressive hashing for packet processing using set associative memory

Authors:

Socrates Demetriades,

Rami MelhemAuthors Info & Claims

ANCS '09: Proceedings of the 5th ACM/IEEE Symposium on Architectures for Networking and Communications Systems

Pages 153 - 162

https://doi.org/10.1145/1882486.1882521

Published: 19 October 2009 Publication History

Abstract

As the Internet grows, both the number of rules in packet filtering databases and the number of prefixes in IP lookup tables inside the router are growing. The packet processing engine is a critical part of the Internet router as it is used to perform packet forwarding (PF) and packet classification (PC). In both applications, processing has to be at wire speed. It is common to use hash-based schemes in packet processing engines; however, the downside of classic hashing techniques such as overflow and worst case memory access time, has to be dealt with. Implementing hash tables using set associative memory has the property that each bucket of a hash table can be searched in one memory cycle outperforming the conventional Ternary CAMs in terms of power and scalability.

In this paper we present "Progressive Hashing" (PH), a general open addressing hash-based packet processing scheme for Internet routers using the set associative memory architecture. Our scheme is an extension of the multiple hashing scheme and is amendable to high-performance hardware implementation with low overflow and low memory access latency. We show by experimenting with real IP lookup tables and synthetic packet filtering databases that PH reduces the overflow over the multiple hashing. The proposed PH processing engine is estimated to achieve an average processing speed of 160 Gbps for the PC application and 320 Gbps for the PF application.

References

[1]

Y. Azar, A. Broder, A. Karlin, and E. Upfal. Balanced allocations. SIAM J. Comput., 29(1):180--200, 2000.

Digital Library

[2]

F. Baboescu, D. Tullse, G. Rosu, and S. Singh. A tree based router search engine architecture with single port memories. SIGARCH Comput. Archit. News, 33(2):123--133, 2005.

Digital Library

[3]

S. Cho, J. Martin, R. Xu, M. Hammoud, and R. Melhem. Ca-ram: A high-performance memory substrate for search-intensive applications. pages 230--241. IEEE ISPASS, 2007.

[4]

T. Cormen, C. Leiserson, R. Rivest, and C. Stien. Introdcution to Algorithms. McGraw Hill, 2003.

Digital Library

[5]

S. Dharmapurikar, H. Song, J. Turner, and J. Lockwood. Fast ppacket classification using bloom filters. In ACM/IEEE ANCS, pages 61--70, New York, NY, USA, 2006.

Digital Library

[6]

P. Gupta and N. Mckeown. Packet classification using hierarchical intelligent cuttings. In IEEE Hoti, pages 34--41, 1999.

Digital Library

[7]

P. Gupta and N. Mckeown. Algorithms for packet classification. IEEE Network, 15(2):24--32, 2001.

Digital Library

[8]

M. Hanna, S. Demetriades, S. Cho, and R. Melhem. Chap: Enabling efficient hardware-based multiple hash schemes for ip lookup. pages 756--769. IFIP Networking, 2009.

Digital Library

[9]

S. Kaxiras and G. Keramidas. Ipstash: A power-efficient memory architecture for ip-lookup. pages 361--373. Micro'03, 2003.

Digital Library

[10]

R. A. Kempke and A. J. McAuley. Ternary cam memory architecture and methodology. http://www.freepatentsonline.com/5841874.html, 1998. United States Patent 5841874.

[11]

A. Kirsch and M. Mitzenmacher. Simple summaries for hashing with choices. IEEE/ACM Trans. Netw., 16(1):218--231, 2008.

Digital Library

[12]

K. Lakshminarayanan, A. Rangarajan, and S. Venkatachary. Algorithms for advanced packet classification with ternary cams. pages 193--204. ACM Sigcomm, 2005.

Digital Library

[13]

A. Partow. General purpose hash function algorithms library. http://www.partow.net/.

[14]

M. Ramakrishna and et Al. Efficient hardware hashing functions for high performance computers. IEEE Trans. on Comp., 46(12):1378--1381, 1997.

Digital Library

[15]

Y. Rekhter and T. Li. An architecure for ip address allocation with cidr. RFC, 1993.

[16]

RIS. Routing information service. http://www.ripe.net/ris/, 2006.

[17]

S. Singh, F. Baboescu, G. Varghese, and J. Wang. Packet classification using multidimensional cutting. pages 213--224, New York, NY, USA, 2003. ACM SIGCOMM.

Digital Library

[18]

H. Song, S. Dharmapurikar, J. Turner, and J. Lockwood. Fast hash table lookup using extended bloom filter: an aid to network processing. In ACM SIGCOMM, pages 181--192, New York, NY, USA, August 2005. ACM.

Digital Library

[19]

H. Song, J. Turner, and S. Dharmapurikar. Packet classification using coarse-grained tuple spaces. In ACM/IEEE ANCS, pages 41--50, New York, NY, USA, 2006. ACM.

Digital Library

[20]

E. Spitznagel, D. Taylor, and J. Turner. Packet classification using extended tcams. pages 181--192. IEEE ICNP, 2003.

Digital Library

[21]

V. Srinivasan, S. Suri, and G. Varghese. Packet classification using tuple space search. In ACM SIGCOMM, pages 135--146, New York, NY, USA, 1999.

Digital Library

[22]

V. Srinivasan and G. Varghese. Fast address lookups using controlled prefix expansion. ACM Trans. Comput. Syst., 17(1):1--40, 1999.

Digital Library

[23]

D. Taylor and J. Turner. Classbench: A packet classification benchmark. In IEEE INFOCOM, volume 15, pages 499--511, 2007.

Digital Library

[24]

D. E. Taylor and J. S. Turner. Scalable packet classification using distributed crossproducing of field labels. volume 1, pages 269--280. IEEE Infocom, 2005.

[25]

D. E. Turner. Survey and taxonomy of packet classification techniques. ACM Computing Surveys, 37(3):238--275, 2005.

Digital Library

[26]

G. Varghese. Network Algorithmics: An Interdisciplinary Approach to Designing Fast Networked Devices. Morgan Kaufmann, 2005.

Digital Library

[27]

Y. Wang, U. Bhattacharya, F. Hamzaoglu, P. Kolar, Y. Ng, L. Wei, Y. Zhang, K. Zhang, and M. Bohr. A 4.0 ghz 291 mb voltage-scalable sram design in 32nm high-k metal-gate cmos with integrated power management. In IEEE ISSCC, pages 456--457, 2009.

Cited By

Fairouz AAbusultan MFedorov VKhatri S(2021)Hardware Acceleration of Hash Operations in Modern MicroprocessorsIEEE Transactions on Computers10.1109/TC.2020.301085570:9(1412-1426)Online publication date: 1-Sep-2021
https://doi.org/10.1109/TC.2020.3010855
Islam MKhan J(2021)CP-Trie: Cumulative PopCount based Trie for IPv6 Routing Table Lookup in Software and ASIC2021 IEEE 22nd International Conference on High Performance Switching and Routing (HPSR)10.1109/HPSR52026.2021.9481816(1-8)Online publication date: 7-Jun-2021
https://doi.org/10.1109/HPSR52026.2021.9481816
Fairouz AAbusultan MKhatri SBehjat LHan JVelev MChen D(2017)Circuit Level Design of a Hardware Hash Unit for use in Modern MicroprocessorsProceedings of the Great Lakes Symposium on VLSI 201710.1145/3060403.3060451(101-106)Online publication date: 10-May-2017
https://dl.acm.org/doi/10.1145/3060403.3060451
Show More Cited By

Index Terms

Progressive hashing for packet processing using set associative memory
1. Networks
  1. Network components
    1. Intermediate nodes
      1. Routers

Recommendations

Advanced hashing schemes for packet forwarding using set associative memory architectures

Building a high performance IP packet forwarding (PF) engine remains a challenge due to increasingly stringent throughput requirements and the growing size of IP forwarding tables. The router has to match the incoming packet's IP address against all ...
Packet Classification Using Multi-iteration RFC
COMPSACW '13: Proceedings of the 2013 IEEE 37th Annual Computer Software and Applications Conference Workshops

Packet Classification is an enabling technique for the future Internet by classifying incoming packets into forwarding classes to fulfill different service requirements. It is necessary for IP routers to provide network security and differentiated ...
High-performance packet processing engines using set-associative memory architectures

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

ANCS '09: Proceedings of the 5th ACM/IEEE Symposium on Architectures for Networking and Communications Systems

October 2009

227 pages

ISBN:9781605586304

DOI:10.1145/1882486

General Chairs:
Peter Onufryk
IDT
,
K. K. Ramakrishnan
AT&T Labs - Research
,
Program Chairs:
Patrick Crowley
Washington University in St. Louis
,
John Wroclawski
USC

Copyright © 2009 ACM.

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

SIGCOMM: ACM Special Interest Group on Data Communication
SIGARCH: ACM Special Interest Group on Computer Architecture
IEEE-CS\TCCA: TC on Computer Arhitecture

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 19 October 2009

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

ANCS '09

Sponsor:

SIGCOMM
SIGARCH
IEEE-CS\TCCA

ANCS '09: Symposium on Architecture for Networking and Communications Systems

October 19 - 20, 2009

New Jersey, Princeton

Acceptance Rates

Overall Acceptance Rate 88 of 314 submissions, 28%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

8
Total Citations
View Citations
152
Total Downloads

Downloads (Last 12 months)3
Downloads (Last 6 weeks)0

Reflects downloads up to 10 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

Fairouz AAbusultan MFedorov VKhatri S(2021)Hardware Acceleration of Hash Operations in Modern MicroprocessorsIEEE Transactions on Computers10.1109/TC.2020.301085570:9(1412-1426)Online publication date: 1-Sep-2021
https://doi.org/10.1109/TC.2020.3010855
Islam MKhan J(2021)CP-Trie: Cumulative PopCount based Trie for IPv6 Routing Table Lookup in Software and ASIC2021 IEEE 22nd International Conference on High Performance Switching and Routing (HPSR)10.1109/HPSR52026.2021.9481816(1-8)Online publication date: 7-Jun-2021
https://doi.org/10.1109/HPSR52026.2021.9481816
Fairouz AAbusultan MKhatri SBehjat LHan JVelev MChen D(2017)Circuit Level Design of a Hardware Hash Unit for use in Modern MicroprocessorsProceedings of the Great Lakes Symposium on VLSI 201710.1145/3060403.3060451(101-106)Online publication date: 10-May-2017
https://dl.acm.org/doi/10.1145/3060403.3060451
Fairouz AKhatri S(2017)An FPGA-Based Coprocessor for Hash Unit Acceleration2017 IEEE International Conference on Computer Design (ICCD)10.1109/ICCD.2017.53(301-304)Online publication date: Nov-2017
https://doi.org/10.1109/ICCD.2017.53
Fairouz AAbusultan MKhatri S(2016)A novel hardware hash unit design for modern microprocessors2016 IEEE 34th International Conference on Computer Design (ICCD)10.1109/ICCD.2016.7753316(412-415)Online publication date: Oct-2016
https://doi.org/10.1109/ICCD.2016.7753316
Bando MLin YChao H(2012)FlashTrieIEEE/ACM Transactions on Networking10.1109/TNET.2012.218864320:4(1262-1275)Online publication date: 1-Aug-2012
https://dl.acm.org/doi/10.1109/TNET.2012.2188643
Hanna MCho SMelhem R(2011)A novel scalable IPv6 lookup scheme using compressed pipelined triesProceedings of the 10th international IFIP TC 6 conference on Networking - Volume Part I10.5555/2008780.2008820(406-419)Online publication date: 9-May-2011
https://dl.acm.org/doi/10.5555/2008780.2008820
Hanna MCho SMelhem R(2011)A Novel Scalable IPv6 Lookup Scheme Using Compressed Pipelined TriesNETWORKING 201110.1007/978-3-642-20757-0_32(406-419)Online publication date: 2011
https://doi.org/10.1007/978-3-642-20757-0_32

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents