Early traffic sampling algorithm based on SSCBF
An early traffic sampling algorithm was proposed based on same source and combination Bloom filter (SSCBF),a structure with two Bloom filters:flow-sampling vector and packet-count vector.The hash functions of the two vectors were same but the counters’ widths were different.This structure separated...
Saved in:
Main Authors: | , , , |
---|---|
Format: | Article |
Language: | zho |
Published: |
Editorial Department of Journal on Communications
2014-10-01
|
Series: | Tongxin xuebao |
Subjects: | |
Online Access: | http://www.joconline.com.cn/zh/article/doi/10.3969/j.issn.1000-436x.2014.10.014/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
_version_ | 1841539714963734528 |
---|---|
author | Ying HOU Yun-fei GUO Hai HUANG Kai WANG |
author_facet | Ying HOU Yun-fei GUO Hai HUANG Kai WANG |
author_sort | Ying HOU |
collection | DOAJ |
description | An early traffic sampling algorithm was proposed based on same source and combination Bloom filter (SSCBF),a structure with two Bloom filters:flow-sampling vector and packet-count vector.The hash functions of the two vectors were same but the counters’ widths were different.This structure separated the sampling judgment and the packets counting.That could avoid the interference with packet count vector by the finished sampling flows.The false positive rate of the algorithm and an adjustable parameter α,ratio of the two vectors’ widths,were analyzed.The analysis and experiments demonstrate that with suitable α,the algorithm can achieve higher accuracy without increasing the space complexity. |
format | Article |
id | doaj-art-27d7eb9b6ff844e6bc9ceb5d813decca |
institution | Kabale University |
issn | 1000-436X |
language | zho |
publishDate | 2014-10-01 |
publisher | Editorial Department of Journal on Communications |
record_format | Article |
series | Tongxin xuebao |
spelling | doaj-art-27d7eb9b6ff844e6bc9ceb5d813decca2025-01-14T06:44:23ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2014-10-013511712659686843Early traffic sampling algorithm based on SSCBFYing HOUYun-fei GUOHai HUANGKai WANGAn early traffic sampling algorithm was proposed based on same source and combination Bloom filter (SSCBF),a structure with two Bloom filters:flow-sampling vector and packet-count vector.The hash functions of the two vectors were same but the counters’ widths were different.This structure separated the sampling judgment and the packets counting.That could avoid the interference with packet count vector by the finished sampling flows.The false positive rate of the algorithm and an adjustable parameter α,ratio of the two vectors’ widths,were analyzed.The analysis and experiments demonstrate that with suitable α,the algorithm can achieve higher accuracy without increasing the space complexity.http://www.joconline.com.cn/zh/article/doi/10.3969/j.issn.1000-436x.2014.10.014/traffic samplingBloom filtercombinational Bloom filterlength adjustable factor |
spellingShingle | Ying HOU Yun-fei GUO Hai HUANG Kai WANG Early traffic sampling algorithm based on SSCBF Tongxin xuebao traffic sampling Bloom filter combinational Bloom filter length adjustable factor |
title | Early traffic sampling algorithm based on SSCBF |
title_full | Early traffic sampling algorithm based on SSCBF |
title_fullStr | Early traffic sampling algorithm based on SSCBF |
title_full_unstemmed | Early traffic sampling algorithm based on SSCBF |
title_short | Early traffic sampling algorithm based on SSCBF |
title_sort | early traffic sampling algorithm based on sscbf |
topic | traffic sampling Bloom filter combinational Bloom filter length adjustable factor |
url | http://www.joconline.com.cn/zh/article/doi/10.3969/j.issn.1000-436x.2014.10.014/ |
work_keys_str_mv | AT yinghou earlytrafficsamplingalgorithmbasedonsscbf AT yunfeiguo earlytrafficsamplingalgorithmbasedonsscbf AT haihuang earlytrafficsamplingalgorithmbasedonsscbf AT kaiwang earlytrafficsamplingalgorithmbasedonsscbf |