[1] |
HOFSTEDE R,?ELEDA P , TRAMMELL B ,et al. Flow monitoring explained:from packet capture to data analysis with NetFlow and IPFIX[J]. IEEE Communications Surveys & Tutorials, 2014,16(4): 2037-2064.
|
[2] |
S OMMER R , FELDMANN A . NetFlow:information loss or win?[C]// The 2nd ACM SIGCOMM Workshop on Internet Measurment. 2002: 173-174.
|
[3] |
MOSHREF M , YU M , GOVINDAN R ,et al. SCREAM:sketch resource allocation for software-defined measurement[C]// The 11th ACM Conference on Emerging Networking Experiments and Technologies. ACM, 2015:14.
|
[4] |
YU M , JOSE L , MIAO R . Software defined traffic measurement with OpenSketch[C]// Presented as Part of the 10th USENIX Symposium on Networked Systems Design and Implementation (NSDI 13). 2013: 29-42.
|
[5] |
LIU Z , VORSANGER G , BRAVERMAN V ,et al. Enabling a RISC approach for software-defined monitoring using universal streaming[C]// The 14th ACM Workshop on Hot Topics in Networks. ACM, 2015:21.
|
[6] |
LIU Z , MANOUSIS A , VORSANGER G ,et al. One sketch to rule them all:rethinking network flow monitoring with UnivMon[C]// The 2016 Conference on ACM SIGCOMM 2016 Conference. 2016: 101-114.
|
[7] |
CORMODE G , MUTHUKRISHNAN S . What's new:finding significant differences in network data streams[J]. IEEE/ACM Transactions on Networking (TON), 2005,13(6): 1219-1232.
|
[8] |
LIU Y , CHEN W , GUAN Y . A fast sketch for aggregate queries over high-speed network traffic[C]// INFOCOM. 2012: 2741-2745.
|
[9] |
SCHWELLER R , GUPTA A , PARSONS E ,et al. Reversible sketches for efficient and accurate change detection over network data streams[C]// The 4th ACM SIGCOMM Conference on Internet Measurement. 2004: 207-212.
|
[10] |
SCHWELLER R , LI Z , CHEN Y ,et al. Reversible sketches:enabling monitoring and analysis over high-speed data streams[J]. IEEE/ACM Transactions on Networking (ToN), 2007,15(5): 1059-1072.
|
[11] |
DAI M , CHENG G , WANG Y . Detecting network topology and packet trajectory with SDN-enabled FPGA platform[C]// The 11th International Conference on Future Internet Technologies. 2016: 7-13.
|
[12] |
LI T , SUN Z , JIA C ,et al. Using NetMagic to observe fine-grained per-flow latency measurements[C]// ACM SIGCOMM Computer Communication Review. 2011,41(4): 466-467.
|
[13] |
BOSSHART P , DALY D , GIBB G ,et al. P4:programming protocol-independent packet processors[J]. ACM SIGCOMM Computer Communication Review, 2014,44(3): 87-95.
|
[14] |
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.
|
[15] |
SONG H , DHARMAPURIKAR S , TURNER J ,et al. Fast hash table lookup using extended Bloom filter:an aid to network processing[J]. ACM SIGCOMM Computer Communication Review, 2005,35(4): 181-192.
|
[16] |
CARTER J L , WEGMAN M N . Universal classes of hash functions[C]// The Ninth Annual ACM Symposium on Theory of Computing. 1977: 106-112.
|