{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,8]],"date-time":"2025-04-08T19:06:25Z","timestamp":1744139185713,"version":"3.28.0"},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,7]]},"DOI":"10.1109\/iscc.2017.8024651","type":"proceedings-article","created":{"date-parts":[[2017,9,4]],"date-time":"2017-09-04T16:26:54Z","timestamp":1504542414000},"page":"967-972","source":"Crossref","is-referenced-by-count":7,"title":["CRAFT: A Cache Reduction Architecture for Flow Tables in Software-Defined Networks"],"prefix":"10.1109","author":[{"family":"Xianfeng Li","sequence":"first","affiliation":[]},{"family":"Wencong Xie","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2013.6566832"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/2620728.2620732"},{"key":"ref12","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1145\/1851275.1851224","article-title":"Scalable flow-based networking with difane","volume":"40","author":"minlan","year":"2010","journal-title":"ACM SIGCOMM Computer Communication Review"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2005.1498483"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2015.2431684"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2012.04.011"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/863955.863980"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/2096149.2096152"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2413176.2413183"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1109\/ICNP.2003.1249762","article-title":"Packet classification using extended teams","author":"spitznagel","year":"2003","journal-title":"Network Protocols 2003 Proceedings 11th IEEE International Conference on"},{"key":"ref6","article-title":"Optimal rule caching and lossy compression for longest prefix matching","author":"rottenstreich","year":"2016","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2016.2530687"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP.2007.4375857"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2011.2165323"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2620728.2620734"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1355734.1355746"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2620728.2620753"}],"event":{"name":"2017 IEEE Symposium on Computers and Communications (ISCC)","start":{"date-parts":[[2017,7,3]]},"location":"Heraklion, Greece","end":{"date-parts":[[2017,7,6]]}},"container-title":["2017 IEEE Symposium on Computers and Communications (ISCC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8016448\/8024490\/08024651.pdf?arnumber=8024651","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,2]],"date-time":"2019-10-02T23:51:42Z","timestamp":1570060302000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8024651\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/iscc.2017.8024651","relation":{},"subject":[],"published":{"date-parts":[[2017,7]]}}}