{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,11]],"date-time":"2024-01-11T00:08:38Z","timestamp":1704931718706},"reference-count":36,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Commun."],"published-print":{"date-parts":[[2016]]},"DOI":"10.1587\/transcom.2015ebp3513","type":"journal-article","created":{"date-parts":[[2016,7,31]],"date-time":"2016-07-31T22:05:58Z","timestamp":1470002758000},"page":"1835-1845","source":"Crossref","is-referenced-by-count":1,"title":["SNGR: Scalable Name-Based Geometric Routing for ICN"],"prefix":"10.23919","volume":"E99.B","author":[{"given":"Yanbin","family":"SUN","sequence":"first","affiliation":[{"name":"Harbin Institute of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu","family":"ZHANG","sequence":"additional","affiliation":[{"name":"Harbin Institute of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Binxing","family":"FANG","sequence":"additional","affiliation":[{"name":"Harbin Institute of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongli","family":"ZHANG","sequence":"additional","affiliation":[{"name":"Harbin Institute of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] S. Yanbin, Z. Yu, Z. Hongli, F. Binxing, and S. Jiantao, \u201cAn ICN-oriented name-based routing scheme,\u201d Intelligent Computation in Big Data Era, Communications in Computer and Information Science, vol.503, pp.101-108, Springer, 2015.","DOI":"10.1007\/978-3-662-46248-5_13"},{"key":"2","unstructured":"[2] \u201cWe knew the web was big.\u201d http:\/\/googleblog.blogspot.com\/2008\/07\/we-knew-web-was-big.html"},{"key":"3","unstructured":"[3] \u201cBGP routing table analysis reports.\u201d http:\/\/bgp.potaroo.net\/"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] T. Koponen, M. Chawla, B.-G. Chun, A. Ermolinskiy, K.H. Kim, S. Shenker, and I. Stoica, \u201cA data-oriented (and beyond) network architecture,\u201d ACM SIGCOMM Comput. Commun. Rev., vol.37, no.4, pp.181-192, 2007.","DOI":"10.1145\/1282427.1282402"},{"key":"5","unstructured":"[5] D. Lagutin, K. Visala, and S. Tarkoma, \u201cPublish\/subscribe For Internet: PSIRP perspective,\u201d Proc. Future Internet Assembly, pp.75-84, 2010."},{"key":"6","unstructured":"[6] C. Dannewitz, \u201cNetinf: An information-centric design for the future Internet,\u201d Proc. 3rd GI\/ITG KuVS Workshop on The Future Internet, 2009."},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] M. D'Ambrosio, C. Dannewitz, H. Karl, and V. Vercellone, \u201cMDHT: A hierarchical name resolution service for information-centric networks,\u201d Proc. ACM SIGCOMM Workshop on Information-Centric Networking, ICN'11, pp.7-12, 2011.","DOI":"10.1145\/2018584.2018587"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] C. Dannewitz, M. D'Ambrosio, and V. Vercellone, \u201cHierarchical DHT-based name resolution for information-centric networks,\u201d Comput. Commun., vol.36, no.7, pp.736-749, 2013.","DOI":"10.1016\/j.comcom.2013.01.014"},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] H. Liu, X. De Foy, and D. Zhang, \u201cA multi-level DHT routing framework with aggregation,\u201d Proc. Second Edition of the ICN Workshop on Information-Centric Networking, ICN'12, pp.43-48, 2012.","DOI":"10.1145\/2342488.2342498"},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] V. Jacobson, D.K. Smetters, J.D. Thornton, M.F. Plass, N.H. Briggs, and R.L. Braynard, \u201cNetworking named content,\u201d Proc. 5th International Conference on Emerging Networking Experiments and Technologies, CoNEXT'09, pp.1-12, 2009.","DOI":"10.1145\/1658939.1658941"},{"key":"11","unstructured":"[11] L. Zhang, D. Estrin, J. Burke, et al., \u201cNamed data networking (ndn) project,\u201d Relat\u00f3rio T\u00e9cnico NDN-0001, Xerox Palo Alto Research Center-PARC, 2010."},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] A. Singla, P.B. Godfrey, K. Fall, G. Iannaccone, and S. Ratnasamy, \u201cScalable routing on flat names,\u201d Proc. 6th International Conference on Co-NEXT'10, pp.20-31, 2010.","DOI":"10.1145\/1921168.1921195"},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] M. Caesar, M. Castro, E.B. Nightingale, G. O'Shea, and A. Rowstron, \u201cVirtual ring routing: Network routing inspired by DHTs,\u201d ACM SIGCOMM Comput. Commun. Rev., vol.36, no.4, pp.351-362, 2006.","DOI":"10.1145\/1151659.1159954"},{"key":"14","doi-asserted-by":"crossref","unstructured":"[14] O. Landsiedel, K.A. Lehmann, and K. Wehrle, \u201cT-DHT: Topology-based distributed hash tables,\u201d Proc. 5th IEEE International Conference on Peer-to-Peer Computing (P2P'05), pp.143-144, 2005.","DOI":"10.1109\/P2P.2005.36"},{"key":"15","doi-asserted-by":"crossref","unstructured":"[15] J. Newsome and D. Song, \u201cGEM: Graph embedding for routing and data-centric storage in sensor networks without geographic information,\u201d Proc. 1st International Conference on Embedded Networked Sensor Systems, SenSys'03, pp.76-88, 2003.","DOI":"10.1145\/958491.958501"},{"key":"16","doi-asserted-by":"crossref","unstructured":"[16] S. Ratnasamy, B. Karp, L. Yin, F. Yu, D. Estrin, R. Govindan, and S. Shenker, \u201cGHT: A geographic hash table for data-centric storage,\u201d Proc. 1st ACM International Workshop on Wireless Sensor Networks and Applications, WSNA'02, pp.78-87, 2002.","DOI":"10.1145\/570738.570750"},{"key":"17","doi-asserted-by":"crossref","unstructured":"[17] J. Herzen, C. Westphal, and P. Thiran, \u201cScalable routing easy as PIE: A practical isometric embedding protocol,\u201d 2011 19th IEEE International Conference on Network Protocols, pp.49-58, 2011.","DOI":"10.1109\/ICNP.2011.6089081"},{"key":"18","doi-asserted-by":"crossref","unstructured":"[18] R. Kleinberg, \u201cGeographic routing using hyperbolic space,\u201d Proc. 26th IEEE International Conference on Computer Communications, IEEE INFOCOM 2007, pp.1902-1909, 2007.","DOI":"10.1109\/INFCOM.2007.221"},{"key":"19","doi-asserted-by":"crossref","unstructured":"[19] A. Hofer, S. Roos, and T. Strufe, \u201cGreedy embedding, routing and content addressing for darknets,\u201d Proc. 2013 Conference on Networked Systems, pp.43-50, 2013.","DOI":"10.1109\/NetSys.2013.23"},{"key":"20","doi-asserted-by":"crossref","unstructured":"[20] S. Roos, L. Wang, T. Strufe, and J. Kangasharju, \u201cEnhancing compact routing in CCN with prefix embedding and topology-aware hashing,\u201d Proc. 9th ACM Workshop on Mobility in the Evolving Internet Architecture, MobiArch'14, pp.49-54, 2014.","DOI":"10.1145\/2645892.2645900"},{"key":"21","doi-asserted-by":"crossref","unstructured":"[21] R. Ahmed, M.F. Bari, S.R. Chowdhury, M.G. Rabbani, R. Boutaba, and B. Mathieu, \u201c\u03b1Route: A name based routing scheme for information centric networks,\u201d 2013 Proceedings IEEE INFOCOM, pp.90-94, 2013.","DOI":"10.1109\/INFCOM.2013.6566741"},{"key":"22","doi-asserted-by":"crossref","unstructured":"[22] L. Kleinrock and F. Kamoun, \u201cHierarchical routing for large networks Performance evaluation and optimization,\u201d Comput. Netw., vol.1, no.3, pp.155-174, 1977.","DOI":"10.1016\/0376-5075(77)90002-2"},{"key":"23","doi-asserted-by":"crossref","unstructured":"[23] I. Stoica, R. Morris, D. Karger, M.F. Kaashoek, and H. Balakrishnan, \u201cChord: A scalable peer-to-peer lookup service for internet applications,\u201d ACM SIGCOMM Comput. Commun. Rev., vol.31, no.4, pp.149-160, 2001.","DOI":"10.1145\/964723.383071"},{"key":"24","doi-asserted-by":"crossref","unstructured":"[24] S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Schenker, \u201cA scalable content-addressable network,\u201d ACM SIGCOMM Comput. Commun. Rev., vol.31, no.4, pp.161-172, 2001.","DOI":"10.1145\/964723.383072"},{"key":"25","doi-asserted-by":"crossref","unstructured":"[25] B. Karp and H.T. Kung, \u201cGPSR: Greedy perimeter stateless routing for wireless networks,\u201d Proc. 6th Annual International Conference on Mobile Computing and Networking, MobiCom'00, pp.243-254, 2000.","DOI":"10.1145\/345910.345953"},{"key":"26","doi-asserted-by":"crossref","unstructured":"[26] C.H. Papadimitriou and D. Ratajczak, \u201cOn a conjecture related to geometric routing,\u201d Theor. Comput. Sci., vol.344, no.1, pp.3-14, 2005.","DOI":"10.1016\/j.tcs.2005.06.022"},{"key":"27","doi-asserted-by":"crossref","unstructured":"[27] A. Cvetkovski and M. Crovella, \u201cHyperbolic embedding and routing for dynamic graphs,\u201d Proc. The 28th Conference on Computer Communications, IEEE INFOCOM 2009, pp.1647-1655, 2009.","DOI":"10.1109\/INFCOM.2009.5062083"},{"key":"28","doi-asserted-by":"crossref","unstructured":"[28] R. Perlman, \u201cAn algorithm for distributed computation of a spanningtree in an extended LAN,\u201d ACM SIGCOMM Comput. Commun. Rev., vol.15, no.4, pp.44-53, 1985.","DOI":"10.1145\/318951.319004"},{"key":"29","doi-asserted-by":"crossref","unstructured":"[29] Y. Sun, Y. Zhang, S. Su, H. Zhang, and B. Fang, \u201cGeometric name routing for ICN in dynamic world,\u201d China Commun., vol.12, no.7, pp.47-59, 2015.","DOI":"10.1109\/CC.2015.7188524"},{"key":"30","doi-asserted-by":"crossref","unstructured":"[30] D. Chen and P. Varshney, \u201cA survey of void handling techniques for geographic routing in wireless networks,\u201d IEEE Commun. Surv. Tutorials, vol.9, no.1, pp.50-67, 2007.","DOI":"10.1109\/COMST.2007.358971"},{"key":"31","doi-asserted-by":"crossref","unstructured":"[31] S. Sahhaf, W. Tavernier, D. Colle, M. Pickavet, and P. Demeester, \u201cLink failure recovery technique for greedy routing in the hyperbolic plane,\u201d Comput. Commun., vol.36, no.6, pp.698-707, 2013.","DOI":"10.1016\/j.comcom.2012.08.023"},{"key":"32","unstructured":"[32] A. Gupta, B. Liskov, R. Rodrigues, et al., \u201cOne hop lookups for peer-to-peer overlays,\u201d Proc. HotOS, pp.7-12, 2003."},{"key":"33","doi-asserted-by":"crossref","unstructured":"[33] L.R. Monnerat and C.L. Amorim, \u201cD1HT: A distributed one hop hash table,\u201d Proc. 20th IEEE International Parallel & Distributed Processing Symposium, 2006.","DOI":"10.1109\/IPDPS.2006.1639278"},{"key":"34","unstructured":"[34] S. Arora, H. Lee, and R. Thurimella, \u201cAlgorithms for finding disjoint paths in mobile networks,\u201d 2003."},{"key":"35","unstructured":"[35] \u201cThe IPv4 routed\/24 AS links dataset-jue, 2012.\u201d http:\/\/www.caida.org\/data\/active\/ipv4_routed_topology_dataset.xml"},{"key":"36","doi-asserted-by":"crossref","unstructured":"[36] A.-L. Barab\u00e1si, \u201cEmergence of scaling in random networks,\u201d Science, vol.286, no.5439, pp.509-512, 1999.","DOI":"10.1126\/science.286.5439.509"}],"container-title":["IEICE Transactions on Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transcom\/E99.B\/8\/E99.B_2015EBP3513\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,10]],"date-time":"2024-01-10T14:59:54Z","timestamp":1704898794000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transcom\/E99.B\/8\/E99.B_2015EBP3513\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"references-count":36,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2016]]}},"URL":"https:\/\/doi.org\/10.1587\/transcom.2015ebp3513","relation":{},"ISSN":["0916-8516","1745-1345"],"issn-type":[{"value":"0916-8516","type":"print"},{"value":"1745-1345","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}