Longest prefix matching using bloom filters

Dharmapurikar, Sarang; Krishnamurthy, Praveen Thaggikuppe; Taylor, David E.

doi:10.1145/863955.863979

Cited by 188 publications

(134 citation statements)

References 9 publications

Supporting

Mentioning

131

Contrasting

Order By: Relevance

“…In [15], the authors propose the construction of hash tables with different lengths and searching order in each table is defined based on structure of binary search trie. Meanwhile, [16,17] launched the idea of using the hash which is associated with bloom filter model for packets classification.…”

Section: Vietnam Academy Of Science and Technologymentioning

confidence: 99%

A Packet Classification Algorithm on Multi-Way Priority Trie

Nhat¹,

Manh²

2017

JCC

View full text Add to dashboard Cite

Abstract. Packet classification is a vital function of network devices such as routers, firewalls, IPS, IDS, etc. Speed of packet classification is a key factor that decides to bandwidth of a network equipment. The field of packet classification speed enhancement has attracted a significant number of researchers. In this paper, we propose a packet classification algorithm based on the idea of priority trie and multi-way trie. The accuracy and efficiency of the proposed algorithm are both theoretically and experimentally proved.

show abstract

Section: Vietnam Academy Of Science and Technologymentioning

confidence: 99%

A Packet Classification Algorithm on Multi-Way Priority Trie

Nhat¹,

Manh²

2017

JCC

View full text Add to dashboard Cite

show abstract

“…Bloom Filtering:-It is initially proposed by Dhamapurikar et al [14]. The destination IP address of the packet is used for IP address lookup [15].…”

Section: Adaptive Filterin/g:-mentioning

confidence: 99%

Filtering Mechanisms on Internet Protocol.

Vijayan¹,

SumeenaP²

2017

IJAR

View full text Add to dashboard Cite

“…Bloom filters are widely employed in software (i.e., in web caches, or in dictionary implementations) but recently several proposals incorporated Bloom filters in hardware [8,15,10,21]. Way-selection with Bloom filters is shown in Fig.…”

Section: Decaying Bloom Filtersmentioning

confidence: 99%

Recruiting Decay for Dynamic Power Reduction in Set-Associative Caches

Κεραμίδας

Xekalakis

2009

Transactions on High-Performance Embedded Architectures and Compilers II

View full text Add to dashboard Cite

Abstract. In this paper, we propose a novel approach to reduce dynamic power in set-associative caches that leverages on a leakage-saving proposal, namely Cache Decay. We thus open the possibility to unify dynamic and leakage management in the same framework. The main intuition is that in a decaying cache, dead lines in a set need not be searched. Thus, rather than trying to predict which cache way holds a specific line, we predict, for each way, whether the line could be live in it. We access all the ways that possibly contain the live line and we call this way selection. In contrast to way-prediction, way-selection cannot be wrong: the line is either in the selected ways or not in the cache. The important implication is that we have a fixed hit time -indispensable for both performance and ease-of-implementation reasons. One would expect way-selection to be inferior to sophisticated way-prediction in terms of the total ways accessed, but in fact it can even do better. To achieve this level of accuracy we use Decaying Bloom filters to track only the live lines in ways -dead lines are automatically purged. We offer efficient implementations of such autonomously Decaying Bloom filters, using novel quasi-static cells. Our prediction approach affords us high-accuracy in narrowing the choice of ways for hits as well as the ability to predict misses -a known weakness of way-prediction -thus outperforming sophisticated way-prediction. Furthermore, our approach scales significantly better than way-prediction to higher associativity. We show that decay is a necessary component in this approach -way-selection and Bloom filters alone cannot compete with sophisticated way-prediction. We compare our approach to Multi-MRU and we show that without even considering leakage savings -we surpass it terms of relative power savings and in relative energy-delay in 4-way (9%) and more so in 8-way (20%) and 16-way caches (31%).

show abstract

Longest prefix matching using bloom filters

Cited by 188 publications

References 9 publications

A Packet Classification Algorithm on Multi-Way Priority Trie

A Packet Classification Algorithm on Multi-Way Priority Trie

Filtering Mechanisms on Internet Protocol.

Recruiting Decay for Dynamic Power Reduction in Set-Associative Caches

Contact Info

Product

Resources

About