{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T15:38:45Z","timestamp":1774539525813,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":61,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,8,27]],"date-time":"2013-08-27T00:00:00Z","timestamp":1377561600000},"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":[[2013,8,27]]},"DOI":"10.1145\/2486001.2486009","type":"proceedings-article","created":{"date-parts":[[2013,8,13]],"date-time":"2013-08-13T08:31:21Z","timestamp":1376382681000},"page":"111-122","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":33,"title":["Compressing IP forwarding tables"],"prefix":"10.1145","author":[{"given":"G\u00e1bor","family":"R\u00e9tv\u00e1ri","sequence":"first","affiliation":[{"name":"Budapest University of Technology and Economics, Budapest, Hungary"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00e1nos","family":"Tapolcai","sequence":"additional","affiliation":[{"name":"Budapest University of Technology and Economics, Budapest, Hungary"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Attila","family":"K\u0151r\u00f6si","sequence":"additional","affiliation":[{"name":"Budapest University of Technology and Economics, Budapest, Hungary"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e1s","family":"Majd\u00e1n","sequence":"additional","affiliation":[{"name":"Budapest University of Technology and Economics, Budapest, Hungary"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zal\u00e1n","family":"Heszberger","sequence":"additional","affiliation":[{"name":"Budapest University of Technology and Economics, Budapest, Hungary"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,8,27]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2012.2188643"},{"key":"e_1_3_2_1_2_1","first-page":"6","volume-title":"RFC 2544 performance evaluation and internal measurements for a Linux based open router","author":"Bolla R.","year":"2006","unstructured":"R. Bolla and R. Bruschi . RFC 2544 performance evaluation and internal measurements for a Linux based open router . In IEEE HPSR , page 6 , 2006 . R. Bolla and R. Bruschi. RFC 2544 performance evaluation and internal measurements for a Linux based open router. In IEEE HPSR, page 6, 2006."},{"key":"e_1_3_2_1_3_1","volume-title":"Sun Microsystems","author":"Bonwick J.","year":"2004","unstructured":"J. Bonwick and B. Moore . ZFS - the last word in file systems . Sun Microsystems , 2004 . J. Bonwick and B. Moore. ZFS - the last word in file systems. Sun Microsystems, 2004."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/136035.136043"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1999.752164"},{"key":"e_1_3_2_1_6_1","first-page":"846","volume-title":"INFOCOM Workshops","author":"Choi J.","year":"2011","unstructured":"J. Choi , J. H. Park , P. chun Cheng , D. Kim , and L. Zhang . Understanding BGP next-hop diversity . In INFOCOM Workshops , pages 846 -- 851 , 2011 . J. Choi, J. H. Park, P. chun Cheng, D. Kim, and L. Zhang. Understanding BGP next-hop diversity. In INFOCOM Workshops, pages 846 --851, 2011."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/390013.808480"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/129837"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/348751.348754"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/263105.263133"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/863955.863979"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1999.749256"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/997150.997160"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2011.2168610"},{"key":"e_1_3_2_1_15_1","unstructured":"EZChip. NP-4: 100-Gigabit Network Processor for Carrier Ethernet Applications. http:\/\/www.ezchip.com\/Images\/pdf\/NP-4_Short_Brief_online.pdf 2011.  EZChip. NP-4: 100-Gigabit Network Processor for Carrier Ethernet Applications. http:\/\/www.ezchip.com\/Images\/pdf\/NP-4_Short_Brief_online.pdf 2011."},{"key":"e_1_3_2_1_16_1","volume-title":"ACM HotNets-VIII","author":"Fall K.","year":"2009","unstructured":"K. Fall , G. Iannaccone , S. Ratnasamy , and P. B. Godfrey . Routing tables: Is smaller really much better ? In ACM HotNets-VIII , 2009 . K. Fall, G. Iannaccone, S. Ratnasamy, and P. B. Godfrey. Routing tables: Is smaller really much better? In ACM HotNets-VIII, 2009."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1613676.1613680"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/795666.796543"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1240233.1240243"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1070873.1070877"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2000.832490"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1851182.1851207"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1080091.1080116"},{"key":"e_1_3_2_1_24_1","unstructured":"P. Hick kc claffy and D. Andersen. CAIDA Anonymized Internet Traces. http:\/\/www.caida.org\/data\/passive.  P. Hick kc claffy and D. Andersen. CAIDA Anonymized Internet Traces. http:\/\/www.caida.org\/data\/passive."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/1875737.1875761"},{"key":"e_1_3_2_1_26_1","unstructured":"G. Huston. BGP routing table analysis reports. http:\/\/bgp.potaroo.net\/.  G. Huston. BGP routing table analysis reports. http:\/\/bgp.potaroo.net\/."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2004.12.002"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1989.63533"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054190000291"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2010.101013"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2427036.2427039"},{"key":"e_1_3_2_1_32_1","unstructured":"LuceneTransform. Transparent compression for Apache Lucene. http:\/\/code.google.com\/p\/lucenetransform.  LuceneTransform. Transparent compression for Apache Lucene. http:\/\/code.google.com\/p\/lucenetransform."},{"key":"e_1_3_2_1_33_1","first-page":"137","volume-title":"USENIX","author":"Madhyastha H.","year":"2009","unstructured":"H. Madhyastha , E. Katz-Bassett , T. Anderson , A. Krishnamurthy , and A. Venkataramani . iPlane Nano: path prediction for peer-to-peer applications . In USENIX , pages 137 -- 152 , 2009 . H. Madhyastha, E. Katz-Bassett, T. Anderson, A. Krishnamurthy, and A. Venkataramani. iPlane Nano: path prediction for peer-to-peer applications. In USENIX, pages 137--152, 2009."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1367064.1367072"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1993.253403"},{"key":"e_1_3_2_1_36_1","first-page":"4984","article-title":"Report from the IAB Workshop on Routing and Addressing","author":"Meyer D.","year":"2007","unstructured":"D. Meyer , L. Zhang , and K. Fall . Report from the IAB Workshop on Routing and Addressing . RFC 4984 , 2007 . D. Meyer, L. Zhang, and K. Fall. Report from the IAB Workshop on Routing and Addressing. RFC 4984, 2007.","journal-title":"RFC"},{"key":"e_1_3_2_1_37_1","unstructured":"D. S. Miller. net\\_test\\_tools. https:\/\/kernel.googlesource.com\/pub\/scm\/linux\/kernel\/git\/davem\/net_test_tools.  D. S. Miller. net\\_test\\_tools. https:\/\/kernel.googlesource.com\/pub\/scm\/linux\/kernel\/git\/davem\/net_test_tools."},{"key":"e_1_3_2_1_38_1","volume-title":"libcds: Compact data structures library","author":"Navarro G.","year":"2004","unstructured":"G. Navarro and F. Claude . libcds: Compact data structures library , 2004 . http:\/\/libcds.recoded.cl. G. Navarro and F. Claude. libcds: Compact data structures library, 2004. http:\/\/libcds.recoded.cl."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1216370.1216372"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.v35:12"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/49.772439"},{"key":"e_1_3_2_1_42_1","first-page":"233","volume-title":"ACM-SIAM SODA","author":"Raman R.","year":"2002","unstructured":"R. Raman , V. Raman , and S. S. Rao . Succinct indexable dictionaries with applications to encoding k-ary trees and multisets . In ACM-SIAM SODA , pages 233 -- 242 , 2002 . R. Raman, V. Raman, and S. S. Rao. Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. In ACM-SIAM SODA, pages 233--242, 2002."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2390231.2390232"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/2945.764870"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP.2009.5339697"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP.2005.36"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/277858.277863"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISSOC.2008.4694879"},{"key":"e_1_3_2_1_50_1","first-page":"553","volume-title":"IEEE CSB","author":"Sun H.","unstructured":"H. Sun , O. Ozturk , and H. Ferhatosmanoglu . CoMRI: a compressed multi-resolution index structure for sequence similarity queries . In IEEE CSB , pages 553 --, 2003. H. Sun, O. Ozturk, and H. Ferhatosmanoglu. CoMRI: a compressed multi-resolution index structure for sequence similarity queries. In IEEE CSB, pages 553--, 2003."},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/948205.948247"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.5555\/876875.879020"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/2079296.2079325"},{"key":"e_1_3_2_1_54_1","unstructured":"S. Vigna and P. Boldi. MG4J: Managing Gigabytes for Java. http:\/\/mg4j.dsi.unimi.it 2007.  S. Vigna and P. Boldi. MG4J: Managing Gigabytes for Java. http:\/\/mg4j.dsi.unimi.it 2007."},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/263105.263136"},{"key":"e_1_3_2_1_56_1","unstructured":"WebGraph. A framework for graph compression. http:\/\/webgraph.di.unimi.it.  WebGraph. A framework for graph compression. http:\/\/webgraph.di.unimi.it."},{"key":"e_1_3_2_1_57_1","volume-title":"Morgan Kaufmann","author":"Witten I. H.","year":"1999","unstructured":"I. H. Witten , A. Moffat , and T. C. Bell . Managing Gigabytes: Compressing and Indexing Documents and Images . Morgan Kaufmann , 1999 . I. H. Witten, A. Moffat, and T. C. Bell. Managing Gigabytes: Compressing and Indexing Documents and Images. Morgan Kaufmann, 1999."},{"key":"e_1_3_2_1_58_1","volume-title":"PPP Deflate Protocol. RFC 1979","author":"Woods J.","year":"1996","unstructured":"J. Woods . PPP Deflate Protocol. RFC 1979 , 1996 . J. Woods. PPP Deflate Protocol. RFC 1979, 1996."},{"key":"e_1_3_2_1_59_1","volume-title":"Packet Forwarding Technologies. Auerbach","author":"Wu W.","year":"2008","unstructured":"W. Wu . Packet Forwarding Technologies. Auerbach , 2008 . W. Wu. Packet Forwarding Technologies. Auerbach, 2008."},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1145\/2378956.2378961"},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2010.101004"},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1109\/2.881693"}],"event":{"name":"SIGCOMM'13: ACM SIGCOMM 2013 Conference","location":"Hong Kong China","acronym":"SIGCOMM'13","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication"]},"container-title":["Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2486001.2486009","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2486001.2486009","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:48:40Z","timestamp":1750222120000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2486001.2486009"}},"subtitle":["towards entropy bounds and beyond"],"short-title":[],"issued":{"date-parts":[[2013,8,27]]},"references-count":61,"alternative-id":["10.1145\/2486001.2486009","10.1145\/2486001"],"URL":"https:\/\/doi.org\/10.1145\/2486001.2486009","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2534169.2486009","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2013,8,27]]},"assertion":[{"value":"2013-08-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}