{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T18:12:04Z","timestamp":1775326324227,"version":"3.50.1"},"reference-count":66,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computer Networks"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1016\/j.comnet.2019.106898","type":"journal-article","created":{"date-parts":[[2019,9,9]],"date-time":"2019-09-09T11:25:39Z","timestamp":1568028339000},"page":"106898","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":11,"special_numbering":"C","title":["A power-saving pre-classifier for TCAM-based IP lookup"],"prefix":"10.1016","volume":"164","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9234-0763","authenticated-orcid":false,"given":"Wenjun","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8134-0538","authenticated-orcid":false,"given":"Dagang","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xinwei","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ting","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xianfeng","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenxia","family":"Le","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hui","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.comnet.2019.106898_bib0001","series-title":"Proceedings of the IEEE INFOCOM","article-title":"Space-efficient TCAM-based classification using gray coding","author":"Bremler-Barr","year":"2007"},{"key":"10.1016\/j.comnet.2019.106898_bib0003","series-title":"Proceedings of the IEEE INFOCOM","article-title":"Fast routing table lookup using CAMs","author":"McAuley","year":"1993"},{"issue":"4","key":"10.1016\/j.comnet.2019.106898_bib0004","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1109\/TPDS.2008.216","article-title":"Complete redundancy removal for packet classifiers in TCAMs","volume":"20","author":"Liu","year":"2010","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"10.1016\/j.comnet.2019.106898_bib0005","series-title":"Proceedings of the IEEE INFOCOM","article-title":"Packet classification using binary content addressable memory","author":"Liu","year":"2014"},{"issue":"2","key":"10.1016\/j.comnet.2019.106898_bib0006","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1109\/TNET.2009.2030188","article-title":"TCAM Razor: A systematic approach towards minimizing packet classifiers in TCAMs","volume":"18","author":"Liu","year":"2010","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"10.1016\/j.comnet.2019.106898_bib0007","series-title":"Proceedings of the IEEE INFOCOM","article-title":"All-match based complete redundancy removal for packet classifiers in TCAMs","author":"Liu","year":"2008"},{"issue":"3","key":"10.1016\/j.comnet.2019.106898_bib0008","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1109\/90.779199","article-title":"IP lookups using multiway and multicolumn search","volume":"7","author":"Lampson","year":"1999","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"1-3","key":"10.1016\/j.comnet.2019.106898_bib0009","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1016\/j.dam.2004.08.009","article-title":"Computing the minimum DNF representation of Boolean functions defined by intervals","volume":"149","author":"Schieber","year":"2005","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/j.comnet.2019.106898_bib0010","series-title":"Proceedings of the ACM CoNEXT","article-title":"TreeCAM: decoupling updates and lookups in packet classification","author":"Vamanan","year":"2011"},{"key":"10.1016\/j.comnet.2019.106898_bib0011","series-title":"Hardware Based Packet Classification for High Speed Internet Routers","author":"Meiners","year":"2010"},{"key":"10.1016\/j.comnet.2019.106898_bib0012","series-title":"Proceedings of the ACM SIGCOMM","article-title":"Longest prefix matching using bloom filters","author":"Sarang","year":"2003"},{"key":"10.1016\/j.comnet.2019.106898_bib0013","series-title":"Proceedings of the IEEE Hot Interconnects","article-title":"Fast incremental updates on Ternary-CAMs for routing lookups and packet classification","author":"Shah","year":"2000"},{"key":"10.1016\/j.comnet.2019.106898_bib0014","series-title":"Proceedings of the IEEE INFOCOM","article-title":"CoolCAMs: power-efficient TCAMs for forwarding engines","author":"Zane","year":"2003"},{"key":"10.1016\/j.comnet.2019.106898_bib0015","series-title":"Proceedings of the ACM SIGCOMM","article-title":"Poptrie: a compressed trie with population count for fast and scalable software IP routing table lookup","author":"Asai","year":"2015"},{"issue":"7","key":"10.1016\/j.comnet.2019.106898_bib0016","doi-asserted-by":"crossref","first-page":"902","DOI":"10.1109\/TC.2007.70838","article-title":"DRES: dynamic range encoding scheme for TCAM coprocessors","volume":"57","author":"Che","year":"2008","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/j.comnet.2019.106898_bib0017","series-title":"High Performance Switches and Routers","author":"Chao","year":"2007"},{"issue":"2","key":"10.1016\/j.comnet.2019.106898_bib0018","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1109\/TC.2012.193","article-title":"On adding bloom filters to longest prefix matching algorithms","volume":"63","author":"Lim","year":"2014","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/j.comnet.2019.106898_bib0019","series-title":"Proceedings of the IEEE Hot Interconnects","article-title":"Efficient mapping of range classifier into ternary-CAM","author":"Liu","year":"2002"},{"key":"10.1016\/j.comnet.2019.106898_bib0021","unstructured":"http:\/\/www.wenjunli.com\/SplitCoding."},{"key":"10.1016\/j.comnet.2019.106898_bib0022","series-title":"Proceedings of the IEEE INFOCOM Mini-Conference","article-title":"Offset addressing approach to memory-efficient IP address Lookup","author":"Huang","year":"2011"},{"key":"10.1016\/j.comnet.2019.106898_bib0023","series-title":"Proceedings of the ACM SIGCOMM","article-title":"Algorithms for advanced packet classification with ternary CAMs","author":"Lakshminarayanan","year":"2005"},{"issue":"4","key":"10.1016\/j.comnet.2019.106898_bib0024","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":"IEEE\/ACM Trans. Netw."},{"key":"10.1016\/j.comnet.2019.106898_bib0025","series-title":"Proceedings of the IEEE INFOCOM","article-title":"An ultra high throughput and power efficient TCAM-based IP lookup engine","author":"Zheng","year":"2004"},{"key":"10.1016\/j.comnet.2019.106898_bib0026","series-title":"Proceedings of the ACM CoNEXT","article-title":"Longest prefix matching using bloom filters","author":"Luo","year":"2012"},{"issue":"3","key":"10.1016\/j.comnet.2019.106898_bib0027","doi-asserted-by":"crossref","first-page":"957","DOI":"10.1109\/TNET.2013.2266665","article-title":"A Hybrid Hardware Architecture for High-speed IP Lookups and Fast Route Updates","volume":"22","author":"Luo","year":"2014","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"10.1016\/j.comnet.2019.106898_bib0028","series-title":"Proceedings of the IEEE INFOCOM","article-title":"A hybrid IP lookup architecture with fast updates","author":"Luo","year":"2012"},{"issue":"4","key":"10.1016\/j.comnet.2019.106898_bib0029","doi-asserted-by":"crossref","first-page":"1262","DOI":"10.1109\/TNET.2012.2188643","article-title":"FlashTrie: beyond 100-Gb\/s IP route lookup using hash-based prefix-compressed trie","volume":"20","author":"Bando","year":"2012","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"10.1016\/j.comnet.2019.106898_bib0030","series-title":"Proceedings of the ACM SIGCOMM","article-title":"Small forwarding tables for fast routing lookups","author":"Degermark","year":"1997"},{"key":"10.1016\/j.comnet.2019.106898_bib0031","series-title":"Proceedings of the ACM SIGCOMM","article-title":"Scalable high speed IP routing lookups","author":"Waldvogel","year":"1997"},{"key":"10.1016\/j.comnet.2019.106898_bib0032","unstructured":"Micron Technology Inc, Harmony TCAM 1Mb and 2Mb, Datasheet, 2003."},{"key":"10.1016\/j.comnet.2019.106898_bib0033","series-title":"Proceedings of the IEEE ISIT","article-title":"On the code length of TCAM coding schemes","author":"Rottenstreich","year":"2010"},{"key":"10.1016\/j.comnet.2019.106898_bib0034","series-title":"Proceedings of the IEEE INFOCOM Mini-Conference","article-title":"Worst-case TCAM rule expansion","author":"Rottenstreich","year":"2010"},{"key":"10.1016\/j.comnet.2019.106898_bib0035","series-title":"Proceedings of the IEEE INFOCOM","article-title":"On finding an optimal TCAM encoding scheme for packet classification","author":"Rottenstreich","year":"2013"},{"issue":"1","key":"10.1016\/j.comnet.2019.106898_bib0036","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1109\/TNET.2014.2382031","article-title":"Optimal In\/Out TCAM encodings of ranges","volume":"24","author":"Rottenstreich","year":"2016","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"6","key":"10.1016\/j.comnet.2019.106898_bib0037","doi-asserted-by":"crossref","first-page":"1127","DOI":"10.1109\/TC.2012.59","article-title":"Exact worst-case TCAM rule expansion","volume":"62","author":"Rottenstreich","year":"2013","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/j.comnet.2019.106898_bib0038","series-title":"Proceedings of the IEEE INFOCOM","article-title":"Routing lookups in hardware at memory access speeds","author":"Gupta","year":"1998"},{"issue":"1","key":"10.1016\/j.comnet.2019.106898_bib0039","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1109\/TNET.2017.2776565","article-title":"Partial order theory for fast TCAM updates","volume":"26","author":"He","year":"2018","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"10.1016\/j.comnet.2019.106898_bib0040","series-title":"Proceedings of the IEEE Hot Interconnects","article-title":"Reducing TCAM power consumption and increasing throughput","author":"Rina","year":"2002"},{"issue":"2","key":"10.1016\/j.comnet.2019.106898_bib0041","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1109\/65.912716","article-title":"Survey and taxonomy of IP address lookup algorithms","volume":"15","author":"Miguel","year":"2001","journal-title":"IEEE Netw."},{"key":"10.1016\/j.comnet.2019.106898_bib0042","unstructured":"RIPEnetwork coordination centre [on line]. Available: http:\/\/www.ripe.net."},{"key":"10.1016\/j.comnet.2019.106898_bib0043","series-title":"Proceedings of the ACM SIGCOMM","article-title":"PacketShader: a GPU-accelerated software router","author":"Han","year":"2010"},{"issue":"6","key":"10.1016\/j.comnet.2019.106898_bib0044","doi-asserted-by":"crossref","first-page":"1083","DOI":"10.1109\/49.772439","article-title":"IP-address lookup using LC-tries","volume":"17","author":"Nilsson","year":"1999","journal-title":"IEEE J. Sel. Areas Commun."},{"issue":"4","key":"10.1016\/j.comnet.2019.106898_bib0046","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/s00453-002-1000-7","article-title":"Compressing two-dimensional routing tables","volume":"35","author":"Suri","year":"2003","journal-title":"Algorithmica"},{"key":"10.1016\/j.comnet.2019.106898_bib0047","series-title":"Proceedings of the IEEE INFOCOM","article-title":"Fast openflow table Lookup with fast update","author":"Yang","year":"2018"},{"key":"10.1016\/j.comnet.2019.106898_bib0048","series-title":"Proceedings of the IEEE\/ACM IWQoS","article-title":"Approaching optimal compression with fast update for large scale routing tables","author":"Yang","year":"2012"},{"issue":"4","key":"10.1016\/j.comnet.2019.106898_bib0049","doi-asserted-by":"crossref","first-page":"1821","DOI":"10.1109\/TNET.2018.2853575","article-title":"Constant IP lookup with FIB explosion","volume":"26","author":"Yang","year":"2018","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"10.1016\/j.comnet.2019.106898_bib0050","series-title":"Proceedings of the ACM SIGCOMM","article-title":"Guarantee IP lookup performance with FIB explosion","author":"Yang","year":"2014"},{"key":"10.1016\/j.comnet.2019.106898_bib0051","series-title":"Proceedings of the IEEE ICDCS","article-title":"CLUE: achieving fast update over compressed table for parallel lookup with reduced dynamic redundancy","author":"Yang","year":"2012"},{"key":"10.1016\/j.comnet.2019.106898_bib0052","series-title":"Proceedings of the IEEE ICC","article-title":"Constructing optimal non-overlap routing tables","author":"Yang","year":"2012"},{"key":"10.1016\/j.comnet.2019.106898_bib0053","series-title":"Proceedings of the IEEE ICNP","article-title":"An ultra-fast universal incremental update algorithm for Trie-based routing lookup","author":"Yang","year":"2012"},{"key":"10.1016\/j.comnet.2019.106898_bib0054","unstructured":"University of Oregon route views project [on line]. Available: http:\/\/www.routeviews.org."},{"issue":"1","key":"10.1016\/j.comnet.2019.106898_bib0055","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/277858.277863","article-title":"Faster IP lookups using controlled prefix expansion","volume":"26","author":"Srinivasan","year":"1998","journal-title":"ACM SIGMETRICS Perform. Eval. Rev."},{"key":"10.1016\/j.comnet.2019.106898_bib0056","series-title":"Proceedings of the ACM SIGCOMM","article-title":"Fast and Scalable Layer Four Switching","author":"Srinivasan","year":"1998"},{"issue":"2","key":"10.1016\/j.comnet.2019.106898_bib0057","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1145\/997150.997160","article-title":"Tree bitmap: Hardware\/software IP lookups with incremental updates","volume":"34","author":"Eatherton","year":"2004","journal-title":"ACM SIGCOMM Comput. Commun. Rev."},{"key":"10.1016\/j.comnet.2019.106898_bib0058","series-title":"Proceedings of the IEEE Hot Interconnects","article-title":"HybridCuts: a scheme combining decomposition and cutting for packet classification","author":"Li","year":"2013"},{"key":"10.1016\/j.comnet.2019.106898_bib0059","series-title":"Proceedings of the International Conference on Computer Communications and Networks (ICCCN)","article-title":"MEET-IP: memory and energy efficient TCAM-based IP lookup","author":"Li","year":"2017"},{"key":"10.1016\/j.comnet.2019.106898_bib0060","series-title":"Proceedings of the IEEE INFOCOM","article-title":"CutSplit: a decision-tree combining cutting and splitting for scalable packet classification","author":"Li","year":"2018"},{"key":"10.1016\/j.comnet.2019.106898_bib0061","series-title":"Proceedings of the ACM SIGCOMM Posters and Demos","article-title":"A practical range encoding scheme for TCAMs","author":"Li","year":"2019"},{"key":"10.1016\/j.comnet.2019.106898_bib0062","series-title":"Proceedings of the International Conference on Computing, Networking and Communications (ICNC)","article-title":"GreenTCAM: a memory- and energy-efficient TCAM-based packet classification","author":"Li","year":"2016"},{"issue":"12","key":"10.1016\/j.comnet.2019.106898_bib0063","doi-asserted-by":"crossref","first-page":"1614","DOI":"10.1109\/TC.2006.189","article-title":"A 2-level TCAM architecture for ranges","volume":"55","author":"Chang","year":"2006","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/j.comnet.2019.106898_bib0064","series-title":"Proceedings of the International Conference on Information Networking (ICOIN)","article-title":"Power-efficient TCAM partitioning for IP lookups with incremental updates","author":"Chang","year":"2005"},{"key":"10.1016\/j.comnet.2019.106898_bib0065","series-title":"Proceedings of the IEEE INFOCOM","article-title":"Multi-field range encoding for packet classification in TCAM","author":"Chang","year":"2011"},{"issue":"4","key":"10.1016\/j.comnet.2019.106898_bib0066","doi-asserted-by":"crossref","first-page":"1201","DOI":"10.1109\/TNET.2012.2220566","article-title":"Efficient gray-code-based range encoding schemes for packet classification in TCAM","volume":"21","author":"Chang","year":"2013","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"10.1016\/j.comnet.2019.106898_bib0067","series-title":"Proceedings of the ACM\/IEEE ANCS","article-title":"GAMT: a fast and scalable IP lookup engine for GPU-based software routers","author":"Li","year":"2013"},{"key":"10.1016\/j.comnet.2019.106898_bib0068","series-title":"Proceedings of the ACM SIGCOMM","article-title":"A smart pre-classifier to reduce power consumption of TCAMs for multi-dimensional packet classification","author":"Ma","year":"2012"},{"issue":"5","key":"10.1016\/j.comnet.2019.106898_bib0069","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1145\/2378956.2378961","article-title":"DXR: towards a billion routing lookups per second in software","volume":"42","author":"Marko","year":"2012","journal-title":"ACM SIGCOMM Comput. Commun. Rev."}],"container-title":["Computer Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1389128618311927?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1389128618311927?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T13:03:51Z","timestamp":1761397431000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1389128618311927"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12]]},"references-count":66,"alternative-id":["S1389128618311927"],"URL":"https:\/\/doi.org\/10.1016\/j.comnet.2019.106898","relation":{},"ISSN":["1389-1286"],"issn-type":[{"value":"1389-1286","type":"print"}],"subject":[],"published":{"date-parts":[[2019,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A power-saving pre-classifier for TCAM-based IP lookup","name":"articletitle","label":"Article Title"},{"value":"Computer Networks","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.comnet.2019.106898","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2019 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}],"article-number":"106898"}}