{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T15:54:07Z","timestamp":1772726047693,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":37,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,8,17]],"date-time":"2008-08-17T00:00:00Z","timestamp":1218931200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2008,8,17]]},"DOI":"10.1145\/1402958.1402983","type":"proceedings-article","created":{"date-parts":[[2008,8,19]],"date-time":"2008-08-19T08:38:39Z","timestamp":1219135119000},"page":"207-218","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":129,"title":["Deflating the big bang"],"prefix":"10.1145","author":[{"given":"Randy","family":"Smith","sequence":"first","affiliation":[{"name":"University of Wisconsin-Madison, Madison, WI, USA"}]},{"given":"Cristian","family":"Estan","sequence":"additional","affiliation":[{"name":"University of Wisconsin-Madison, Madison, WI, USA"}]},{"given":"Somesh","family":"Jha","sequence":"additional","affiliation":[{"name":"University of Wisconsin-Madison, Madison, WI, USA"}]},{"given":"Shijin","family":"Kong","sequence":"additional","affiliation":[{"name":"University of Wisconsin-Madison, Madison, WI, USA"}]}],"member":"320","published-online":{"date-parts":[[2008,8,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/360825.360855"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/565816.503274"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"M. Becchi and S. Cadambi. Memory-efficient regular expression search using state merging. In IEEE Infocom 2007.  M. Becchi and S. Cadambi. Memory-efficient regular expression search using state merging. In IEEE Infocom 2007.","DOI":"10.1109\/INFCOM.2007.128"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1323548.1323573"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150019.1136500"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2006.41"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/1025123.1025834"},{"key":"e_1_3_2_1_8_1","volume-title":"The MIT Press","author":"Clarke E. M.","year":"1999"},{"key":"e_1_3_2_1_9_1","volume-title":"Usenix Security","author":"Crosby S.","year":"2003"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2006.877131"},{"key":"e_1_3_2_1_11_1","unstructured":"The Guardian. Trouble on the line. http:\/\/technology. guardian.co.uk\/weekly\/story\/0 1747343 00.html 2006.  The Guardian. Trouble on the line. http:\/\/technology. guardian.co.uk\/weekly\/story\/0 1747343 00.html 2006."},{"key":"e_1_3_2_1_12_1","volume-title":"Usenix Security","author":"Handley M.","year":"2001"},{"key":"e_1_3_2_1_13_1","volume-title":"Bantam Book","author":"Hawking S. W.","year":"1988"},{"key":"e_1_3_2_1_14_1","volume-title":"2nd Edition. Morgan Kaufmann","author":"John","year":"1996"},{"key":"e_1_3_2_1_15_1","volume-title":"Addison Wesley","author":"Hopcroft J.","year":"2006"},{"key":"e_1_3_2_1_16_1","volume-title":"Virus Bulletin Weekly","author":"Jordan Myles","year":"2002"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1185347.1185352"},{"key":"e_1_3_2_1_18_1","unstructured":"P. Kapustka. Vonage complaining of VoIP blocking. http:\/\/www.networkcomputing.com\/channels\/~networkinfrastructure\/60400413 2005.  P. Kapustka. Vonage complaining of VoIP blocking. http:\/\/www.networkcomputing.com\/channels\/~networkinfrastructure\/60400413 2005."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1323548.1323574"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1159913.1159952"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1185347.1185359"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015047.1015055"},{"key":"e_1_3_2_1_23_1","volume-title":"Microprocessor Report","author":"McGhan H.","year":"2006"},{"key":"e_1_3_2_1_24_1","volume-title":"Morgan Kaufmann","author":"Muchnick S.","year":"1997"},{"key":"e_1_3_2_1_25_1","article-title":"Deep packet inspection: A service provider's solution for secure VoIP","author":"Neider M.","year":"2005","journal-title":"VoIP Magazine"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1389-1286(99)00112-7"},{"key":"e_1_3_2_1_27_1","volume-title":"Inc.","author":"Ptacek T.","year":"1998"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/1039834.1039864"},{"key":"e_1_3_2_1_29_1","volume-title":"IEEE Symp. on Security and Privacy","author":"Shankar U.","year":"2003"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACSAC.2006.17"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2008.14"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/948109.948145"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45234-8_85"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.2005.5"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2004.1354682"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015467.1015489"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1185347.1185360"}],"event":{"name":"SIGCOMM '08: ACM SIGCOMM 2008 Conference","location":"Seattle WA USA","acronym":"SIGCOMM '08","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the ACM SIGCOMM 2008 conference on Data communication"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1402958.1402983","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1402958.1402983","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:47:19Z","timestamp":1750243639000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1402958.1402983"}},"subtitle":["fast and scalable deep packet inspection with extended finite automata"],"short-title":[],"issued":{"date-parts":[[2008,8,17]]},"references-count":37,"alternative-id":["10.1145\/1402958.1402983","10.1145\/1402958"],"URL":"https:\/\/doi.org\/10.1145\/1402958.1402983","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1402946.1402983","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2008,8,17]]},"assertion":[{"value":"2008-08-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}