Traffic measurement algorithm based on least recent used and Bloom filter
Aiming at the naïve algorithm’s deficiency of high false negative probability,a novel scheme called LRU-BF(least recent used ＆amp;Bloom filter) was presented.In order to achieve high accuracy,the algorithm adopted mechanisms of LRU eliminating and Bloom filter representation to separate the process...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2013-01-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/1000-436X(2013)01-0111-10/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Aiming at the naïve algorithm’s deficiency of high false negative probability,a novel scheme called LRU-BF(least recent used ＆amp;Bloom filter) was presented.In order to achieve high accuracy,the algorithm adopted mechanisms of LRU eliminating and Bloom filter representation to separate the process of heavy-hitter fliteration from the heavy-hitter recognition.Based on statistical theory,analytical expressions about upper-bound error probability were deduced.Simulated results indicate that LRU-BF can achieve space saving and lower error probabilit compared with Naïve-LRU algorithm.Meanwhile,it can also support the 10Gbit/s line-speed processing. |
|---|---|
| ISSN: | 1000-436X |