{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T00:32:03Z","timestamp":1725582723354},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642207563"},{"type":"electronic","value":"9783642207570"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-20757-0_5","type":"book-chapter","created":{"date-parts":[[2011,4,28]],"date-time":"2011-04-28T01:49:00Z","timestamp":1303955340000},"page":"52-65","source":"Crossref","is-referenced-by-count":1,"title":["Efficient Processing of Multi-connection Compressed Web Traffic"],"prefix":"10.1007","author":[{"given":"Yehuda","family":"Afek","sequence":"first","affiliation":[]},{"given":"Anat","family":"Bremler-Barr","sequence":"additional","affiliation":[]},{"given":"Yaron","family":"Koral","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Bremler-Barr, A., Koral, Y.: Accelerating multi-patterns matching on compressed HTTP. In: INFOCOM 2009 (April 2009)","DOI":"10.1109\/INFCOM.2009.5061944"},{"key":"5_CR2","unstructured":"Hypertext transfer protocol \u2013 http\/1.1, RFC 2616 (June 1999), \n                    \n                      http:\/\/www.ietf.org\/rfc\/rfc2616.txt."},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Ziv, J., Lempel, A.: A universal algorithm for sequential data compression. IEEE Transactions on Information Theory, 337\u2013343 (May 1977)","DOI":"10.1109\/TIT.1977.1055714"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Huffman, D.: A method for the construction of minimum-redundancy codes. In: Proceedings of IRE, pp. 1098\u20131101 (1952)","DOI":"10.1109\/JRPROC.1952.273898"},{"key":"5_CR5","unstructured":"zlib 1.2.5 (April 2010), \n                    \n                      http:\/\/www.zlib.net"},{"key":"5_CR6","unstructured":"Fisk, M., Varghese, G.: An analysis of fast string matching applied to content-based forwarding and intrusion detection. Techical Report CS2001-0670 (updated version) (2002)"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Aho, A., Corasick, M.: Efficient string matching: an aid to bibliographic search. Communications of the ACM, 333\u2013340 (1975)","DOI":"10.1145\/360825.360855"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Boyer, R., Moore, J.: A fast string searching algorithm. Communications of the ACM, 762\u2013772 (October 1977)","DOI":"10.1145\/359842.359859"},{"key":"5_CR9","unstructured":"Clam antivirus. \n                    \n                      http:\/\/www.clamav.net\n                    \n                    \n                  (version 0.82)"},{"key":"5_CR10","unstructured":"Snort, \n                    \n                      http:\/\/www.snort.org\n                    \n                    \n                   (accessed on May 2010)."},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Lin, W., Liu, B.: Pipelined parallel ac-based approach for multi-string matching. In: ICPADS (2008)","DOI":"10.1109\/ICPADS.2008.47"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"van Lunteren, J.: High-performance pattern-matching for intrusion detection. In: INFOCOM, pp. 1\u201313 (April 2006)","DOI":"10.1109\/INFOCOM.2006.204"},{"key":"5_CR13","first-page":"110","volume-title":"Micro","author":"L. Tan","year":"2006","unstructured":"Tan, L., Sherwood, T.: Architectures for bit-split string scanning in intrusion detection. In: Micro, pp. 110\u2013117. IEEE, Los Alamitos (2006)"},{"key":"5_CR14","unstructured":"Oberhumer, M.F.: LZO, \n                    \n                      http:\/\/www.oberhumer.com\/opensource\/lzo"},{"key":"5_CR15","unstructured":"Top sites (July 2010), \n                    \n                      http:\/\/www.alexa.com\/topsites"}],"container-title":["Lecture Notes in Computer Science","NETWORKING 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20757-0_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:00:21Z","timestamp":1606186821000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20757-0_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642207563","9783642207570"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20757-0_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}