Chisel: A storageefficient, collision-free hash-based network processing architecture (2006)
| Venue: | In Proceedings of The 33rd Annual International Symposium on Computer Architecture (ISCA 33 |
| Citations: | 18 - 0 self |
BibTeX
@INPROCEEDINGS{Hasan06chisel:a,
author = {Jahangir Hasan and Srihari Cadambi and Venkatta Jakkula and Srimat Chakradhar},
title = {Chisel: A storageefficient, collision-free hash-based network processing architecture},
booktitle = {In Proceedings of The 33rd Annual International Symposium on Computer Architecture (ISCA 33},
year = {2006},
pages = {203--215},
publisher = {IEEE Computer Society}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Longest Prefix Matching (LPM) is a fundamental part of various network processing tasks. Previously proposed approaches for LPM result in prohibitive cost and power dissipation (TCAMs) or in large memory requirements and long lookup latencies (tries), when considering future line-rates, table sizes and key lengths (e.g., IPv6). Hash-based approaches appear to be an excellent candidate for LPM with the possibility of low power, compact storage, and O(1) latencies. However, there are two key problems that hinder their practical deployment as LPM solutions. First, naïve hash tables incur collisions and resolve them using chaining, adversely affecting worst-case lookup-rate guarantees that routers must provide. Second, hash functions cannot directly operate on wildcard bits, a requirement for LPM, and current solutions require either considerably complex hardware or large storage space. In this paper we propose a novel architecture which successfully addresses for the first time, both key problems in hash based LPM — making the following contributions: (1) We architect an LPM solution based upon a recently-proposed, collision-free hashing scheme called Bloomier filter, by eliminating its false positives in a storage efficient way. (2) We propose a novel scheme called prefix collapsing, which provides support for wildcard bits with small additional storage and reduced hardware complexity. (3) We exploit prefix collapsing and key characteristics found in real update traces to support fast and incremental updates, a feature generally not available in collision-free hashing schemes.
Keyphrases
collision-free hash-based network processing architecture key problem wildcard bit collision-free hashing scheme lpm solution prefix collapsing lpm result real update trace current solution reduced hardware complexity ve hash table compact storage storage efficient way large memory requirement key characteristic bloomier filter hash function long lookup latency table size various network processing task following contribution prohibitive cost power dissipation worst-case lookup-rate guarantee complex hardware hash-based approach novel scheme low power future line-rates novel architecture key length small additional storage practical deployment longest prefix matching incremental update false positive excellent candidate large storage space first time fundamental part
