Simple and Adaptive Identification of Superspreaders by Flow Sampling
暂无分享,去创建一个
[1] Li Fan,et al. Summary cache: a scalable wide-area web cache sharing protocol , 2000, TNET.
[2] David Moore,et al. A robust system for accurate real-time summaries of internet traffic , 2005, SIGMETRICS '05.
[3] Tao He,et al. Scalable Double Filter Structure for Port Scan Detection , 2006, 2006 IEEE International Conference on Communications.
[4] M. V. Ramakrishna,et al. A Performance Study of Hashing Functions for Hardware Applications , 1994 .
[5] Dawn Xiaodong Song,et al. New Streaming Algorithms for Fast Detection of Superspreaders , 2005, NDSS.
[6] Burton H. Bloom,et al. Space/time trade-offs in hash coding with allowable errors , 1970, CACM.
[7] Martin Roesch,et al. Snort - Lightweight Intrusion Detection for Networks , 1999 .
[8] Larry Carter,et al. Universal Classes of Hash Functions , 1979, J. Comput. Syst. Sci..
[9] Haoyu Song,et al. Fast hash table lookup using extended bloom filter: an aid to network processing , 2005, SIGCOMM '05.
[10] Tatsuya Mori,et al. Simple and Accurate Identification of High-Rate Flows by Packet Sampling , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.