{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:15:33Z","timestamp":1750306533235,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,10,27]],"date-time":"2014-10-27T00:00:00Z","timestamp":1414368000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100003549","name":"Orsz\u00e1gos Tudom\u00e1nyos Kutat\u00e1si Alapprogramok","doi-asserted-by":"publisher","award":["PD-104939"],"award-info":[{"award-number":["PD-104939"]}],"id":[{"id":"10.13039\/501100003549","id-type":"DOI","asserted-by":"publisher"}]},{"name":"TAMOP","award":["421B-09\/1\/KMR-2010-0002"],"award-info":[{"award-number":["421B-09\/1\/KMR-2010-0002"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,10,27]]},"DOI":"10.1145\/2670518.2673863","type":"proceedings-article","created":{"date-parts":[[2014,11,11]],"date-time":"2014-11-11T13:40:05Z","timestamp":1415713205000},"page":"1-7","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["An Information-Theoretic Approach to Routing Scalability"],"prefix":"10.1145","author":[{"given":"G\u00e1bor","family":"R\u00e9tv\u00e1ri","sequence":"first","affiliation":[{"name":"Department of Telecommunications and Media Informatics, Budapest University of Technology and Economics"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D\u00e1vid","family":"Szab\u00f3","sequence":"additional","affiliation":[{"name":"Department of Telecommunications and Media Informatics, Budapest University of Technology and Economics"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e1s","family":"Guly\u00e1s","sequence":"additional","affiliation":[{"name":"Department of Telecommunications and Media Informatics, Budapest University of Technology and Economics"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Attila","family":"K\u0151r\u00f6si","sequence":"additional","affiliation":[{"name":"Department of Telecommunications and Media Informatics, Budapest University of Technology and Economics"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00e1nos","family":"Tapolcai","sequence":"additional","affiliation":[{"name":"Department of Telecommunications and Media Informatics, Budapest University of Technology and Economics"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,10,27]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2567561.2567563"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2390231.2390238"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2010.101004"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2010.101013"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1273445.1273450"},{"key":"e_1_3_2_1_6_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_7_1","volume-title":"ACM HotNets-VIII","author":"Fall Kevin","year":"2009","unstructured":"Kevin Fall , Gianluca Iannaccone , Sylvia Ratnasamy , and P. Brighten Godfrey . Routing tables: Is smaller really much better ? In ACM HotNets-VIII , 2009 . Kevin Fall, Gianluca Iannaccone, Sylvia Ratnasamy, and P. Brighten Godfrey. Routing tables: Is smaller really much better? In ACM HotNets-VIII, 2009."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993806.1993828"},{"key":"e_1_3_2_1_9_1","first-page":"233","volume-title":"ACM-SIAM SODA","author":"Raman Rajeev","year":"2002","unstructured":"Rajeev Raman , Venkatesh Raman , and S. Srinivasa Rao . Succinct indexable dictionaries with applications to encoding k-ary trees and multisets . In ACM-SIAM SODA , pages 233 -- 242 , 2002 . Rajeev Raman, Venkatesh Raman, and S. Srinivasa 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_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486001.2486009"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2008.12.010"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548399003892"},{"key":"e_1_3_2_1_13_1","unstructured":"The CAIDA AS relationships dataset (2013-08-01). http:\/\/www.caida.org\/data\/active\/as-relationships.  The CAIDA AS relationships dataset (2013-08-01). http:\/\/www.caida.org\/data\/active\/as-relationships."},{"key":"e_1_3_2_1_14_1","unstructured":"Routeviews prefix to as mappings dataset for IPv4 and IPv6 (2014-05-01). http:\/\/data.caida.org\/datasets\/routing\/routeviews-prefix2as.  Routeviews prefix to as mappings dataset for IPv4 and IPv6 (2014-05-01). http:\/\/data.caida.org\/datasets\/routing\/routeviews-prefix2as."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2342356.2342393"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2567561.2567566"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1038\/ncomms1063"},{"key":"e_1_3_2_1_18_1","volume-title":"BGP","author":"Huston G.","year":"2013","unstructured":"G. Huston . BGP in 2013 . http:\/\/www.potaroo.net\/ispcol\/2014-01\/bgp2013.html. G. Huston. BGP in 2013. http:\/\/www.potaroo.net\/ispcol\/2014-01\/bgp2013.html."},{"key":"e_1_3_2_1_19_1","volume-title":"November","author":"Intel Corporation","year":"2012","unstructured":"Intel Corporation . Intel data plane development kit: Programmers guide , November 2012 . Intel Corporation. Intel data plane development kit: Programmers guide, November 2012."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/633025.633059"}],"event":{"name":"HotNets-XIII: The 13th ACM Workshop on Hot Topics in Networks","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication","CISCO"],"location":"Los Angeles CA USA","acronym":"HotNets-XIII"},"container-title":["Proceedings of the 13th ACM Workshop on Hot Topics in Networks"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2670518.2673863","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2670518.2673863","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:12:17Z","timestamp":1750227137000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2670518.2673863"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10,27]]},"references-count":20,"alternative-id":["10.1145\/2670518.2673863","10.1145\/2670518"],"URL":"https:\/\/doi.org\/10.1145\/2670518.2673863","relation":{},"subject":[],"published":{"date-parts":[[2014,10,27]]},"assertion":[{"value":"2014-10-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}