Computer Science ›› 2013, Vol. 40 ›› Issue (6): 80-83.

Previous Articles     Next Articles

Per-Flow Traffic Measurement Algorithm with Restrained Relative Error

ZHANG Jin,ZHAO Wen-dong,PENG Lai-xian and WU Ze-min   

  • Online:2018-11-16 Published:2018-11-16

Abstract: The accuracy of per-flow traffic measurement is evaluated using the metrics of both error probability and rela-tive error.Current research on flow traffic measurement mainly focuses on reducing error probability,while little attention has been paid to alleviating relative error.Motivated by the importance of reducing relative error in certain applications such as usage accounting,this study presented a new algorithm named MT-dlCBF (Multi-Tierd-left Counting Bloom Filter) with restrained relative error.MT-dlCBF consists of several tiers of dlCBF (d-left Counting Bloom Filter),and dlCBF at higher tier has longer flow fingerprints and wider flow traffic counters than that of dlCBF at lower tier respectively.In this way,the interference of long flow to short ones can be alleviated significantly,resulting in restrained relative error.Analytical and experimental results show that MT-dlCBF provides significant decrement in relative error and trivial increment in error probability compared to dlCBF.Moreover,MT-dlCBF has higher space efficiency than dlCBF under typical parameter settings.

Key words: Traffic measurement,Bloom filter,Relative error

[1] Trammell B,Boschi E.An introduction to ip flow information export[J].IEEE Communications Magazine,2011,49(4):89-95
[2] Systems C.NetFlow.http://www.cisco.com/web/go/netflow
[3] Estan C.New Directions in Traffic Measurement and Accoun-ting[C]∥Proc.of ACM Sigcomm.2002:323-336
[4] Kumar A,Xu Jun.Space-Code Bloom Filter for Efficient Per-Flow Traffic Measurement[C]∥Proc.of IEEE Infocom.2004:315-328
[5] Lu Yi,Montanari A,Prabhakar B.Counter Braids:A NovelCounter Architecture for Per-Flow Measurement[C]∥Proc.ACM SIGMETRICS.2008:121-132
[6] Lu Yi,Prabhakar B.Robust Counting Via Counter Braids:AnError-Resilient Network Measurement Architecture[C]∥Proc.IEEE Infocom.2009:522-530
[7] Lieven P,Scheuermann B.High-Speed Per-Flow Traffic Mea-surement with Probabilistic Multiplicity Counting[C]∥Proc.of IEEE Infocom.2010:1253-1261
[8] Li Tao,Chen Shi-gang,Ling Yi-bei.Fast and Compact Per-Flow Traffic Measurement through Randomized Counter Sharing[C]∥Proc.of IEEE Infocom.2011:1799-1807
[9] Fan L,Cao P,Almeida J,et al.Summary Cache:a Scalable Widea-rea Web Cache Sharing Protocol [J].IEEE/ACM Transactions on Networking,2000,8(3):281-293
[10] Bonomi F,Mitzenmacher M,Panigrahy R,et al.An ImprovedConstruction for Counting Bloom Filters[C]∥Proc.of Euro-pean Symposium on Algorithms.2006:678-680
[11] Tsidon E,Hanniel I,Keslassy I.Estimators Also Need Shared Values to Grow Together[C]∥Proc.IEEE Infocom.2012:1390-1398
[12] 周明中.大规模网络IP流行为特性及其测量算法研究[D].南京:东南大学,2006.8

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!