{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:30:55Z","timestamp":1725489055859},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540735465"},{"type":"electronic","value":"9783540735472"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73547-2_55","type":"book-chapter","created":{"date-parts":[[2007,8,11]],"date-time":"2007-08-11T14:54:52Z","timestamp":1186844092000},"page":"539-548","source":"Crossref","is-referenced-by-count":0,"title":["A Property-Based Technique for Tolerating Faults in Bloom Filters for Deep Packet Inspection"],"prefix":"10.1007","author":[{"given":"Yoon-Hwa","family":"Choi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Myeong-Hyeon","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"7","key":"55_CR1","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"B. Bloom","year":"1970","unstructured":"Bloom, B.: Space\/time tradeoffs in hash coding with allowable errors. Communications of the ACM\u00a013(7), 422\u2013426 (1970)","journal-title":"Communications of the ACM"},{"key":"55_CR2","doi-asserted-by":"crossref","unstructured":"Dharmapurikar, S., Krishnamurthy, P., Sproull, T.S., Lockwood, J.W.: Deep packet inspection using parallel Bloom filters. IEEE Micro, 52\u201361 (2004)","DOI":"10.1109\/MM.2004.1268997"},{"key":"55_CR3","doi-asserted-by":"crossref","unstructured":"Artan, N.S., Chao, H.J.: Multi-packet signature detection using prefix Bloom filters. IEEE GlOBECOM, 1811\u20131816 (2005)","DOI":"10.1109\/GLOCOM.2005.1577961"},{"key":"55_CR4","doi-asserted-by":"crossref","unstructured":"Broder, A., Mitzenmacher, M.: Network applications of Bloom filters: A survey. Internet Mathematics, 485\u2013509 (2003)","DOI":"10.1080\/15427951.2004.10129096"},{"issue":"12","key":"55_CR5","doi-asserted-by":"publisher","first-page":"1378","DOI":"10.1109\/12.641938","volume":"46","author":"M.V. Ramakrishna","year":"1997","unstructured":"Ramakrishna, M.V., Fu, E., Bahcekapilli, E.: Efficient hardware hashing functions for high performance computers. IEEE Trans. Computers\u00a046(12), 1378\u20131381 (1997)","journal-title":"IEEE Trans. Computers"},{"key":"55_CR6","doi-asserted-by":"crossref","unstructured":"Tan, L., Sherwood, T.: A high throughput string matching architecture for intrusion detection and prevention. IEEE Int. Symp. Comput. Arch. 112\u2013122 (2005)","DOI":"10.1145\/1080695.1069981"},{"key":"55_CR7","doi-asserted-by":"crossref","unstructured":"Sourdis, I., Pnevmatikatos, D.N., Wong, S., Vassiliadis, S.: A reconfigurable perfect-hashing scheme for packet inspection. In: IEEE Int. Conf. Field Programmable Logic and Applications, pp. 644\u2013647 (2005)","DOI":"10.1109\/FPL.2005.1515804"},{"key":"55_CR8","doi-asserted-by":"crossref","unstructured":"Tuck, N., Sherwood, T., Calder, B., Varghese, G.: Deterministic memory-efficient string matching algorithms for intrusion detection. IEEE Infocom, pp. 2628\u20132639 (2004)","DOI":"10.1109\/INFCOM.2004.1354682"}],"container-title":["Lecture Notes in Computer Science","Autonomic and Trusted Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73547-2_55.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:16:07Z","timestamp":1605762967000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73547-2_55"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540735465","9783540735472"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73547-2_55","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}