{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T15:25:23Z","timestamp":1780586723795,"version":"3.54.1"},"reference-count":24,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,7,9]],"date-time":"2023-07-09T00:00:00Z","timestamp":1688860800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,7,9]],"date-time":"2023-07-09T00:00:00Z","timestamp":1688860800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,7,9]]},"DOI":"10.1109\/iscc58397.2023.10218028","type":"proceedings-article","created":{"date-parts":[[2023,8,28]],"date-time":"2023-08-28T17:46:48Z","timestamp":1693244808000},"page":"342-347","source":"Crossref","is-referenced-by-count":3,"title":["P4CTM: Compressed Traffic Pattern Matching Based on Programmable Data Plane"],"prefix":"10.1109","author":[{"given":"Hang","family":"Lin","sequence":"first","affiliation":[{"name":"College of Computer and Data Science, Fuzhou University,Fuzhou,China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Weiwei","family":"Lin","sequence":"additional","affiliation":[{"name":"College of Computer and Data Science, Fuzhou University,Fuzhou,China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jing","family":"Lin","sequence":"additional","affiliation":[{"name":"College of Computer and Data Science, Fuzhou University,Fuzhou,China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Longlong","family":"Zhu","sequence":"additional","affiliation":[{"name":"College of Computer and Data Science, Fuzhou University,Fuzhou,China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dong","family":"Zhang","sequence":"additional","affiliation":[{"name":"College of Computer and Data Science, Fuzhou University,Fuzhou,China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chunming","family":"Wu","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, Zhejiang University,Hangzhou,China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2656877.2656890"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2015.7218421"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/HPSR.2018.8850761"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/icc.2011.5962596"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3314148.3314356"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3360468.3368184"},{"key":"ref20","year":"0","journal-title":"Sourcefire Snort The Open Source Network Intrusion Detection System"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2018.12.008"},{"key":"ref22","year":"0","journal-title":"Intel Tofino World's fastest p4-programmable ethernet switch asics"},{"key":"ref10","first-page":"227","article-title":"Fast regular expression matching using fpgas","author":"sidhu","year":"0","journal-title":"Annual IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM'01)"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/MILCOM.2018.8599726"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2016.2566669"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.compeleceng.2021.107169"},{"key":"ref17","article-title":"Bolt: Scalable and cost-efficient multi string pattern matching with programmable switches","author":"wang","year":"2022","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM42981.2021.9488796"},{"key":"ref19","year":"0","journal-title":"P4 Language Consortium Behavioral Model (bmv2)"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2445572.2445576"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2382196.2382232"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA47549.2020.00017"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/FCCM.2004.50"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2012.01.017"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2011.2172456"},{"key":"ref6","first-page":"631","article-title":"Hyperscan: A fast multi-pattern regex matcher for modern cpus","volume":"19","author":"wang","year":"0","journal-title":"NSDI"},{"key":"ref5","first-page":"551","article-title":"{DFC}: Accelerating string pattern matching for network applications","author":"choi","year":"0","journal-title":"13th USENIX Symposium on Networked Systems Design and Implementation ( NSDI 16)"}],"event":{"name":"2023 IEEE Symposium on Computers and Communications (ISCC)","location":"Gammarth, Tunisia","start":{"date-parts":[[2023,7,9]]},"end":{"date-parts":[[2023,7,12]]}},"container-title":["2023 IEEE Symposium on Computers and Communications (ISCC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10217219\/10217829\/10218028.pdf?arnumber=10218028","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,25]],"date-time":"2023-09-25T17:50:35Z","timestamp":1695664235000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10218028\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,9]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/iscc58397.2023.10218028","relation":{},"subject":[],"published":{"date-parts":[[2023,7,9]]}}}