A fair sampling algorithm of network flow based on dynamic count filter

The network application of flow level becomes increasingly wide, to analyze network flow completely we need fair sampling. The previous algorithm of SGS (Sketch Guided Sampling) realizes fair sampling by that sampling rate is in inverse ratio to traffic, traffic counting of which uses hash method. I...

Full description

Saved in:
Bibliographic Details
Published in2013 IEEE 4th International Conference on Software Engineering and Service Science pp. 811 - 815
Main Authors Wang Yi-qing, Chen Shu-qiao, Zhang zhen
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.05.2013
Subjects
counting bloom filter
fair sampling
flow counting
flow measurement
Heuristic algorithms
Performance analysis
Radiation detectors
Tiles
Online AccessGet full text

Cover

More Information
Summary:The network application of flow level becomes increasingly wide, to analyze network flow completely we need fair sampling. The previous algorithm of SGS (Sketch Guided Sampling) realizes fair sampling by that sampling rate is in inverse ratio to traffic, traffic counting of which uses hash method. In this paper, for the defects of SGS flow counting and the previous counting Bloom Filters, a more efficient fair sampling algorithm called DCFS (Dynamic Count Fair Sampling) is proposed. The algorithm of DCFS applies DCF (Dynamic Count Filter) to count traffic, which is faster more space efficient than SGS, and it can be easily implemented in hardware.
ISBN:9781467349970
1467349976
ISSN:2327-0586
DOI:10.1109/ICSESS.2013.6615429