IEICE TRANSACTIONS on Information
LRU-LC: Fast Estimating Cardinality of Flows over Sliding Windows
Summary :
Estimating the cardinality of flows over sliding windows on high-speed links is still a challenging work under time and space constrains. To solve this problem, we present a novel data structure maintaining a summary of data and propose a constant-time update algorithm for fast evicting expired information. Moreover, a further memory-reducing schema is given at a cost of very little loss of accuracy.
- Publication
- IEICE TRANSACTIONS on Information Vol.E99-D No.10 pp.2629-2632
- Publication Date
- 2016/10/01
- Publicized
- 2016/06/29
- Online ISSN
- 1745-1361
- DOI
- 10.1587/transinf.2015EDL8263
- Type of Manuscript
- LETTER
- Category
- Fundamentals of Information Systems
Authors
Jingsong SHAN
PLA University of Science and Technology
Jianxin LUO
PLA University of Science and Technology
Guiqiang NI
PLA University of Science and Technology
Yinjin FU
PLA University of Science and Technology
Zhaofeng WU
PLA University of Science and Technology
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Jingsong SHAN, Jianxin LUO, Guiqiang NI, Yinjin FU, Zhaofeng WU, "LRU-LC: Fast Estimating Cardinality of Flows over Sliding Windows" in IEICE TRANSACTIONS on Information,
vol. E99-D, no. 10, pp. 2629-2632, October 2016, doi: 10.1587/transinf.2015EDL8263.
Abstract: Estimating the cardinality of flows over sliding windows on high-speed links is still a challenging work under time and space constrains. To solve this problem, we present a novel data structure maintaining a summary of data and propose a constant-time update algorithm for fast evicting expired information. Moreover, a further memory-reducing schema is given at a cost of very little loss of accuracy.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.2015EDL8263/_p
Copy
@ARTICLE{e99-d_10_2629,
author={Jingsong SHAN, Jianxin LUO, Guiqiang NI, Yinjin FU, Zhaofeng WU, },
journal={IEICE TRANSACTIONS on Information},
title={LRU-LC: Fast Estimating Cardinality of Flows over Sliding Windows},
year={2016},
volume={E99-D},
number={10},
pages={2629-2632},
abstract={Estimating the cardinality of flows over sliding windows on high-speed links is still a challenging work under time and space constrains. To solve this problem, we present a novel data structure maintaining a summary of data and propose a constant-time update algorithm for fast evicting expired information. Moreover, a further memory-reducing schema is given at a cost of very little loss of accuracy.},
keywords={},
doi={10.1587/transinf.2015EDL8263},
ISSN={1745-1361},
month={October},}
Copy
TY - JOUR
TI - LRU-LC: Fast Estimating Cardinality of Flows over Sliding Windows
T2 - IEICE TRANSACTIONS on Information
SP - 2629
EP - 2632
AU - Jingsong SHAN
AU - Jianxin LUO
AU - Guiqiang NI
AU - Yinjin FU
AU - Zhaofeng WU
PY - 2016
DO - 10.1587/transinf.2015EDL8263
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E99-D
IS - 10
JA - IEICE TRANSACTIONS on Information
Y1 - October 2016
AB - Estimating the cardinality of flows over sliding windows on high-speed links is still a challenging work under time and space constrains. To solve this problem, we present a novel data structure maintaining a summary of data and propose a constant-time update algorithm for fast evicting expired information. Moreover, a further memory-reducing schema is given at a cost of very little loss of accuracy.
ER -
English
