{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,12]],"date-time":"2025-06-12T04:08:26Z","timestamp":1749701306241,"version":"3.41.0"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T00:00:00Z","timestamp":1743120000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T00:00:00Z","timestamp":1743120000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["No.62090024"],"award-info":[{"award-number":["No.62090024"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["No.92373206"],"award-info":[{"award-number":["No.92373206"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["No.62002340"],"award-info":[{"award-number":["No.62002340"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["No.62090020"],"award-info":[{"award-number":["No.62090020"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002367","name":"Chinese Academy of Sciences","doi-asserted-by":"crossref","award":["No.XDB0660100"],"award-info":[{"award-number":["No.XDB0660100"]}],"id":[{"id":"10.13039\/501100002367","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100002367","name":"Chinese Academy of Sciences","doi-asserted-by":"crossref","award":["No.XDB44030100"],"award-info":[{"award-number":["No.XDB44030100"]}],"id":[{"id":"10.13039\/501100002367","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["CCF Trans. HPC"],"published-print":{"date-parts":[[2025,6]]},"DOI":"10.1007\/s42514-025-00222-5","type":"journal-article","created":{"date-parts":[[2025,3,31]],"date-time":"2025-03-31T12:00:00Z","timestamp":1743422400000},"page":"275-290","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["FUS: FPGA-based Universal Sketch with homogeneous and heterogeneous memory architectures"],"prefix":"10.1007","volume":"7","author":[{"given":"Yunkun","family":"Liao","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4938-5899","authenticated-orcid":false,"given":"Jingya","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Wenyan","family":"Lu","sequence":"additional","affiliation":[]},{"given":"Huawei","family":"Li","sequence":"additional","affiliation":[]},{"given":"Xiaowei","family":"Li","sequence":"additional","affiliation":[]},{"given":"Guihai","family":"Yan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,3,28]]},"reference":[{"key":"222_CR1","doi-asserted-by":"crossref","unstructured":"Alon, N., Matias, Y., Szegedy, M.: The space complexity of approximating the frequency moments. In: Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, pp 20\u201329 (1996)","DOI":"10.1145\/237814.237823"},{"key":"222_CR2","doi-asserted-by":"crossref","unstructured":"Braverman, V., Ostrovsky, R.: Generalizing the layering method of indyk and woodruff: Recursive sketches for frequency-based vectors on streams. In: International Workshop on Approximation Algorithms for Combinatorial Optimization, Springer, pp 58\u201370 (2013)","DOI":"10.1007\/978-3-642-40328-6_5"},{"key":"222_CR3","unstructured":"CAIDA. Caida data-overview of datasets, monitors, and reports. https:\/\/www.caida.org\/catalog\/datasets\/overview\/. (2024), Accessed 16 Apr 2024"},{"key":"222_CR4","unstructured":"Chandrasekar, K., Weis, C., Li, Y., et\u00a0al.: Drampower: Open-source dram power & energy estimation tool. URL: http:\/\/www drampower info 22 (2012)"},{"key":"222_CR5","doi-asserted-by":"crossref","unstructured":"Charikar, M., Chen, K., Farach-Colton, M.: Finding frequent items in data streams. In: International Colloquium on Automata, Languages, and Programming, Springer, pp 693\u2013703 (2002)","DOI":"10.1007\/3-540-45465-9_59"},{"key":"222_CR6","doi-asserted-by":"crossref","unstructured":"Chiosa, M., Preu\u00dfer, T.B., Alonso G.: Skt: a one-pass multi-sketch data analytics accelerator. In: Proc VLDB Endow 14:2369\u20132382 (2021). https:\/\/api.semanticscholar.org\/CorpusID:237011815","DOI":"10.14778\/3476249.3476287"},{"issue":"1","key":"222_CR7","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.jalgor.2003.12.001","volume":"55","author":"G Cormode","year":"2005","unstructured":"Cormode, G., Muthukrishnan, S.: An improved data stream summary: the count-min sketch and its applications. J. Algorithms 55(1), 58\u201375 (2005)","journal-title":"J. Algorithms"},{"key":"222_CR8","unstructured":"DATA, A.: Adm-pcie-9v3 specification. https:\/\/www.alpha-data.com\/product\/adm-pcie-9v3\/ (2024). Accessed 17 Apr 2024"},{"issue":"3","key":"222_CR9","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1109\/90.929850","volume":"9","author":"A Feldmann","year":"2001","unstructured":"Feldmann, A., Greenberg, A., Lund, C., et al.: Deriving traffic demands for operational ip networks: Methodology and experience. IEEE\/ACM Trans. Netw. 9(3), 265\u2013279 (2001)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"222_CR10","doi-asserted-by":"crossref","unstructured":"Flajolet, P., Fusy, \u00c9., Gandouet, O., et\u00a0al.: Hyperloglog: the analysis of a near-optimal cardinality estimation algorithm. In: Discrete Mathematics & Theoretical Computer Science (Proceedings) (2007)","DOI":"10.46298\/dmtcs.3545"},{"key":"222_CR11","doi-asserted-by":"crossref","unstructured":"Forencich, A., Snoeren, A.C., Porter, G., et\u00a0al.: Corundum: an open-source 100-gbps nic. In: 2020 IEEE 28th Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM), IEEE, pp 38\u201346 (2020)","DOI":"10.1109\/FCCM48280.2020.00015"},{"key":"222_CR12","unstructured":"Jenkins, B.: Jenkins hash functions (2006)"},{"issue":"3","key":"222_CR13","doi-asserted-by":"publisher","first-page":"281","DOI":"10.14778\/3430915.3430919","volume":"14","author":"M Kiefer","year":"2020","unstructured":"Kiefer, M., Poulakis, I., Bre\u00df, S., et al.: Scotch: generating fpga-accelerators for sketching at line rate. Proc. VLDB Endow. 14(3), 281\u2013293 (2020)","journal-title":"Proc. VLDB Endow."},{"issue":"5","key":"222_CR14","doi-asserted-by":"publisher","first-page":"1113","DOI":"10.14778\/3579075.3579085","volume":"16","author":"M Kiefer","year":"2023","unstructured":"Kiefer, M., Poulakis, I., Zacharatou, E.T., et al.: Optimistic data parallelism for fpga-accelerated sketching. Proc. VLDB Endow. 16(5), 1113\u20131125 (2023)","journal-title":"Proc. VLDB Endow."},{"issue":"1","key":"222_CR15","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1109\/LCA.2015.2414456","volume":"15","author":"Y Kim","year":"2015","unstructured":"Kim, Y., Yang, W., Mutlu, O.: Ramulator: a fast and extensible dram simulator. IEEE Comput. Archit. Lett. 15(1), 45\u201349 (2015)","journal-title":"IEEE Comput. Archit. Lett."},{"key":"222_CR16","doi-asserted-by":"crossref","unstructured":"Kulkarni, A., Chiosa, M., Preu\u00dfer, T.B., et\u00a0al.: Hyperloglog sketch acceleration on fpga. In: 2020 30th International Conference on Field-Programmable Logic and Applications (FPL), IEEE, pp 47\u201356 (2020)","DOI":"10.1109\/FPL50879.2020.00019"},{"issue":"1","key":"222_CR17","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1145\/1140103.1140295","volume":"34","author":"A Lall","year":"2006","unstructured":"Lall, A., Sekar, V., Ogihara, M., et al.: Data streaming algorithms for estimating entropy of network traffic. ACM SIGMETRICS Perform. Eval. Rev. 34(1), 145\u2013156 (2006)","journal-title":"ACM SIGMETRICS Perform. Eval. Rev."},{"key":"222_CR18","unstructured":"Lin, J., Patel, K., Stephens, B.E., et\u00a0al.: $$\\{$$PANIC$$\\}$$: A $$\\{$$High-Performance$$\\}$$ programmable $$\\{$$NIC$$\\}$$ for multi-tenant networks. In: 14th USENIX Symposium on Operating Systems Design and Implementation (OSDI 20), pp 243\u2013259 (2020)"},{"key":"222_CR19","doi-asserted-by":"crossref","unstructured":"Liu, Z., Manousis, A., Vorsanger, G,. et\u00a0al.: One sketch to rule them all: rethinking network flow monitoring with univmon. In: Proceedings of the 2016 ACM SIGCOMM Conference, pp 101\u20131141 (2016)","DOI":"10.1145\/2934872.2934906"},{"key":"222_CR20","first-page":"28","volume":"27","author":"N Muralimanohar","year":"2009","unstructured":"Muralimanohar, N., Balasubramonian, R., Jouppi, N.P.: Cacti 6.0: a tool to model large caches. HP Lab. 27, 28 (2009)","journal-title":"HP Lab."},{"issue":"3","key":"222_CR21","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1145\/2678373.2665678","volume":"42","author":"A Putnam","year":"2014","unstructured":"Putnam, A., Caulfield, A.M., Chung, E.S., et al.: A reconfigurable fabric for accelerating large-scale datacenter services. ACM SIGARCH Comput. Arch. News 42(3), 13\u201324 (2014)","journal-title":"ACM SIGARCH Comput. Arch. News"},{"key":"222_CR22","doi-asserted-by":"publisher","unstructured":"Sateesan, A., Vliegen, J., Scherrer, S., et\u00a0al.: Speed records in network flow measurement on fpga. In: 2021 31st International Conference on Field-Programmable Logic and Applications (FPL), pp 219\u2013224 (2021), https:\/\/doi.org\/10.1109\/FPL53798.2021.00043","DOI":"10.1109\/FPL53798.2021.00043"},{"issue":"3","key":"222_CR23","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1145\/3649171.3649174","volume":"53","author":"J Sherry","year":"2024","unstructured":"Sherry, J.: The i\/o driven server: from smartnics to data movement controllers. ACM SIGCOMM Comput. Commun. Rev. 53(3), 9\u201317 (2024)","journal-title":"ACM SIGCOMM Comput. Commun. Rev."},{"key":"222_CR24","doi-asserted-by":"publisher","first-page":"85823","DOI":"10.1109\/ACCESS.2021.3088500","volume":"9","author":"JE Soto","year":"2021","unstructured":"Soto, J.E., Ubisse, P., Fern\u00e1ndez, Y., et al.: A high-throughput hardware accelerator for network entropy estimation using sketches. IEEE Access 9, 85823\u201385838 (2021)","journal-title":"IEEE Access"},{"issue":"4","key":"222_CR25","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1109\/TPDS.2017.2766633","volume":"29","author":"D Tong","year":"2017","unstructured":"Tong, D., Prasanna, V.K.: Sketch acceleration on fpga and its applications in network anomaly detection. IEEE Trans. Parallel Distrib. Syst. 29(4), 929\u2013942 (2017)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"222_CR26","unstructured":"Wikipedia contributors. Reservation station \u2014 Wikipedia, the free encyclopedia. https:\/\/en.wikipedia.org\/w\/index.php?title=Reservation_station&oldid=1193066155, (2024). Accessed 17 Apr 2024"},{"key":"222_CR27","doi-asserted-by":"crossref","unstructured":"Xiao, Q., Cai, X., Qin, Y., et al.: Universal and accurate sketch for estimating heavy hitters and moments in data streams. IEEE\/ACM Trans. Netw. (2023)","DOI":"10.1109\/TNET.2022.3216025"},{"key":"222_CR28","unstructured":"Xilinx, A.: Alveo u280 data center accelerator card data sheet (ds963). https:\/\/docs.amd.com\/r\/en-US\/ds963-u280, (2024). Accessed 16 Apr 2024"},{"key":"222_CR29","unstructured":"YUSUR, Data network development platform. https:\/\/www.yusur.tech\/product\/DNDP, (2024). Accessed 4 Sep 2024"},{"key":"222_CR30","doi-asserted-by":"crossref","unstructured":"Zazo, J.F., Lopez-Buedo, S., Ruiz, M., et\u00a0al.: A single-fpga architecture for detecting heavy hitters in 100 gbit\/s ethernet links. In: 2017 International Conference on ReConFigurable Computing and FPGAs (ReConFig), IEEE, pp 1\u20136 (2017)","DOI":"10.1109\/RECONFIG.2017.8279770"}],"container-title":["CCF Transactions on High Performance Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42514-025-00222-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42514-025-00222-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42514-025-00222-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,11]],"date-time":"2025-06-11T08:48:50Z","timestamp":1749631730000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42514-025-00222-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,28]]},"references-count":30,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,6]]}},"alternative-id":["222"],"URL":"https:\/\/doi.org\/10.1007\/s42514-025-00222-5","relation":{},"ISSN":["2524-4922","2524-4930"],"issn-type":[{"type":"print","value":"2524-4922"},{"type":"electronic","value":"2524-4930"}],"subject":[],"published":{"date-parts":[[2025,3,28]]},"assertion":[{"value":"19 October 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 February 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 March 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"On behalf of all authors, the corresponding authors state that there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}