{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T00:47:01Z","timestamp":1777682821522,"version":"3.51.4"},"reference-count":25,"publisher":"SAGE Publications","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["JHS"],"published-print":{"date-parts":[[2020,6,12]]},"DOI":"10.3233\/jhs-200634","type":"journal-article","created":{"date-parts":[[2020,6,5]],"date-time":"2020-06-05T12:24:23Z","timestamp":1591359863000},"page":"125-140","source":"Crossref","is-referenced-by-count":1,"title":["Many-field packet classification using CR-tree"],"prefix":"10.1177","volume":"26","author":[{"given":"Aladdin","family":"Abdulhassan","sequence":"first","affiliation":[{"name":"Department of Computer Engineering and Information Technology, Razi University, Kermanshah, Iran"},{"name":"Department of Information Network, Information Technology, University of Babylon, Babylon, Iraq"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mahmood","family":"Ahmadi","sequence":"additional","affiliation":[{"name":"Department of Computer Engineering and Information Technology, Razi University, Kermanshah, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","reference":[{"issue":"2","key":"10.3233\/JHS-200634_ref2","doi-asserted-by":"publisher","first-page":"302","DOI":"10.3390\/fi6020302","article-title":"Software-defined networking using OpenFlow: Protocols, applications and architectural design choices","volume":"6","author":"Braun","year":"2014","journal-title":"Future Internet"},{"key":"10.3233\/JHS-200634_ref3","doi-asserted-by":"crossref","unstructured":"M.\u00a0Buddhikot, M.S.\u00a0Suri and M.\u00a0Waldvogel, Space decomposition techniques for fast layer-4 switching, in: Proc. Conf. Protoc. High Speed Netw., 1999, pp.\u00a025\u201341.","DOI":"10.1007\/978-0-387-35580-1_4"},{"issue":"2","key":"10.3233\/JHS-200634_ref4","doi-asserted-by":"publisher","first-page":"582","DOI":"10.1109\/TC.2013.227","article-title":"Packet classification using dynamically generated decision trees","volume":"64","author":"Cheng","year":"2015","journal-title":"IEEE Trans. Comput."},{"key":"10.3233\/JHS-200634_ref5","doi-asserted-by":"crossref","unstructured":"B.\u00a0Fan, D.G.\u00a0Andersen, M.\u00a0Kaminsky and M.D.\u00a0Mitzenmacher, Cuckoo filter: Practically better than Bloom, in: Proc. 10th ACM Int. Conf. Emerg. Netw. Exp. Technol., ACM, 2014, pp.\u00a075\u201388.","DOI":"10.1145\/2674005.2674994"},{"issue":"5","key":"10.3233\/JHS-200634_ref6","doi-asserted-by":"publisher","first-page":"1135","DOI":"10.1109\/TPDS.2013.261","article-title":"A scalable and modular architecture for high-performance packet classification","volume":"25","author":"Ganegedara","year":"2014","journal-title":"IEEE Trans. Parallel Distrib. Sys."},{"key":"10.3233\/JHS-200634_ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-25512-5_4"},{"issue":"2","key":"10.3233\/JHS-200634_ref8","first-page":"47","article-title":"R-trees: A dynamic index structure for spatial searching","volume":"14","author":"Guttman","year":"1984","journal-title":"ACM"},{"key":"10.3233\/JHS-200634_ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ANCS.2015.7110131"},{"key":"10.3233\/JHS-200634_ref10","doi-asserted-by":"publisher","DOI":"10.1145\/285243.285283"},{"issue":"8","key":"10.3233\/JHS-200634_ref11","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1109\/LCOMM.2007.070389","article-title":"Hierarchical binary search tree for packet classification","volume":"11","author":"Lim","year":"2007","journal-title":"IEEE Commun. Lett."},{"issue":"2","key":"10.3233\/JHS-200634_ref12","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1109\/TNET.2013.2254124","article-title":"Boundary cutting for packet classification","volume":"22","author":"Lim","year":"2014","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"3","key":"10.3233\/JHS-200634_ref13","first-page":"1295","article-title":"Packet classification using binary content addressable memory","volume":"24","author":"Liu","year":"2016","journal-title":"Biol. Cybern."},{"key":"10.3233\/JHS-200634_ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-293-5_1"},{"key":"10.3233\/JHS-200634_ref16","doi-asserted-by":"crossref","unstructured":"R.\u00a0Pagh and F.F.\u00a0Rodler, Cuckoo Hashing, Springer, Berlin, 2001.","DOI":"10.7146\/brics.v8i32.21692"},{"issue":"1","key":"10.3233\/JHS-200634_ref17","first-page":"37","article-title":"High performance and high scalable packet classification algorithm for network security systems","volume":"14","author":"Pak","year":"2017","journal-title":"IEEE Trans. Dependable Secur. Comput."},{"key":"10.3233\/JHS-200634_ref18","unstructured":"G.\u00a0Pankaj and N.\u00a0McKeown, Packet classification using hierarchical intelligent cuttings, in: Proc. Hot Interconnects VII, 1999."},{"key":"10.3233\/JHS-200634_ref19","doi-asserted-by":"publisher","DOI":"10.1145\/316194.316217"},{"issue":"11","key":"10.3233\/JHS-200634_ref20","doi-asserted-by":"publisher","first-page":"1348","DOI":"10.1016\/j.patrec.2010.04.004","article-title":"Locality sensitive hashing: A comparison of hash function types and querying mechanisms","volume":"31","author":"Pauleve","year":"2010","journal-title":"Pattern Recognit. Lett."},{"issue":"6","key":"10.3233\/JHS-200634_ref21","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1007\/s10766-014-0325-6","article-title":"A decomposition-based approach for scalable many-field packet classification on multi-core processors","volume":"43","author":"Qu","year":"2015","journal-title":"Int. J. Parallel Program."},{"issue":"2","key":"10.3233\/JHS-200634_ref22","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1109\/TNET.2007.892845","article-title":"O ( log W ) multidimensional packet classification","volume":"15","author":"Sahni","year":"2007","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"10.3233\/JHS-200634_ref23","doi-asserted-by":"publisher","DOI":"10.1145\/316188.316216"},{"key":"10.3233\/JHS-200634_ref24","doi-asserted-by":"publisher","DOI":"10.1145\/285243.285282"},{"issue":"4","key":"10.3233\/JHS-200634_ref25","first-page":"191","article-title":"Fast and scalable layer four switching","volume":"28","author":"Srinivasan","year":"1998","journal-title":"ACM"},{"issue":"3","key":"10.3233\/JHS-200634_ref27","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1109\/TNET.2007.893156","article-title":"Classbench: A packet classification benchmark","volume":"15","author":"Taylor","year":"2007","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"3","key":"10.3233\/JHS-200634_ref28","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/j.comnet.2003.09.004","article-title":"Multiway range trees: Scalable IP lookup with fast updates","volume":"44","author":"Warkhede","year":"2004","journal-title":"Comput. Netw."}],"container-title":["Journal of High Speed Networks"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/JHS-200634","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T08:44:13Z","timestamp":1777452253000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/JHS-200634"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,12]]},"references-count":25,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.3233\/jhs-200634","relation":{},"ISSN":["1875-8940","0926-6801"],"issn-type":[{"value":"1875-8940","type":"electronic"},{"value":"0926-6801","type":"print"}],"subject":[],"published":{"date-parts":[[2020,6,12]]}}}