[1] 赵小欢,夏靖波,付凯,等.高速网络流频繁项挖掘算法[J].计算机研究与发展,2014,51(11):2458-2469. (ZHAO X H, XIA J B, FU K, et al. Frequent items mining algorithm over network flows at high-speed network[J]. Journal of Computer Research and Development, 2014, 51(11):2458-2469.) [2] LIU W, QU W, GONG J, et al. Detection of superpoints using a vector bloom filter[J]. IEEE Transactions on Information Forensics and Security, 2016, 11(3):514-527. [3] CHEN A, JIN Y, CAO J, et al. Tracking long duration flows in network traffic[C]//Proceedings of the 2010 International Conference on Information Communications. Piscataway, NJ:IEEE, 2010:206-210. [4] LEE S, SHIN S, YOON M. Detecting long duration flows without false negatives[J]. IEICE Transactions on Communications, 2011, 94(5):1460-1462. [5] GIROIRE F, CHANDRASHEKAR J, TAFT N, et al. Exploiting temporal persistence to detect covert botnet channels[C]//Proceedings of the 2009 International Workshop on Recent Advances in Intrusion Detection, LNCS 5758. Berlin:Springer, 2009:326-345. [6] HEULE S, NUNKESSER M, HALL A. HyperLogLog in practice:algorithmic engineering of a state of the art cardinality estimation algorithm[C]//Proceedings of the 16th International Conference on Extending Database Technology. New York:ACM, 2013:683-692. [7] ZHOU Y, ZHOU Y, CHEN M, et al. Persistent spread measurement for big network data based on register intersection[J]. Proceedings of the ACM on Measurement and Analysis of Computing Systems, 2017, 1(1):No.15. [8] XIAO Q, QIAO Y, ZHEN M, et al. Estimating the persistent spreads in high-speed networks[C]//Proceedings of the 22nd IEEE International Conference on Network Protocols. Piscataway:IEEE, 2014:131-142. [9] SHIN S, YOON M. Virtual vectors and network traffic analysis[J]. IEEE Network, 2012, 26(1):22-26. [10] LAHIRI B, CHANDRASHEKAR J, TIRTHAPURA S. Space-efficient tracking of persistent items in a massive data stream[C]//Proceedings of the 5th International Conference on Distributed Event-based System. New York:ACM, 2011:255-266. [11] SINGH S A, TIRTHAPURA S. Monitoring persistent items in the union of distributed streams[J]. Journal of Parallel and Distributed Computing, 2014, 74(11):3115-3127. [12] DAI H, SHAHZAD M, LIU A X, et al. Finding persistent items in data streams[J]. Proceedings of the VLDB Endowment, 2016, 10(4):289-300. [13] ESTAN C, VARGHESE G, FISK M. Bitmap algorithms for counting active flows on high-speed links[J]. IEEE/ACM Transactions on Networking, 2006, 14(5):925-937. [14] KUMAR A, XU J, WANG J. Space-code bloom filter for efficient per-flow traffic measurement[J]. IEEE Journal on Selected Areas in Communications, 2006, 24(12):2327-2339. [15] CORMODE G, MUTHUKRISHNAN S. An improved data stream summary:the count-min sketch and its applications[J]. Journal of Algorithms, 2005, 55(1):58-75. [16] FLAJOLET P, FUSY È, GANDOUET O, et al. HyperLogLog:the analysis of a near-optimal cardinality estimation algorithm[J]. Discrete Mathematics and Theoretical Computer Science, 2007, 28(3):127-146. [17] HUANG Q, LEE P P C. A hybrid local and distributed sketching design for accurate scalable heavy key detection in network data streams[J]. Computer Networks:The International Journal of Computer and Telecommunications Networking, 2015, 91(C):298-315. [18] ANTUNES N, PIPIRAS V. Estimation of flow distributions from sampled traffic[J]. ACM Transactions on Modeling and Performance Evaluation of Computing Systems, 2016, 1(3):No.17. [19] IP Trace And Service[DS/OL].[2018-11-20]. http://iptas.edu.cn/src/system.php. |