{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T16:05:12Z","timestamp":1761581112467,"version":"3.28.0"},"reference-count":19,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,4]]},"DOI":"10.1109\/infcom.2013.6566915","type":"proceedings-article","created":{"date-parts":[[2013,8,1]],"date-time":"2013-08-01T16:12:57Z","timestamp":1375373577000},"page":"1231-1239","source":"Crossref","is-referenced-by-count":20,"title":["Compressing forwarding tables"],"prefix":"10.1109","author":[{"given":"Ori","family":"Rottenstreich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marat","family":"Radan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuval","family":"Cassuto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Isaac","family":"Keslassy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carmi","family":"Arad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tal","family":"Mizrahi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoram","family":"Revah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Avinatan","family":"Hassidim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","volume":"13","author":"nesterov","year":"1987","journal-title":"Interior-Point Polynomial Algorithms in Convex Programming"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2011.12.010"},{"key":"18","article-title":"Compressing forwarding tables","author":"rottenstreich","year":"2012","journal-title":"Technion Tech Rep TR12-03"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5062178"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2010.2047868"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453925"},{"key":"14","article-title":"Bringing BLINK closer to the full power of SQL","author":"stolze","year":"2009","journal-title":"BTW"},{"key":"11","article-title":"FIB suppression with virtual aggregation","author":"francis","year":"2011","journal-title":"IETF Draftietf-grow-va Work in Progress"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1016\/B978-012722442-8\/50087-2"},{"key":"3","article-title":"Problem statement for ARMD","author":"narten","year":"2012","journal-title":"IETF Draft-ietf-armd-problem-statement Work in Progress"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1145\/1592568.1592575"},{"key":"1","first-page":"2011","article-title":"Datacenter scalability panel","volume":"52","author":"gashinsky","year":"0","journal-title":"NANOG"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5935172"},{"key":"7","article-title":"On the scalability of internet routing","author":"narten","year":"2010","journal-title":"IETF Draft-nartenradir-problem-statement Work in Progress"},{"journal-title":"Elements of Information Theory","year":"2006","author":"cover","key":"6"},{"key":"5","article-title":"Report from the IAB workshop on routing and addressing","volume":"4984","author":"meyer","year":"2007","journal-title":"IETF RFC"},{"key":"4","first-page":"2011","article-title":"Pushing the limits, a perspective on router architecture challenges","volume":"53","author":"hankins","year":"0","journal-title":"NANOG"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1999.749256"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2010.5462137"}],"event":{"name":"IEEE INFOCOM 2013 - IEEE Conference on Computer Communications","start":{"date-parts":[[2013,4,14]]},"location":"Turin, Italy","end":{"date-parts":[[2013,4,19]]}},"container-title":["2013 Proceedings IEEE INFOCOM"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6556116\/6566708\/06566915.pdf?arnumber=6566915","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,22]],"date-time":"2017-03-22T17:23:14Z","timestamp":1490203394000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6566915\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/infcom.2013.6566915","relation":{},"subject":[],"published":{"date-parts":[[2013,4]]}}}