{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T04:49:56Z","timestamp":1771476596213,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":47,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,8,22]],"date-time":"2022-08-22T00:00:00Z","timestamp":1661126400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"National Natural Science Foundation of China (NSFC)","award":["No. U20A20179, 61832001"],"award-info":[{"award-number":["No. U20A20179, 61832001"]}]},{"name":"Key-Area Research and Development Program of Guangdong Province","award":["2020B0101390001"],"award-info":[{"award-number":["2020B0101390001"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,8,22]]},"DOI":"10.1145\/3528082.3544834","type":"proceedings-article","created":{"date-parts":[[2022,8,15]],"date-time":"2022-08-15T18:19:17Z","timestamp":1660587557000},"page":"8-14","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["PISketch"],"prefix":"10.1145","author":[{"given":"Zhuochen","family":"Fan","sequence":"first","affiliation":[{"name":"Peking University"}]},{"given":"Zhoujing","family":"Hu","sequence":"additional","affiliation":[{"name":"Peking University"}]},{"given":"Yuhan","family":"Wu","sequence":"additional","affiliation":[{"name":"Peking University"}]},{"given":"Jiarui","family":"Guo","sequence":"additional","affiliation":[{"name":"Peking University"}]},{"given":"Wenrui","family":"Liu","sequence":"additional","affiliation":[{"name":"Peking University"}]},{"given":"Tong","family":"Yang","sequence":"additional","affiliation":[{"name":"Peking University"}]},{"given":"Hengrui","family":"Wang","sequence":"additional","affiliation":[{"name":"Peking University"}]},{"given":"Yifei","family":"Xu","sequence":"additional","affiliation":[{"name":"University of California"}]},{"given":"Steve","family":"Uhlig","sequence":"additional","affiliation":[{"name":"Queen Mary University of London"}]},{"given":"Yaofeng","family":"Tu","sequence":"additional","affiliation":[{"name":"ZTE Corporation"}]}],"member":"320","published-online":{"date-parts":[[2022,8,22]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.14778\/3425879.3425884"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2018.2865125"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2019.2946417"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/tnet.2020.2982003"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2934872.2934906"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3098822.3098831"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3230543.3230544"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2019.2933868"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3341302.3342076"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3452296.3472892"},{"key":"e_1_3_2_1_11_1","first-page":"743","volume-title":"19th USENIX Symposium on Networked Systems Design and Implementation (NSDI 22)","author":"Namkung Hun","year":"2022","unstructured":"Hun Namkung , Zaoxing Liu , Daehyeok Kim , Vyas Sekar , and Peter Steenkiste . Sketchlib : Enabling efficient sketch-based monitoring on programmable switches . In 19th USENIX Symposium on Networked Systems Design and Implementation (NSDI 22) , pages 743 -- 759 , 2022 . Hun Namkung, Zaoxing Liu, Daehyeok Kim, Vyas Sekar, and Peter Steenkiste. Sketchlib: Enabling efficient sketch-based monitoring on programmable switches. In 19th USENIX Symposium on Networked Systems Design and Implementation (NSDI 22), pages 743--759, 2022."},{"key":"e_1_3_2_1_12_1","volume-title":"Advanced Persistent Threat: Understanding the Danger and How to Protect Your Organization","author":"Cole Eric","year":"2012","unstructured":"Eric Cole . Advanced Persistent Threat: Understanding the Danger and How to Protect Your Organization . Syngress Publishing , 2012 . Eric Cole. Advanced Persistent Threat: Understanding the Danger and How to Protect Your Organization. Syngress Publishing, 2012."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2019.2891891"},{"key":"e_1_3_2_1_14_1","unstructured":"fatedier\/frp: A fast reverse proxy to help you expose a local server behind a nat or firewall to the internet. https:\/\/github.com\/fatedier\/frp.  fatedier\/frp: A fast reverse proxy to help you expose a local server behind a nat or firewall to the internet. https:\/\/github.com\/fatedier\/frp."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.12.001"},{"key":"e_1_3_2_1_16_1","first-page":"435","volume-title":"Proceedings of the 2013 ACM Conference on Special Interest Group on Data Communication (SIGCOMM '13)","author":"Alizadeh Mohammad","year":"2013","unstructured":"Mohammad Alizadeh , Shuang Yang , Milad Sharif , Sachin Katti , Nick McKeown , Balaji Prabhakar , and Scott Shenker . Pfabric : Minimal near-optimal datacenter transport . In Proceedings of the 2013 ACM Conference on Special Interest Group on Data Communication (SIGCOMM '13) , page 435 -- 446 , 2013 . Mohammad Alizadeh, Shuang Yang, Milad Sharif, Sachin Katti, Nick McKeown, Balaji Prabhakar, and Scott Shenker. Pfabric: Minimal near-optimal datacenter transport. In Proceedings of the 2013 ACM Conference on Special Interest Group on Data Communication (SIGCOMM '13), page 435--446, 2013."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2785956.2787483"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2619239.2626297"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2006.884032"},{"key":"e_1_3_2_1_20_1","unstructured":"Source code and more details related to PISketch. https:\/\/github.com\/pkufzc\/PISketch.  Source code and more details related to PISketch. https:\/\/github.com\/pkufzc\/PISketch."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2002259.2002294"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3084452"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2043164.2018462"},{"key":"e_1_3_2_1_24_1","first-page":"792","volume-title":"2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","author":"Michael","year":"2011","unstructured":"Michael T. Goodrich and Michael Mitzenmacher. Invertible bloom lookup tables . In 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton) , pages 792 -- 799 , 2011 . Michael T. Goodrich and Michael Mitzenmacher. Invertible bloom lookup tables. In 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton), pages 792--799, 2011."},{"key":"e_1_3_2_1_25_1","volume-title":"Raptor codes. Foundations and trends\u00ae in communications and information theory, 6(3--4):213--322","author":"Shokrollahi Amin","year":"2011","unstructured":"Amin Shokrollahi , Michael Luby , Raptor codes. Foundations and trends\u00ae in communications and information theory, 6(3--4):213--322 , 2011 . Amin Shokrollahi, Michael Luby, et al. Raptor codes. Foundations and trends\u00ae in communications and information theory, 6(3--4):213--322, 2011."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2007.896150"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/948205.948236"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/964725.633056"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/646255.684566"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2012.2192447"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882948"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.14778\/3137628.3137652"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219978"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3183726"},{"key":"e_1_3_2_1_35_1","first-page":"991","volume-title":"18th USENIX Symposium on Networked Systems Design and Implementation (NSDI 21)","author":"Zhao Yikai","year":"2021","unstructured":"Yikai Zhao , Kaicheng Yang , Zirui Liu , Tong Yang , Li Chen , Shiyi Liu , Naiqian Zheng , Ruixin Wang , Hanbo Wu , Yi Wang , and Nicholas Zhang . Lightguardian : A Full-Visibility, lightweight, in-band telemetry system using sketchlets . In 18th USENIX Symposium on Networked Systems Design and Implementation (NSDI 21) , pages 991 -- 1010 , 2021 . Yikai Zhao, Kaicheng Yang, Zirui Liu, Tong Yang, Li Chen, Shiyi Liu, Naiqian Zheng, Ruixin Wang, Hanbo Wu, Yi Wang, and Nicholas Zhang. Lightguardian: A Full-Visibility, lightweight, in-band telemetry system using sketchlets. In 18th USENIX Symposium on Networked Systems Design and Implementation (NSDI 21), pages 991--1010, 2021."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"e_1_3_2_1_37_1","first-page":"4","volume-title":"World's fastest","author":"Barefoot","unstructured":"Barefoot tofino : World's fastest p 4 -programmable ethernet switch asics. https:\/\/barefootnetworks.com\/products\/brief-tofino\/. Barefoot tofino: World's fastest p4-programmable ethernet switch asics. https:\/\/barefootnetworks.com\/products\/brief-tofino\/."},{"key":"e_1_3_2_1_38_1","unstructured":"Bob jenkins' hash function web page paper published in dr dobb's journal. http:\/\/burtleburtle.net\/bob\/hash\/evahash.html.  Bob jenkins' hash function web page paper published in dr dobb's journal. http:\/\/burtleburtle.net\/bob\/hash\/evahash.html."},{"key":"e_1_3_2_1_39_1","unstructured":"The CAIDA Anonymized Internet Traces. https:\/\/www.caida.org\/catalog\/datasets\/overview\/.  The CAIDA Anonymized Internet Traces. https:\/\/www.caida.org\/catalog\/datasets\/overview\/."},{"key":"e_1_3_2_1_40_1","unstructured":"MAWI Working Group Traffic Archive. http:\/\/mawi.wide.ad.jp\/mawi\/.  MAWI Working Group Traffic Archive. http:\/\/mawi.wide.ad.jp\/mawi\/."},{"key":"e_1_3_2_1_41_1","unstructured":"The Network dataset Internet Traces. http:\/\/snap.stanford.edu\/data\/.  The Network dataset Internet Traces. http:\/\/snap.stanford.edu\/data\/."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2021.107937"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10586-017-1256-y"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-05063-4_13"},{"key":"e_1_3_2_1_46_1","volume-title":"Contagio malware data-base. https:\/\/www.mediafire.com\/folder\/c2az029ch6cke\/TRAFFIC_PATTERNS_COLLECTION#734479hwy1b97","author":"Parkour Mila","year":"2013","unstructured":"Mila Parkour ( 2013 ) Contagio malware data-base. https:\/\/www.mediafire.com\/folder\/c2az029ch6cke\/TRAFFIC_PATTERNS_COLLECTION#734479hwy1b97 . Mila Parkour (2013) Contagio malware data-base. https:\/\/www.mediafire.com\/folder\/c2az029ch6cke\/TRAFFIC_PATTERNS_COLLECTION#734479hwy1b97."},{"key":"e_1_3_2_1_47_1","unstructured":"The supplementary material of PISketch. https:\/\/github.com\/pkufzc\/PISketch\/blob\/main\/PISketch_Supplementary_Material.pdf.  The supplementary material of PISketch. https:\/\/github.com\/pkufzc\/PISketch\/blob\/main\/PISketch_Supplementary_Material.pdf."},{"key":"e_1_3_2_1_48_1","unstructured":"Tcpdump Examples. https:\/\/hackertarget.com\/tcpdump-examples\/.  Tcpdump Examples. https:\/\/hackertarget.com\/tcpdump-examples\/."}],"event":{"name":"SIGCOMM '22: ACM SIGCOMM 2022 Conference","location":"Amsterdam Netherlands","acronym":"SIGCOMM '22","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication"]},"container-title":["Proceedings of the ACM SIGCOMM Workshop on Formal Foundations and Security of Programmable Network Infrastructures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3528082.3544834","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3528082.3544834","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:02:25Z","timestamp":1750186945000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3528082.3544834"}},"subtitle":["finding persistent and infrequent flows"],"short-title":[],"issued":{"date-parts":[[2022,8,22]]},"references-count":47,"alternative-id":["10.1145\/3528082.3544834","10.1145\/3528082"],"URL":"https:\/\/doi.org\/10.1145\/3528082.3544834","relation":{},"subject":[],"published":{"date-parts":[[2022,8,22]]},"assertion":[{"value":"2022-08-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}