| 1 |
周伟林, 杨芫, 徐明伟. 网络功能虚拟化技术研究综述. 计算机研究与发展, 2018, 55 (4): 675- 688.
|
|
ZHOU W L , YANG Y , XU M W . Network function virtualization technology research. Journal of Computer Research and Development, 2018, 55 (4): 675- 688.
|
| 2 |
LU J, CHEN H C, ZHANG Z. LUSketch: a fast and precise sketch for top-k finding in data streams[C]//Proceedings of the International Conference on Computer Communications and Networks (ICCCN). Washington D.C., USA: IEEE Press, 2022: 1-10.
|
| 3 |
戴冕, 程光, 周余阳. 软件定义网络的测量方法研究. 软件学报, 2019, 30 (6): 1853- 1874.
|
|
DAI M , CHENG G , ZHOU Y Y . Survey on measurement methods in software-defined networking. Journal of Software, 2019, 30 (6): 1853- 1874.
|
| 4 |
CURTIS A R, MOGUL J C, TOURRILHES J, et al. DevoFlow: scaling flow management for high-performance networks[C]//Proceedings of the ACM SIGCOMM 2011 Conference. New York, USA: ACM Press, 2011: 254-265.
|
| 5 |
KABBANI A, ALIZADEH M, YASUDA M, et al. AF-QCN: approximate fairness with quantized congestion notification for multi-tenanted data centers[C]//Proceedings of the 18th IEEE Symposium on High Performance Interconnects. Washington D.C., USA: IEEE Press, 2010: 58-65.
|
| 6 |
王光明, 李冬青, 蒋从锋. 不平衡数据集下的数据中心网络流量异常检测. 计算机工程, 2025, 51 (8): 227- 237.
doi: 10.19678/j.issn.1000-3428.0069281
|
|
WANG G M , LI D Q , JIANG C F . Network traffic anomaly detection for data centers in imbalanced datasets. Computer Engineering, 2025, 51 (8): 227- 237.
doi: 10.19678/j.issn.1000-3428.0069281
|
| 7 |
|
| 8 |
林耘森箫, 毕军, 周禹, 等. 基于P4的可编程数据平面研究及其应用. 计算机学报, 2019, 42 (11): 2539- 2560.
|
|
LIN Y S X , BI J , ZHOU Y , et al. Research and applications of programmable data plane based on P4. Chinese Journal of Computers, 2019, 42 (11): 2539- 2560.
|
| 9 |
|
| 10 |
|
| 11 |
BEN BASAT R, EINZIGER G, FRIEDMAN R, et al. Randomized admission policy for efficient top-k and frequency estimation[C]//Proceedings of the IEEE Conference on Computer Communications. Washington D.C., USA: IEEE Press, 2017: 1-9.
|
| 12 |
YANG T, JIANG J, LIU P, et al. Elastic sketch: adaptive and fast network-wide measurements[C]//Proceedings of the 2018 Conference of the ACM Special Interest Group on Data Communication. New York, USA: ACM Press, 2018: 561-575.
|
| 13 |
CORMODE G , MUTHUKRISHNAN S . An improved data stream summary: the count-min sketch and its applications. Journal of Algorithms, 2005, 55 (1): 58- 75.
doi: 10.1016/j.jalgor.2003.12.001
|
| 14 |
TANG L, HUANG Q, LEE P P C. MV-Sketch: a fast and compact invertible sketch for heavy flow detection in network data streams[C]//Proceedings of the IEEE Conference on Computer Communications. Washington D.C., USA: IEEE Press, 2019: 2026-2034.
|
| 15 |
ZHOU Y, JIN H, LIU P, et al. Accurate per-flow measurement with bloom sketch[C]//Proceedings of the IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS). Washington D.C., USA: IEEE Press, 2018: 1-2.
|
| 16 |
LI J Z, LI Z K, XU Y F, et al. WavingSketch: an unbiased and generic sketch for finding top-k items in data streams[C]//Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining. New York, USA: ACM Press, 2020: 1574-1584.
|
| 17 |
MIAO R J, ZHANG Y D, ZHENG Z H, et al. CocoSketch: high-performance sketch-based measurement over arbitrary partial key query[C]//Proceedings of the IEEE/ACM Conference on Networking. Washington D.C., USA: IEEE Press, 2023: 2653-2668.
|
| 18 |
ZHOU Y, YANG T, JIANG J, et al. Cold filter: a meta-framework for faster and more accurate stream processing[C]//Proceedings of the 2018 International Conference on Management of Data. New York, USA: ACM Press, 2018: 741-756.
|
| 19 |
LI Y P , WANG F Y , YU X , et al. LadderFilter: filtering infrequent items with small memory and time overhead. Proceedings of the ACM on Management of Data, 2023, 1 (1): 1- 21.
|
| 20 |
HUANG J W , ZHANG W L , LI Y J , et al. ChainSketch: an efficient and accurate sketch for heavy flow detection. IEEE/ACM Transactions on Networking, 2023, 31 (2): 738- 753.
doi: 10.1109/TNET.2022.3199506
|
| 21 |
SIVARAMAN A, SUBRAMANIAN S, ALIZADEH M, et al. Programmable packet scheduling at line rate[C]//Proceedings of the 2016 ACM SIGCOMM Conference. New York, USA: ACM Press, 2016: 44-57.
|
| 22 |
LI S T, HUANG J W, ZHANG W L, et al. PA-sketch: a fast and accurate sketch for differentiated flow estimation[C]//Proceedings of the 31st IEEE International Conference on Network Protocols (ICNP). Washington D.C., USA: IEEE Press, 2023: 1-11.
|
| 23 |
LAKHINA A, CROVELLA M, DIOT C. Characterization of network-wide anomalies in traffic flows[C]// Proceedings of the 4th ACM SIGCOMM Conference on Internet Measurement. New York, USA: ACM Press, 2004: 201-206.
|
| 24 |
HU Z P , REN H R , SHI P . Synchronization of complex dynamical networks subject to noisy sampling interval and packet loss. IEEE Transactions on Neural Networks and Learning Systems, 2022, 33 (8): 3216- 3226.
doi: 10.1109/TNNLS.2021.3051052
|
| 25 |
|
| 26 |
|
| 27 |
|
| 28 |
GLADIS K , CHEN Y . The untapped potential of ascon hash functions: benchmarking, hardware profiling, and application insights for secure IoT and blockchain systems. Sensors, 2025, 25 (19): 5936.
doi: 10.3390/s25195936
|
| 29 |
YE J, LI L, ZHANG W L, et al. UA-sketch: an accurate approach to detect heavy flow based on uninterrupted arrival[C]//Proceedings of the 51st International Conference on Parallel Processing. New York, USA: ACM Press, 2022: 1-11.
|
| 30 |
|