{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,10]],"date-time":"2025-04-10T15:10:12Z","timestamp":1744297812944,"version":"3.37.3"},"reference-count":46,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE\/ACM Trans. Networking"],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1109\/tnet.2020.2984761","type":"journal-article","created":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T19:43:28Z","timestamp":1587411808000},"page":"1353-1363","source":"Crossref","is-referenced-by-count":6,"title":["On the Memory Requirement of Hop-by-Hop Routing: Tight Bounds and Optimal Address Spaces"],"prefix":"10.1109","volume":"28","author":[{"given":"Attila","family":"Korosi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2906-8319","authenticated-orcid":false,"given":"Andras","family":"Gulyas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6779-1711","authenticated-orcid":false,"given":"Zalan","family":"Heszberger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9729-2702","authenticated-orcid":false,"given":"Jozsef","family":"Biro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5958-7817","authenticated-orcid":false,"given":"Gabor","family":"Retvari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/1367064.1367077"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2005.857111"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/1412228.1455268"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/1367064.1367072"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/2000807.2000820"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2008.12.010"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/777412.777442"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/2.881693"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13509-5_24"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/1216370.1216372"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1273445.1273450"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/30.4.298"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/378580.378581"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/0167-739X(88)90009-X"},{"article-title":"GSE—An alternate addressing architecture for IPv6","year":"1997","author":"o\u2019dell","key":"ref13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.17487\/rfc1992"},{"article-title":"ISLAY: A new routing and addressing architecture","year":"2006","author":"kastenholz","key":"ref15"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2015.7218435"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2014.2345839"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2018.2853575"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/248052.248075"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.12.012"},{"key":"ref4","first-page":"1","article-title":"Routing tables: Is smaller really much better?","author":"fall","year":"2009","journal-title":"Proc ACM HotNets"},{"journal-title":"Statistical distributions of english text","year":"2016","key":"ref27"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2010.101013"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1145\/2534169.2486009","article-title":"Compressing IP forwarding tables: Towards entropy bounds and beyond","author":"r\u00e9tv\u00e1ri","year":"2013","journal-title":"Proc ACM Sigcomm"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/382780.382782"},{"journal-title":"The Internet Just Broke Under Its Own Weight–We Explain How","year":"2014","key":"ref5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/0376-5075(77)90002-2"},{"key":"ref7","first-page":"332","article-title":"Compressing IP forwarding tables: Realizing information-theoretical space bounds and fast lookups simultaneously","author":"k?r\u00f6si","year":"2014","journal-title":"Proc IEEE 22nd Int Conf Netw Protocols"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2010.101004"},{"article-title":"Adaptive routing algorithms for distributed computer networks","year":"1974","author":"mcquillan","key":"ref9"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.17487\/rfc4984"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548399003892"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.82.036106"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2008.76"},{"key":"ref22","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1038\/ncomms1063","article-title":"Sustaining the Internet with hyperbolic mapping","volume":"1","author":"bogu\u00f1\u00e1","year":"2010","journal-title":"Nature Commun"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2004.1354495"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.2000.1705"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/1613676.1613680"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48224-5_62"},{"key":"ref23","first-page":"1","article-title":"An information-theoretic approach to routing scalability","author":"r\u00e9tv\u00e1ri","year":"2014","journal-title":"Proc The 10th ACM Workshop on Hot Topics in Networks (Hotnets)"},{"journal-title":"The CAIDA AS Relationships Dataset","year":"2013","key":"ref44"},{"journal-title":"Introduction to Information Theory and Data Compression","year":"1998","author":"hankerson","key":"ref26"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.70.066111"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"}],"container-title":["IEEE\/ACM Transactions on Networking"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/90\/9119211\/09072270.pdf?arnumber=9072270","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:04:54Z","timestamp":1642003494000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9072270\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6]]},"references-count":46,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tnet.2020.2984761","relation":{},"ISSN":["1063-6692","1558-2566"],"issn-type":[{"type":"print","value":"1063-6692"},{"type":"electronic","value":"1558-2566"}],"subject":[],"published":{"date-parts":[[2020,6]]}}}