A Power and Throughput-Efficient Packet Classifier with n Bloom Filters

Packet processing is a critical operation in a high-speed router, and in order for this router to achieve memory efficient and fast O(1) lookup operations, Bloom filters (BFs) have been widely used as a packet classifier to reduce expensive hash table accesses. However, it has been identified that a parallel packet classifier (PPC), using all n parallel BFs for a lookup, is neither power nor throughput efficient for high-speed routers. In this paper, we propose a multitiered packet classifier (MPC), both to save power and to improve throughput, with the same memory size as that of a PPC. While a PPC with n BFs consumes Θ(n) BF access complexity for a lookup, our MPC is designed to have the complexity which is probabilistically significantly less than Θ(n). Furthermore, by preprocessing a group of lookups in one cycle in an MPC, we assign each lookup to its associated BF at best effort, and consequently, obtain a higher throughput. With the same reason, as in preprocessing, our MPC design reduces a significant amount of power by preventing accesses to noninvolved BFs during a lookup. In simulation for flow identification with NLANR traces, we observed that the MPC throughput is increased by at most 100 percent, compared to a PPC. Additionally, our MPC shows 4.2 times power efficiency over an equivalent PPC, in terms of power saving.

[1]  D. Sy,et al.  CAPTRA: coordinated packet traceback , 2006, 2006 5th International Conference on Information Processing in Sensor Networks.

[2]  Miad Faezipour,et al.  A Single-Cycle Multi-Match Packet Classification Engine Using TCAMs , 2006, 14th IEEE Symposium on High-Performance Interconnects (HOTI'06).

[3]  B. Dipert,et al.  SPECIAL-PURPOSE SRAMS SMOOTH THE RIDE , 1999 .

[4]  Anand Rangarajan,et al.  Algorithms for advanced packet classification with ternary CAMs , 2005, SIGCOMM '05.

[5]  Timothy Sherwood,et al.  Virtually Pipelined Network Memory , 2006, 2006 39th Annual IEEE/ACM International Symposium on Microarchitecture (MICRO'06).

[6]  Jeffrey Considine,et al.  Informed content delivery across adaptive overlay networks , 2002, IEEE/ACM Transactions on Networking.

[7]  Craig Partridge,et al.  Hash-based IP traceback , 2001, SIGCOMM.

[8]  Sartaj Sahni,et al.  Packet classification using two-dimensional multibit tries , 2005, 10th IEEE Symposium on Computers and Communications (ISCC'05).

[9]  Bernhard Plattner,et al.  Scalable high speed IP routing lookups , 1997, SIGCOMM '97.

[10]  Haoyu Song,et al.  Fast hash table lookup using extended bloom filter: an aid to network processing , 2005, SIGCOMM '05.

[11]  David E. Taylor,et al.  Longest prefix matching using bloom filters , 2006, TNET.

[12]  Patrick Crowley,et al.  Peacock Hashing: Deterministic and Updatable Hashing for High Performance Networking , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[13]  Andreas Veneris,et al.  L-CBF: A Low-Power, Fast Counting Bloom Filter Architecture , 2008, IEEE Trans. Very Large Scale Integr. Syst..

[14]  Taskin Koçak,et al.  Energy-Efficient Pipelined Bloom Filters for Network Intrusion Detection , 2006, 2006 IEEE International Conference on Communications.

[15]  Kai-Min Chung,et al.  Why simple hash functions work: exploiting the entropy in a data stream , 2008, SODA '08.

[16]  Jie Wu,et al.  Theory and Network Applications of Dynamic Bloom Filters , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[17]  Andrei Broder,et al.  Network Applications of Bloom Filters: A Survey , 2004, Internet Math..

[18]  Grigore Rosu,et al.  A tree based router search engine architecture with single port memories , 2005, 32nd International Symposium on Computer Architecture (ISCA'05).

[19]  George Varghese,et al.  Fast and scalable layer four switching , 1998, SIGCOMM '98.

[20]  V. Gopalakrishnan,et al.  Fully planar 0.562/spl mu/m/sup 2/ T-RAM cell in a 130nm SOI CMOS logic technology for high-density high-performance SRAMs , 2004, IEDM Technical Digest. IEEE International Electron Devices Meeting, 2004..

[21]  Abhishek Kumar,et al.  Efficient and scalable query routing for unstructured peer-to-peer networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[22]  Patrick Crowley,et al.  Segmented hash , 2005, 2005 Symposium on Architectures for Networking and Communications Systems (ANCS).

[23]  Kang Li,et al.  Approximate caches for packet classification , 2004, IEEE INFOCOM 2004.

[24]  David A. Patterson,et al.  Computer Architecture: A Quantitative Approach , 1969 .

[25]  John W. Lockwood,et al.  Deep packet inspection using parallel bloom filters , 2004, IEEE Micro.

[26]  Li Fan,et al.  Summary cache: a scalable wide-area web cache sharing protocol , 2000, TNET.

[27]  John W. Lockwood,et al.  Fast and Scalable Pattern Matching for Network Intrusion Detection Systems , 2006, IEEE Journal on Selected Areas in Communications.

[28]  Haoyu Song,et al.  Packet classification using coarse-grained tuple spaces , 2006, 2006 Symposium on Architecture For Networking And Communications Systems.

[29]  Mukesh Singhal,et al.  A novel cache architecture to support layer-four packet classification at memory access speeds , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[30]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[31]  Laxmi N. Bhuyan,et al.  EaseCAM: an energy and storage efficient TCAM-based router architecture for IP lookup , 2005, IEEE Transactions on Computers.