Frequency Estimation of Internet Packet Streams with Limited Space-Reference-Cited by-同舟云学术

Frequency Estimation of Internet Packet Streams with Limited Space

Published:2002 Issue: Volume: Page:348-360
ISSN:0302-9743
Container-title:Algorithms — ESA 2002
language:
Short-container-title:

Author:

Demaine Erik D.,López-Ortiz Alejandro,Munro J. Ian

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-45749-6_33

Reference27 articles.

1. N. Alon, Y. Matias and M. Szegedy. “The space complexity of approximating the frequency moments”, STOC, 1996, pp. 20–29.

2. B. Bloom. “Space/time trade-offs in hash coding with allowable queries”, Comm. ACM, 13:7, July 1970, pp. 422–426.

3. M. Charikar, K. Chen and M. Farach-Colton. “Finding frequent items in data streams”, to appear in ICALP, 2002.

4. S. Chaudhuri, R. Motwani and V. Narasayya. “Random sampling for histogram construction: how much is enough”, In SIGMOD, 1998, pp. 436–447.

5. Cisco Systems. Sampled NetFlow, http://www.cisco.com/univercd/cc/td/doc/product/software/ios120/120newft/120limit/120s/120s11/12ssanf.htm , April 2002.

Cited by 136 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Streaming Lower Bounds and Asymmetric Set-Disjointness;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

2. Finding the Top-K Heavy Hitters in Data Streams: A Reconfigurable Accelerator Based on an FPGA-Optimized Algorithm;Electronics;2023-05-24

3. ChainSketch: An Efficient and Accurate Sketch for Heavy Flow Detection;IEEE/ACM Transactions on Networking;2023-04

4. HyperCalm Sketch: One-Pass Mining Periodic Batches in Data Streams;2023 IEEE 39th International Conference on Data Engineering (ICDE);2023-04

5. Fast approximation of the top‐k items in data streams using FPGAs;IET Computers & Digital Techniques;2023-02-19