Identifying high cardinality internet hosts

Proceedings - IEEE INFOCOM

Volumn , Issue , 2009, Pages 810-818

  Cao, Jin ^a   Jin, Yu ^b   Chen, Aiyou ^a   Bu, Tian ^a   Zhang, Zhi Li ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b UNIVERSITY OF MINNESOTA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BEHAVIOR-BASED; BIAS CORRECTION; CARDINALITIES; COMPUTATION RESOURCES; HIGH-SPEED LINKS; HOST BEHAVIORS; INTERNET HOSTS; INTERNET TRACES; LIMITED MEMORY; MEMORY RESOURCES; NETWORK INTRUSION DETECTION; ON-LINE SAMPLING; PHASE FILTERING; THREE COMPONENT;

INTRUSION DETECTION;

INTERNET;

EID: 70349653447     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2009.5061990     Document Type: Conference Paper

References (19)

1. Identifying High Cardinality Internet Hosts. Technical report, 2008.
2. A. Bagchi, A. Chaudhary, D. Eppstein, and M. T. Goodrich. Deterministic sampling and range counting in geometric data streams. ACM Trans. Algorithms, 3(2):16, 2007.
3. B. Bloom. Space/time trade-offs in hashing coding with allowable errors. Communications of the ACM, 13(7):422-426, 1970.
4. M. Datar and S. Muthukrishnan. Estimating rarity and similarity over data stream windows. In ESA '02, pages 323-334, 2002.
5. N. Duffield, C. Lund, and M. Thorup. Flow sampling under hard resource constraints. In SIGMETRICS '04/Performance '04, 2004.
6. N. G. Duffield, C. Lund, and M. Thorup. Estimating flow distributions from sampled flow statistics. IEEE/ACM Trans. Netw., 13(5), 2005.
7. N. G. Duffield, C. Lund, and M. Thorup. Learn more, sample less: control of volume and variance in network measurement. IEEE Transactions on Information Theory, 51(5):1756-1775, 2005.
8. M. Durand and P. Flajolet. Loglog counting of large cardinalities. In Proceedings of European Symposium on Algorithms, 2003.
9. C. Estan, G. Varghese, and M. Fisk. Bitmap algorithms for counting active flows on high speed links. IEEE/ACM Trans. on Networking, 14(5):925-937, 2006.
10. P. B. Gibbons. Distinct sampling for highly-accurate answers to distinct values queries and event reports. In VLDB '01, pages 541-550, 2001.
11. M. Greenwald and S. Khanna. Space-efficient online computation of quantile summaries. In Proceedings of SIGMOD 2001, 2001.
12. J. Hershberger and S. Suri. Adaptive sampling for geometric problems over data streams. In PODS '04, pages 252-262, 2004.
13. K. Ishibashi, T. Mori, R. Kawahara, Y. Hirokawa, A. Kobayashi, and K. Y. H. Sakamoto. Estimating top n hosts in cardinality using small memory resources. In ICDEW '06, page 29, 2006.
14. T. Johnson, S. Muthukrishnan, and I. Rozenbaum. Sampling algorithms in a stream operator. In SIGMOD '05, pages 1-12, 2005.
15. N. Kamiyama, T. Mori, and R. Kawahara. Simple and adaptive identification of superspreaders by flow sampling. In INFOCOM 2007, pages 2481-2485, 2007.
16. G. S. Manku and R. Motwani. Approximate frequency counts over data streams. In VLDB '02, pages 346-357, 2002.
17. S. Singh, C. Estan, G. Varghese, and S. Savage. Automated worm fingerprinting. In OSDI'04, 2004.
18. S. Venkataraman, D. X. Song, P. B. Gibbons, and A. Blum. New streaming algorithms for fast detection of superspreaders. In NDSS 2005.
19. J. S. Vitter. Random sampling with a reservoir. ACM Trans. Math. Softw., 11(1):37-57, 1985.