A low power lookup technique for multi-hashing network applications

I Kaya; T Kocak

doi:10.1109/ISVLSI.2006.3

A low power lookup technique for multi-hashing network applications

I Kaya
, T Kocak

Research output: Chapter in Book/Report/Conference proceeding › Conference Contribution (Conference Proceeding)

13 Citations (Scopus)

483 Downloads (Pure)

Abstract

Many network security applications require large virus signature sets to be maintained, retrieved, and compared against the network streams. Software applications frequently fail to identify so many signatures through comparisons at very high network speeds. Bloom filters are one of the main multi-hashing schemes utilized in hardware to support this level of security. Nevertheless Bloom filters consume significant power to store, retrieve and lookup virus signatures owing to many hash function computations required to index to the memory. We present a novel lookup technique and architecture to decrease the power consumption of multi-hashing schemes, predominantly Bloom filters, in hardware. The theoretical analysis has shown that power gain achieved through new lookup technique can go up to 90%. Simulation results with three different classes of the hash functions embedded into the Bloom filter have indicated that power consumption of the Bloom filters can be considerably decreased by employing the low power lookup technique

Translated title of the contribution	A low power lookup technique for multi-hashing network applications
Original language	English
Title of host publication	IEEE Computer Society Annual Symposium on Emerging VLSI Technologies and Architectures 2006, Karlsruhe, Germany
Publisher	Institute of Electrical and Electronics Engineers (IEEE)
Pages	179 - 184
Number of pages	6
ISBN (Print)	0769525334
DOIs	https://doi.org/10.1109/ISVLSI.2006.3
Publication status	Published - Mar 2006
Event	IEEE Computer Society Annual Symposium on Emerging VLSI Technologies and Architectures - Karlsruhe, Germany Duration: 1 Mar 2006 → …

Conference

Conference	IEEE Computer Society Annual Symposium on Emerging VLSI Technologies and Architectures
Country/Territory	Germany
City	Karlsruhe
Period	1/03/06 → …

Bibliographical note

Conference Organiser: IEEE Computer Society
Rose publication type: Conference contribution

Terms of use: Copyright © 2006 IEEE. Reprinted from IEEE Computer Society Annual Symposium on Emerging VLSI Technologies and Architectures, 2006.

This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the University of Bristol's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to [email protected].

By choosing to view this document, you agree to all provisions of the copyright laws protecting it.

Access to Document

10.1109/ISVLSI.2006.3

Kaya IEEE VLSI 2006Accepted author manuscript, 313 KB

http://hdl.handle.net/1983/1468

Handle.net

Persistent link

Cite this

@inproceedings{67e936e694b74044a28b23995c40c98d,

title = "A low power lookup technique for multi-hashing network applications",

abstract = "Many network security applications require large virus signature sets to be maintained, retrieved, and compared against the network streams. Software applications frequently fail to identify so many signatures through comparisons at very high network speeds. Bloom filters are one of the main multi-hashing schemes utilized in hardware to support this level of security. Nevertheless Bloom filters consume significant power to store, retrieve and lookup virus signatures owing to many hash function computations required to index to the memory. We present a novel lookup technique and architecture to decrease the power consumption of multi-hashing schemes, predominantly Bloom filters, in hardware. The theoretical analysis has shown that power gain achieved through new lookup technique can go up to 90\%. Simulation results with three different classes of the hash functions embedded into the Bloom filter have indicated that power consumption of the Bloom filters can be considerably decreased by employing the low power lookup technique",

author = "I Kaya and T Kocak",

note = "Conference Organiser: IEEE Computer Society Rose publication type: Conference contribution Terms of use: Copyright {\textcopyright} 2006 IEEE. Reprinted from IEEE Computer Society Annual Symposium on Emerging VLSI Technologies and Architectures, 2006. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the University of Bristol's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to [email protected]. By choosing to view this document, you agree to all provisions of the copyright laws protecting it. ; IEEE Computer Society Annual Symposium on Emerging VLSI Technologies and Architectures ; Conference date: 01-03-2006",

year = "2006",

month = mar,

doi = "10.1109/ISVLSI.2006.3",

language = "English",

isbn = "0769525334",

pages = "179 -- 184",

booktitle = "IEEE Computer Society Annual Symposium on Emerging VLSI Technologies and Architectures 2006, Karlsruhe, Germany",

publisher = "Institute of Electrical and Electronics Engineers (IEEE)",

address = "United States",

}

Kaya, I & Kocak, T 2006, A low power lookup technique for multi-hashing network applications. in IEEE Computer Society Annual Symposium on Emerging VLSI Technologies and Architectures 2006, Karlsruhe, Germany. Institute of Electrical and Electronics Engineers (IEEE), pp. 179 - 184, IEEE Computer Society Annual Symposium on Emerging VLSI Technologies and Architectures, Karlsruhe, Germany, 1/03/06. https://doi.org/10.1109/ISVLSI.2006.3

A low power lookup technique for multi-hashing network applications. / Kaya, I; Kocak, T.
IEEE Computer Society Annual Symposium on Emerging VLSI Technologies and Architectures 2006, Karlsruhe, Germany. Institute of Electrical and Electronics Engineers (IEEE), 2006. p. 179 - 184.

Research output: Chapter in Book/Report/Conference proceeding › Conference Contribution (Conference Proceeding)

TY - GEN

T1 - A low power lookup technique for multi-hashing network applications

AU - Kaya, I

AU - Kocak, T

N1 - Conference Organiser: IEEE Computer Society Rose publication type: Conference contribution Terms of use: Copyright © 2006 IEEE. Reprinted from IEEE Computer Society Annual Symposium on Emerging VLSI Technologies and Architectures, 2006. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the University of Bristol's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to [email protected]. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.

PY - 2006/3

Y1 - 2006/3

N2 - Many network security applications require large virus signature sets to be maintained, retrieved, and compared against the network streams. Software applications frequently fail to identify so many signatures through comparisons at very high network speeds. Bloom filters are one of the main multi-hashing schemes utilized in hardware to support this level of security. Nevertheless Bloom filters consume significant power to store, retrieve and lookup virus signatures owing to many hash function computations required to index to the memory. We present a novel lookup technique and architecture to decrease the power consumption of multi-hashing schemes, predominantly Bloom filters, in hardware. The theoretical analysis has shown that power gain achieved through new lookup technique can go up to 90%. Simulation results with three different classes of the hash functions embedded into the Bloom filter have indicated that power consumption of the Bloom filters can be considerably decreased by employing the low power lookup technique

AB - Many network security applications require large virus signature sets to be maintained, retrieved, and compared against the network streams. Software applications frequently fail to identify so many signatures through comparisons at very high network speeds. Bloom filters are one of the main multi-hashing schemes utilized in hardware to support this level of security. Nevertheless Bloom filters consume significant power to store, retrieve and lookup virus signatures owing to many hash function computations required to index to the memory. We present a novel lookup technique and architecture to decrease the power consumption of multi-hashing schemes, predominantly Bloom filters, in hardware. The theoretical analysis has shown that power gain achieved through new lookup technique can go up to 90%. Simulation results with three different classes of the hash functions embedded into the Bloom filter have indicated that power consumption of the Bloom filters can be considerably decreased by employing the low power lookup technique

U2 - 10.1109/ISVLSI.2006.3

DO - 10.1109/ISVLSI.2006.3

M3 - Conference Contribution (Conference Proceeding)

SN - 0769525334

SP - 179

EP - 184

BT - IEEE Computer Society Annual Symposium on Emerging VLSI Technologies and Architectures 2006, Karlsruhe, Germany

PB - Institute of Electrical and Electronics Engineers (IEEE)

T2 - IEEE Computer Society Annual Symposium on Emerging VLSI Technologies and Architectures

Y2 - 1 March 2006

ER -

A low power lookup technique for multi-hashing network applications

Abstract

Conference

Bibliographical note

Access to Document

Handle.net

Fingerprint

Cite this