Fast counting the cardinality of flows for big traffic over sliding windows

{{article.zuoZheEn}}

PDF(1167 KB)
PDF(1167 KB)
Front. Comput. Sci. ›› 2017, Vol. 11 ›› Issue (1) : 119-129. DOI: 10.1007/s11704-016-6053-x
RESEARCH ARTICLE

Fast counting the cardinality of flows for big traffic over sliding windows

  • {{article.zuoZheEn}}
Author information +
History +

Highlights

{{article.highlightEn}}

Abstract

{{article.abstractEn}}

Author summary

{{article.authorSummayEn}}

Keywords

Cite this article

EndNote

Ris (Procite)

Bibtex

Download citation ▾
{{article.zuoZheEn_L}}. {{article.titleEn}}. Front. Comput. Sci., 2017, 11(1): 119‒129 https://doi.org/10.1007/s11704-016-6053-x

References

Publishing order | Descend order by publishing year | Descend order by cited within

References

{{article.reference}}

RIGHTS & PERMISSIONS

{{article.copyright.year}} {{article.copyright.holder}}
PDF(1167 KB)

Accesses

Citations

Detail
Sections
Recommended

/

〈 〉