{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:29:27Z","timestamp":1750220967344,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":17,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,4,3]],"date-time":"2019-04-03T00:00:00Z","timestamp":1554249600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,4,3]]},"DOI":"10.1145\/3314148.3314346","type":"proceedings-article","created":{"date-parts":[[2019,10,7]],"date-time":"2019-10-07T13:24:18Z","timestamp":1570454658000},"page":"29-35","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["How to deal with range-based packet classifiers"],"prefix":"10.1145","author":[{"given":"Vitalii","family":"Demianiuk","sequence":"first","affiliation":[{"name":"IMDEA Networks Institute, Steklov Institute of Mathematics at St. Petersburg"}]},{"given":"Kirill","family":"Kogan","sequence":"additional","affiliation":[{"name":"IMDEA Networks Institute"}]}],"member":"320","published-online":{"date-parts":[[2019,4,3]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2018.2797690"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2012.04.026"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2010.267"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Yeim-Kuan Chang and Cheng-Chien Su. 2007. Efficient TCAM Encoding Schemes for Packet Classification Using Gray Code. In GLOBECOM. 1834--1839.  Yeim-Kuan Chang and Cheng-Chien Su. 2007. Efficient TCAM Encoding Schemes for Packet Classification Using Gray Code. In GLOBECOM. 1834--1839.","DOI":"10.1109\/GLOCOM.2007.353"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2007.70838"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Pavel Chuprikov Kirill Kogan and Sergey I. Nikolenko. 2017. General ternary bit strings on commodity longest-prefix-match infrastructures. In ICNP. 1--10.  Pavel Chuprikov Kirill Kogan and Sergey I. Nikolenko. 2017. General ternary bit strings on commodity longest-prefix-match infrastructures. In ICNP. 1--10.","DOI":"10.1109\/ICNP.2017.8117542"},{"key":"e_1_3_2_1_7_1","unstructured":"How to deal with range-based packet classifiers {n. d.}. How to deal with range-based packet classifiers. https:\/\/github.com\/sosrranges\/subranges.  How to deal with range-based packet classifiers {n. d.}. How to deal with range-based packet classifiers. https:\/\/github.com\/sosrranges\/subranges."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Richard M. Karp. 1972. Reducibility among Combinatorial Problems. Springer US Boston MA 85--103.  Richard M. Karp. 1972. Reducibility among Combinatorial Problems. Springer US Boston MA 85--103.","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"Kirill Kogan Sergey I. Nikolenko Patrick Eugster Alexander Shalimov and Ori Rottenstreich. 2016. FIB efficiency in distributed platforms. In ICNP. 1--10.  Kirill Kogan Sergey I. Nikolenko Patrick Eugster Alexander Shalimov and Ori Rottenstreich. 2016. FIB efficiency in distributed platforms. In ICNP. 1--10.","DOI":"10.1109\/ICNP.2016.7784452"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/3001647.3001691"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1080091.1080115"},{"key":"e_1_3_2_1_12_1","unstructured":"Netlogic Microsystems. Content addressable memory {n. d.}. Netlogic Microsystems. Content addressable memory. http:\/\/www.netlogicmicro.com.  Netlogic Microsystems. Content addressable memory {n. d.}. Netlogic Microsystems. Content addressable memory. http:\/\/www.netlogicmicro.com."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOMW.2016.7562132"},{"key":"e_1_3_2_1_14_1","unstructured":"OpenFlow 1.3 specification 2012 2012. OpenFlow 1.3 specification 2012. http:\/\/www.openflow.org\/wk\/index.php\/OpenFlow_1_3_proposal.  OpenFlow 1.3 specification 2012 2012. OpenFlow 1.3 specification 2012. http:\/\/www.openflow.org\/wk\/index.php\/OpenFlow_1_3_proposal."},{"key":"e_1_3_2_1_15_1","unstructured":"P416 Language Specification 2017. P416 Language Specification. https:\/\/p4.org\/p4-spec\/docs\/P4-16-v1.0.0-spec.pdf.  P416 Language Specification 2017. P416 Language Specification. https:\/\/p4.org\/p4-spec\/docs\/P4-16-v1.0.0-spec.pdf."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2012.59"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/285237.285282"}],"event":{"name":"SOSR '19: Symposium on SDN Research","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication"],"location":"San Jose CA USA","acronym":"SOSR '19"},"container-title":["Proceedings of the 2019 ACM Symposium on SDN Research"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3314148.3314346","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3314148.3314346","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:54:24Z","timestamp":1750204464000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3314148.3314346"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4,3]]},"references-count":17,"alternative-id":["10.1145\/3314148.3314346","10.1145\/3314148"],"URL":"https:\/\/doi.org\/10.1145\/3314148.3314346","relation":{},"subject":[],"published":{"date-parts":[[2019,4,3]]},"assertion":[{"value":"2019-04-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}