{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,23]],"date-time":"2025-12-23T10:01:39Z","timestamp":1766484099461,"version":"3.41.0"},"reference-count":34,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2017,9,6]],"date-time":"2017-09-06T00:00:00Z","timestamp":1504656000000},"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":["SIGCOMM Comput. Commun. Rev."],"published-print":{"date-parts":[[2017,9,6]]},"abstract":"<jats:p>The key requirement to routing in any telecommunication network, and especially in Internet-of-Things (IoT) networks, is scalability. Routing must route packets between any source and destination in the network without incurring unmanageable routing overhead that grows quickly with increasing network size and dynamics. Here we present an addressing scheme and a coupled network topology design scheme that guarantee essentially optimal routing scalability. The FIB sizes are as small as they can be, equal to the number of adjacencies a node has, while the routing control overhead is minimized as nearly zero routing control messages are exchanged even upon catastrophic failures in the network. The key new ingredient is the addressing scheme, which is purely local, based only on geographic coordinates of nodes and a centrality measure, and does not require any sophisticated non-local computations or global network topology knowledge for network embedding. The price paid for these benefits is that network topology cannot be arbitrary but should follow a specific design, resulting in Internet-like topologies. The proposed schemes can be most easily deployed in overlay networks, and also in other network deployments, where geolocation information is available, and where network topology can grow following the design specifications.<\/jats:p>","DOI":"10.1145\/3138808.3138811","type":"journal-article","created":{"date-parts":[[2017,9,7]],"date-time":"2017-09-07T13:02:09Z","timestamp":1504789329000},"page":"11-18","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":32,"title":["Geohyperbolic Routing and Addressing Schemes"],"prefix":"10.1145","volume":"47","author":[{"given":"Ivan","family":"Voitalov","sequence":"first","affiliation":[{"name":"Northeastern University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rodrigo","family":"Aldecoa","sequence":"additional","affiliation":[{"name":"Northeastern University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lan","family":"Wang","sequence":"additional","affiliation":[{"name":"University of Memphis"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dmitri","family":"Krioukov","sequence":"additional","affiliation":[{"name":"Northeastern University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,9,6]]},"reference":[{"key":"e_1_2_1_1_2","unstructured":"Center for International Earth Science Information Network Gridded Population of the World Version 4. Accessed: 2016\/06\/20. URL: Center for International Earth Science Information Network Gridded Population of the World Version 4 . Accessed: 2016\/06\/20. URL:"},{"key":"e_1_2_1_2_2","unstructured":"Code and data. URL: https:\/\/bitbucket.org\/dk-lab\/2017_code_ccr_geohyperbolic\/. Code and data . URL: https:\/\/bitbucket.org\/dk-lab\/2017_code_ccr_geohyperbolic\/."},{"key":"e_1_2_1_3_2","unstructured":"GeoNames. Accessed: 2016\/06\/20. URL: http:\/\/www.geonames.org\/. GeoNames . Accessed: 2016\/06\/20. URL: http:\/\/www.geonames.org\/."},{"key":"e_1_2_1_4_2","unstructured":"Natural Earth. Accessed: 2016\/06\/20. URL: http:\/\/www.naturalearthdata.com\/. Natural Earth . Accessed: 2016\/06\/20. URL: http:\/\/www.naturalearthdata.com\/."},{"key":"e_1_2_1_5_2","unstructured":"NDN Testbed. URL: https:\/\/named-data.net\/ndn-testbed\/. NDN Testbed . URL: https:\/\/named-data.net\/ndn-testbed\/."},{"volume-title":"CSSS","year":"2013","author":"Abundo C.","key":"e_1_2_1_6_2"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.bjp.2013.12.037"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1364\/JOCN.6.001038"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1038\/nphys1130"},{"key":"e_1_2_1_10_2","first-page":"62","volume":"1","author":"Bogu\u00f1\u00e1 M.","year":"2010","journal-title":"Sustaining the Internet with Hyperbolic Mapping. Nat. Com."},{"key":"e_1_2_1_11_2","unstructured":"K. Bringmann R. Keusch and J. Lengler. Sampling Geometric Inhomogeneous Random Graphs in Linear Time. 2015. http:\/\/arxiv.org\/abs\/1511.00576 arXiv:1511.00576.  K. Bringmann R. Keusch and J. Lengler. Sampling Geometric Inhomogeneous Random Graphs in Linear Time. 2015. http:\/\/arxiv.org\/abs\/1511.00576 arXiv:1511.00576."},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1145\/3087801.3087829"},{"key":"e_1_2_1_13_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISCC.2011.5983793"},{"key":"e_1_2_1_14_2","doi-asserted-by":"publisher","DOI":"10.1145\/956993.956995"},{"key":"e_1_2_1_15_2","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5062083"},{"key":"e_1_2_1_16_2","first-page":"18","volume-title":"IMECS","volume":"1","author":"Dhumane A.","year":"2016"},{"key":"e_1_2_1_17_2","first-page":"767","volume-title":"Econ.","author":"Gabaix X.","year":"1999"},{"volume-title":"ITS","year":"2002","author":"Huffaker B.","key":"e_1_2_1_18_2"},{"key":"e_1_2_1_19_2","first-page":"2017","author":"Huston G.","year":"2016","journal-title":"BGP in"},{"key":"e_1_2_1_20_2","doi-asserted-by":"publisher","DOI":"10.1145\/345910.345953"},{"key":"e_1_2_1_21_2","doi-asserted-by":"publisher","DOI":"10.1109\/PDP.2009.44"},{"key":"e_1_2_1_22_2","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2007.221"},{"key":"e_1_2_1_23_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.82.036106"},{"key":"e_1_2_1_24_2","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2003.814667"},{"key":"e_1_2_1_25_2","first-page":"9","volume-title":"Networking","author":"Landa R.","year":"2013"},{"key":"e_1_2_1_26_2","doi-asserted-by":"publisher","DOI":"10.1109\/IWQoS.2016.7590394"},{"volume-title":"ETT","year":"2015","author":"Magoni D.","key":"e_1_2_1_27_2"},{"key":"e_1_2_1_28_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.06.022"},{"issue":"2","key":"e_1_2_1_29_2","first-page":"022807","volume":"92","author":"Papadopoulos F.","year":"2015","journal-title":"Network Geometry Inference Using Common Neighbors. Phys. Rev. E"},{"key":"e_1_2_1_30_2","doi-asserted-by":"publisher","DOI":"10.1038\/nature11459"},{"key":"e_1_2_1_31_2","doi-asserted-by":"publisher","DOI":"10.5555\/1833515.1833893"},{"key":"e_1_2_1_32_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2013.2294052"},{"issue":"1","key":"e_1_2_1_33_2","first-page":"1","volume":"32","author":"Varadhan K.","year":"2000","journal-title":"Persistent Route Oscillations in Inter-Domain Routing. Com. Net."},{"key":"e_1_2_1_34_2","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2016.7761644"}],"container-title":["ACM SIGCOMM Computer Communication Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3138808.3138811","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3138808.3138811","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T19:04:33Z","timestamp":1750273473000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3138808.3138811"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9,6]]},"references-count":34,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,9,6]]}},"alternative-id":["10.1145\/3138808.3138811"],"URL":"https:\/\/doi.org\/10.1145\/3138808.3138811","relation":{},"ISSN":["0146-4833"],"issn-type":[{"type":"print","value":"0146-4833"}],"subject":[],"published":{"date-parts":[[2017,9,6]]},"assertion":[{"value":"2017-09-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}