{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T06:34:31Z","timestamp":1770359671803,"version":"3.49.0"},"reference-count":46,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,4]]},"DOI":"10.1109\/infocom.2018.8485878","type":"proceedings-article","created":{"date-parts":[[2018,10,18]],"date-time":"2018-10-18T18:45:36Z","timestamp":1539888336000},"page":"2636-2644","source":"Crossref","is-referenced-by-count":15,"title":["Fast OpenFlow Table Lookup with Fast Update"],"prefix":"10.1109","author":[{"given":"Tong","family":"Yang","sequence":"first","affiliation":[]},{"given":"Alex X.","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Yulong","family":"Shen","sequence":"additional","affiliation":[]},{"given":"Qiaobin","family":"Fu","sequence":"additional","affiliation":[]},{"given":"Dagang","family":"Li","sequence":"additional","affiliation":[]},{"given":"Xiaoming","family":"Li","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2013.6567006"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2012.59"},{"key":"ref33","article-title":"Survey and taxonomy of IP address lookup algorithms","volume":"15","author":"miguel","year":"2001","journal-title":"Network IEEE"},{"key":"ref32","year":"0"},{"key":"ref31","doi-asserted-by":"crossref","first-page":"1083","DOI":"10.1109\/49.772439","article-title":"IP-address lookup using Ic-tries","volume":"17","author":"stefan","year":"1999","journal-title":"Selected Areas in Communications IEEE Journal on"},{"key":"ref30","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":"will","year":"2004","journal-title":"ACM SIGCOMM Computer Communication Review"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/2342356.2342428"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP.2007.4375857"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/1090191.1080115"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/65.912717"},{"key":"ref10","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 Computer Communication Review"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1996.0063"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/IWQoS.2012.6245978"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/316194.316216"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2010.267"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1155\/2017\/7538190"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2619239.2626294"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/316188.316217"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2017.2730227"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP.2011.6089061"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2008.05.018"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/40.820051"},{"key":"ref4","year":"0","journal-title":"Intel Ethernet Switch FM6000 Series"},{"key":"ref27","year":"0","journal-title":"Code of hypersplit"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2619239.2626297"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/964723.383075"},{"key":"ref29","first-page":"3","article-title":"Small forwarding tables for fast routing lookups","author":"mikael","year":"1997","journal-title":"Proc ACM Sigcomm"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/285243.285283"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1108956.1108958"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2486001.2486011"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.14778\/2876473.2876476"},{"key":"ref1","year":"0"},{"key":"ref46","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1145\/1150019.1136503","article-title":"Chisel: A storage-efficient, collision-free hash-based network processing architecture","volume":"34","author":"hasan","year":"2006","journal-title":"ACM SIGARCH Computer Architecture News"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2010.07.024"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP.2014.53"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2005.1498483"},{"key":"ref21","year":"0"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2003.810527"},{"key":"ref24","year":"0","journal-title":"Evaluation of Packet Classification Algorithms"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2003.1208658"},{"key":"ref23","year":"0","journal-title":"SAIL Webpage"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5061972"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/1851275.1851208"},{"key":"ref43","first-page":"269","article-title":"Scalable packet classification using distributed crossproducing of field labels","volume":"1","author":"taylor","year":"2005","journal-title":"Proc IEEE InfoCom"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/863955.863980"}],"event":{"name":"IEEE INFOCOM 2018 - IEEE Conference on Computer Communications","location":"Honolulu, HI","start":{"date-parts":[[2018,4,16]]},"end":{"date-parts":[[2018,4,19]]}},"container-title":["IEEE INFOCOM 2018 - IEEE Conference on Computer Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8464035\/8485803\/08485878.pdf?arnumber=8485878","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T04:24:40Z","timestamp":1598243080000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8485878\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4]]},"references-count":46,"URL":"https:\/\/doi.org\/10.1109\/infocom.2018.8485878","relation":{},"subject":[],"published":{"date-parts":[[2018,4]]}}}