{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,3]],"date-time":"2024-09-03T18:25:24Z","timestamp":1725387924026},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,12]]},"DOI":"10.1109\/glocom.2010.5683165","type":"proceedings-article","created":{"date-parts":[[2011,1,10]],"date-time":"2011-01-10T21:19:12Z","timestamp":1294694352000},"page":"1-5","source":"Crossref","is-referenced-by-count":2,"title":["Skip Finite Automaton: A Content Scanning Engine to Secure Enterprise Networks"],"prefix":"10.1109","author":[{"given":"Junchen","family":"Jiang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yi","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bin","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yang","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaofei","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","article-title":"A survey and comparison of peer-to-peer overlay network schemes","author":"lua","year":"2005","journal-title":"Communications Surveys & Tutorials"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/945472.945475"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557283"},{"key":"ref13","article-title":"KaZaA Delivers More Than Tunes","author":"zetter","year":"2004","journal-title":"Wired Magazine"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/1177080.1177125"},{"year":"0","key":"ref15"},{"journal-title":"String matching An aid to bibliographic search","year":"1975","author":"aho","key":"ref16"},{"journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","article-title":"Bounded component spanning forest","year":"1979","key":"ref17"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872770"},{"key":"ref4","article-title":"Xfas: Faster signature matching with extended automata","author":"smith","year":"2008","journal-title":"IEEE Symposium on Security and Privacy (Oakland)"},{"journal-title":"Clam AntiVirus","year":"0","key":"ref3"},{"key":"ref6","article-title":"Algorithms to accelerate multiple regular expressions matching for deep packet inspection","author":"kumar","year":"2007","journal-title":"Proc of ACM SIGCOMM"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5061946"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.2006.7"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1402958.1402983"},{"year":"0","key":"ref2"},{"journal-title":"Congress to probe p2p sites over ‘inadvertent sharing’","year":"2009","author":"sandoval","key":"ref1"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2010.5501973"}],"event":{"name":"GLOBECOM 2010 - 2010 IEEE Global Communications Conference","start":{"date-parts":[[2010,12,6]]},"location":"Miami, FL, USA","end":{"date-parts":[[2010,12,10]]}},"container-title":["2010 IEEE Global Telecommunications Conference GLOBECOM 2010"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5682081\/5683069\/05683165.pdf?arnumber=5683165","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T05:15:10Z","timestamp":1490073310000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5683165\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,12]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/glocom.2010.5683165","relation":{},"subject":[],"published":{"date-parts":[[2010,12]]}}}