iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://api.crossref.org/works/10.1016/J.COMCOM.2015.02.004
{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,6]],"date-time":"2024-07-06T15:36:30Z","timestamp":1720280190519},"reference-count":37,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2015,5,1]],"date-time":"2015-05-01T00:00:00Z","timestamp":1430438400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computer Communications"],"published-print":{"date-parts":[[2015,5]]},"DOI":"10.1016\/j.comcom.2015.02.004","type":"journal-article","created":{"date-parts":[[2015,2,21]],"date-time":"2015-02-21T19:30:17Z","timestamp":1424547017000},"page":"47-58","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":22,"special_numbering":"C","title":["Algorithms to speedup pattern matching for network intrusion detection systems"],"prefix":"10.1016","volume":"62","author":[{"given":"Kai","family":"Zheng","sequence":"first","affiliation":[]},{"given":"Zhiping","family":"Cai","sequence":"additional","affiliation":[]},{"given":"Xin","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Zhijun","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Baohua","family":"Yang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.comcom.2015.02.004_b0005","unstructured":"2005 FBI Computer Crime Survey. ."},{"key":"10.1016\/j.comcom.2015.02.004_b0010","unstructured":"SNORT \u2013 the de facto standard for intrusion detection\/prevention. ."},{"issue":"6","key":"10.1016\/j.comcom.2015.02.004_b0015","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1145\/360825.360855","article-title":"Efficient string matching: an aid to bibliographic search","volume":"18","author":"Aho","year":"1975","journal-title":"Commun. ACM"},{"issue":"10","key":"10.1016\/j.comcom.2015.02.004_b0020","doi-asserted-by":"crossref","first-page":"762","DOI":"10.1145\/359842.359859","article-title":"A fast string searching algorithm","volume":"20","author":"Boyer","year":"1977","journal-title":"Commun. ACM"},{"key":"10.1016\/j.comcom.2015.02.004_b0025","doi-asserted-by":"crossref","unstructured":"M. Becchi, P. Crowley, A hybrid finite automaton for practical deep packet inspection, in: ACM International Conference on emerging Networking Experiments and Technologies Conference (CoNEXT), 2007.","DOI":"10.1145\/1364654.1364656"},{"key":"10.1016\/j.comcom.2015.02.004_b0030","doi-asserted-by":"crossref","unstructured":"Kun Huang, Linxuan Ding, Gaogang Xie, Dafang Zhang, Alex X. Liu, Kav\u00e9 Salamatian, Scalable TCAM-based regular expression matching with compressed finite automata, in: ACM\/IEEE Symposium on Architecture for Networking and Communications Systems (ANCS), 2013.","DOI":"10.1109\/ANCS.2013.6665178"},{"key":"10.1016\/j.comcom.2015.02.004_b0035","doi-asserted-by":"crossref","unstructured":"S. Kumar, S. Dharmapurikar, F. Yu, P. Crowley, J. Turner, Algorithms to Accelerate Multiple Regular Expressions Matching for Deep Packet Inspection, ACM SIGCOMM, 2006.","DOI":"10.1145\/1159913.1159952"},{"key":"10.1016\/j.comcom.2015.02.004_b0040","doi-asserted-by":"crossref","unstructured":"R. Smith, C. Estan, S. Jha, XFA: faster S signature matching with extended automata, in: IIEEE Symposium on Security and Privacy (S&P), 2008.","DOI":"10.1109\/SP.2008.14"},{"key":"10.1016\/j.comcom.2015.02.004_b0045","doi-asserted-by":"crossref","unstructured":"N. Tuck, T. Sherwood, B. Calder, G. Varghese, Deterministic memory-efficient string matching algorithms for intrusion detection, in: IEEE INFOCOM, 2004.","DOI":"10.1109\/INFCOM.2004.1354682"},{"key":"10.1016\/j.comcom.2015.02.004_b0050","doi-asserted-by":"crossref","unstructured":"F. Yu, Z. Chen, Y. Diao, T.V. Lakshman, R.H. Katz, Fast and memory-efficient regular expression matching for deep packet inspection, in: ACM\/IEEE symposium on Architecture for Networking and Communications Systems (ANCS), 2006.","DOI":"10.1145\/1185347.1185360"},{"issue":"2","key":"10.1016\/j.comcom.2015.02.004_b0055","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1109\/TC.2010.273","article-title":"An efficient TCAM-based implementation of multi-pattern matching using covered state encoding","volume":"61","author":"Yun","year":"2012","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/j.comcom.2015.02.004_b0060","unstructured":"C.J. Coit, S. Staniford, J. McAlerney, Towards faster string matching for intrusion detection or exceeding the speed of SNORT, in: DARPA Information Survivability Conference and Exposition (DISCEX II\u201901), 2001."},{"key":"10.1016\/j.comcom.2015.02.004_b0065","doi-asserted-by":"crossref","unstructured":"C. Kruegel, F. Valeur, Stateful intrusion detection for high-speed networks, in: IEEE Symposium on Research on Security and Privacy, 2002.","DOI":"10.1109\/SECPRI.2002.1004378"},{"issue":"4","key":"10.1016\/j.comcom.2015.02.004_b0070","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1016\/j.comcom.2009.10.010","article-title":"An efficient network intrusion detection","volume":"33","author":"Chen","year":"2010","journal-title":"Comput. Commun."},{"issue":"18","key":"10.1016\/j.comcom.2015.02.004_b0075","doi-asserted-by":"crossref","first-page":"2227","DOI":"10.1016\/j.comcom.2011.07.001","article-title":"Practical real-time intrusion detection using machine learning approaches","volume":"34","author":"Sangkatsanee","year":"2011","journal-title":"Comput. Commun."},{"issue":"10\u201311","key":"10.1016\/j.comcom.2015.02.004_b0190","doi-asserted-by":"crossref","first-page":"1255","DOI":"10.1016\/j.comcom.2013.03.002","article-title":"A memory-based NFA regular expression match engine for signature-based intrusion detection","volume":"36","author":"Pao","year":"2013","journal-title":"Comput. Commun."},{"key":"10.1016\/j.comcom.2015.02.004_b0085","unstructured":"Bleeding snort. Blog about computer and network security and protection. ."},{"key":"10.1016\/j.comcom.2015.02.004_b0090","doi-asserted-by":"crossref","unstructured":"N.S. Artan, H.J. Chao, TriBiCa: trie bitmap content analyzer for high-speed network intrusion detection, in: IEEE INFOCOM, 2007.","DOI":"10.1109\/INFCOM.2007.23"},{"key":"10.1016\/j.comcom.2015.02.004_b0095","doi-asserted-by":"crossref","DOI":"10.1109\/MM.2004.1268997","article-title":"Deep packet inspection using parallel bloom filters","volume":"24","author":"Dharmapurikar","year":"2004","journal-title":"IEEE Micro"},{"issue":"10","key":"10.1016\/j.comcom.2015.02.004_b0100","doi-asserted-by":"crossref","first-page":"1781","DOI":"10.1109\/JSAC.2006.877131","article-title":"Fast and scalable pattern matching for network intrusion detection systems","volume":"24","author":"Dharmapurikar","year":"2006","journal-title":"IEEE J. Select. Areas Commun."},{"key":"10.1016\/j.comcom.2015.02.004_b0105","doi-asserted-by":"crossref","unstructured":"C.R. Clark, D.E. Schimmel, Scalable pattern matching for high speed networks, in: IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM\u201904), 2004.","DOI":"10.1109\/FCCM.2004.50"},{"key":"10.1016\/j.comcom.2015.02.004_b0110","unstructured":"F. Yu, R.H. Katz, T.V. Lakshman, Gigabit rate packet pattern-matching using TCAM in: Proceedings of the Network Protocols, 12th IEEE International Conference on (ICNP\u201904) IEEE Computer Society, 2004, pp. 174\u2013183."},{"key":"10.1016\/j.comcom.2015.02.004_b0115","unstructured":"B.L. Hutchings, R. Franklin, D. Carver, Assisting network intrusion detection with reconfigurable hardware, in: IEEE symposium on Field-Programmable Custom Computing Machines (FCCM\u201902), Napa, USA, 2002."},{"key":"10.1016\/j.comcom.2015.02.004_b0120","doi-asserted-by":"crossref","unstructured":"Y.H. Cho, W.H. Mangione-Smith, Fast reconfiguring deep packet filter for 1+ gigabit network, in: IEEE Symposium on Field Programmable Custom Computing Machines (FCCM), 2005.","DOI":"10.1109\/FCCM.2005.34"},{"key":"10.1016\/j.comcom.2015.02.004_b0125","doi-asserted-by":"crossref","unstructured":"J.v. Lunteren, High-performance pattern-matching engine for intrusion detection, in: IEEE INFOCOM, 2006.","DOI":"10.1109\/INFOCOM.2006.204"},{"key":"10.1016\/j.comcom.2015.02.004_b0130","doi-asserted-by":"crossref","unstructured":"S. Dharmapurikar, J. Lockwood, Fast and scalable pattern matching for content filtering, in: ACM\/IEEE Symposium on Architectures for Networking and Communications Systems, 2005.","DOI":"10.1145\/1095890.1095916"},{"key":"10.1016\/j.comcom.2015.02.004_b0135","doi-asserted-by":"crossref","unstructured":"G. Vasiliadis, M. Polychronakis, S. Loannidis, MIDeA: a multi-parallel intrusion-parallel intrusion detection architecture, in: ACM Conference on Computer and Communications Security (CCS), 2011.","DOI":"10.1145\/2046707.2046741"},{"issue":"4","key":"10.1016\/j.comcom.2015.02.004_b0140","doi-asserted-by":"crossref","first-page":"863","DOI":"10.1109\/TNET.2006.880171","article-title":"A TCAM-based distributed parallel IP lookup scheme and performance analysis","volume":"14","author":"Zheng","year":"2006","journal-title":"ACM\/IEEE Trans. Network."},{"issue":"1","key":"10.1016\/j.comcom.2015.02.004_b0145","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1109\/TNET.2013.2256466","article-title":"Fast regular expression matching using small TCAM","volume":"22","author":"Meiners","year":"2014","journal-title":"IEEE\/ACM Trans. Network."},{"key":"10.1016\/j.comcom.2015.02.004_b0150","doi-asserted-by":"crossref","unstructured":"K. Peng, S. Tang, M. Chen, Chain-based DFA deflation for fast and scalable regular expression matching using TCAM, in: ACM\/IEEE Seventh Symposium on Architectures for Networking and Communications Systems, 2011.","DOI":"10.1109\/ANCS.2011.13"},{"key":"10.1016\/j.comcom.2015.02.004_b0155","first-page":"2049","article-title":"On finding an optimal TCAM encoding scheme for packet classification","volume":"2013","author":"Rottenstreich","year":"2013","journal-title":"IEEE INFOCOM"},{"key":"10.1016\/j.comcom.2015.02.004_b0160","doi-asserted-by":"crossref","unstructured":"Kirill Kogan, Sergey Nikolenko, Ori Rottenstreich, William Culhane, Patrick Eugster, SAX-PAC (Scalable And eXpressive PAcket Classification), in: SIGCOMM 2014, ACM, New York, NY, USA, pp. 15\u201326.","DOI":"10.1145\/2740070.2626294"},{"key":"10.1016\/j.comcom.2015.02.004_b0165","doi-asserted-by":"crossref","unstructured":"K. Peng, Q. Dong, M. Chen, TCAM-based DFA deflation: a novel approach to fast and scalable regular expression matching, in: 19th International Workshop on Quality of Service, (IWQoS), 2011.","DOI":"10.1109\/IWQOS.2011.5931323"},{"issue":"3","key":"10.1016\/j.comcom.2015.02.004_b0170","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1109\/TC.2011.255","article-title":"A distributed TCAM coprocessor architecture for integrated longest prefix matching, policy filtering and content filtering","volume":"62","author":"Cai","year":"2013","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/j.comcom.2015.02.004_b0175","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1145\/1111322.1111336","article-title":"Why flow-completion time is the right metric for congestion control","volume":"36","author":"Dukkipati","year":"2006","journal-title":"ACM SIGCOMM Comput. Commun. Rev."},{"key":"10.1016\/j.comcom.2015.02.004_b0180","unstructured":"MIT DARPA Intrusion Detection Data Sets. ."},{"key":"10.1016\/j.comcom.2015.02.004_b0185","unstructured":"NetLogic Microsystems. ."}],"container-title":["Computer Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366415000559?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366415000559?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,8,21]],"date-time":"2019-08-21T00:25:13Z","timestamp":1566347113000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0140366415000559"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5]]},"references-count":37,"alternative-id":["S0140366415000559"],"URL":"http:\/\/dx.doi.org\/10.1016\/j.comcom.2015.02.004","relation":{},"ISSN":["0140-3664"],"issn-type":[{"value":"0140-3664","type":"print"}],"subject":[],"published":{"date-parts":[[2015,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Algorithms to speedup pattern matching for network intrusion detection systems","name":"articletitle","label":"Article Title"},{"value":"Computer Communications","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.comcom.2015.02.004","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2015 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}