{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T13:09:43Z","timestamp":1648991383069},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2010,6,4]],"date-time":"2010-06-04T00:00:00Z","timestamp":1275609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Telecommun Syst"],"published-print":{"date-parts":[[2011,10]]},"DOI":"10.1007\/s11235-010-9334-y","type":"journal-article","created":{"date-parts":[[2010,6,3]],"date-time":"2010-06-03T15:36:21Z","timestamp":1275579381000},"page":"63-75","source":"Crossref","is-referenced-by-count":1,"title":["Powering Internet with power-law networking"],"prefix":"10.1007","volume":"48","author":[{"given":"Ilkka","family":"Norros","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hannu","family":"Flinck","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,6,4]]},"reference":[{"key":"9334_CR1","doi-asserted-by":"crossref","unstructured":"Brady, A., & Cowen, L. (2006). Compact routing on power-law graphs with additive stretch. In ALENEX.","DOI":"10.1137\/1.9781611972863.12"},{"issue":"6","key":"9334_CR2","doi-asserted-by":"crossref","first-page":"1102","DOI":"10.1209\/epl\/i2006-10049-1","volume":"74","author":"S. Carmi","year":"2006","unstructured":"Carmi, S., Cohen, R., & Dolev, D. (2006). Searching complex networks efficiently with minimal information. Europhysics Letters, 74(6), 1102\u20131108.","journal-title":"Europhysics Letters"},{"issue":"1","key":"9334_CR3","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1080\/15427951.2004.10129081","volume":"1","author":"F. Chung","year":"2003","unstructured":"Chung, F., & Lu, L. (2003). The average distance in a random graph with given expected degrees. Internet Mathematics, 1(1), 91\u2013113.","journal-title":"Internet Mathematics"},{"issue":"1","key":"9334_CR4","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1006\/jagm.2000.1134","volume":"38","author":"L. Cowen","year":"2001","unstructured":"Cowen, L. (2001). Compact routing with minimum stretch. Journal of Algorithms, 38(1), 170\u2013183.","journal-title":"Journal of Algorithms"},{"key":"9334_CR5","unstructured":"Farinacci, D., Fuller, V., & Meyer, D. (2009). Locator\/ID separation protocol (LISP). http:\/\/tools.ietf.org\/html\/draft-ietf-lisp-04 . Internet Draft, September 16, 2009."},{"key":"9334_CR6","unstructured":"Farinacci, D., Fuller, V., Meyer, D., & Lewis, D. (2009). LISP alternative topology (LISP + ALT). draft-ietf-lisp-alt-05.txt . Internet Draft, February 24, 2009."},{"key":"9334_CR7","doi-asserted-by":"crossref","unstructured":"Godfrey, P., Ganichev, I., Shenker, S., & Stoica, I. (2009). Pathlet routing. In SIGCOMM\u201909, Barcelona, Spain, August 2009.","DOI":"10.1145\/1592568.1592583"},{"key":"9334_CR8","doi-asserted-by":"crossref","unstructured":"Janson, S., \u0141uczak, T., & Norros, I. (2009, submitted). Large cliques in a power-law random graph. arXiv:0905.0561 .","DOI":"10.1017\/S0021900200007415"},{"key":"9334_CR9","doi-asserted-by":"crossref","unstructured":"Krioukov, D., Fall, K., & Yang, X. (2004). Compact routing on Internet-like graphs. In Infocom. doi: 10.1109\/INFCOM.2004.1354495 .","DOI":"10.1109\/INFCOM.2004.1354495"},{"issue":"3","key":"9334_CR10","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1145\/1273445.1273450","volume":"37","author":"D. Krioukov","year":"2007","unstructured":"Krioukov, D., Claffy, K. C., Fall, K., & Brady, A. (2007). On compact routing for the Internet. ACM SIGCOMM Computer Communication Review (CCR), 37(3), 41\u201352.","journal-title":"ACM SIGCOMM Computer Communication Review (CCR)"},{"key":"9334_CR11","doi-asserted-by":"crossref","unstructured":"Norros, I. (2009). Powernet: compact routing on Internet-like random networks. In NGI 2009, Aveiro, July 2009.","DOI":"10.1109\/NGI.2009.5175777"},{"key":"9334_CR12","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1239\/aap\/1143936140","volume":"38","author":"I. Norros","year":"2006","unstructured":"Norros, I., & Reittu, H. (2006). On a conditionally Poissonian graph process. Advances in Applied Probability, 38, 59\u201375.","journal-title":"Advances in Applied Probability"},{"issue":"2","key":"9334_CR13","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1109\/MNET.2008.4476070","volume":"22","author":"I. Norros","year":"2008","unstructured":"Norros, I., & Reittu, H. (2008). Network models with a \u2018soft hierarchy\u2019: a random graph construction with loglog scalability. IEEE Network, 22(2), 40\u201346.","journal-title":"IEEE Network"},{"issue":"3","key":"9334_CR14","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1080\/15427951.2008.10129162","volume":"5","author":"I. Norros","year":"2008","unstructured":"Norros, I., & Reittu, H. (2008). On the attack resistance of power-law random graphs in the finite mean, infinite variance region. Internet Mathematics, 5(3), 251\u2013266.","journal-title":"Internet Mathematics"},{"key":"9334_CR15","doi-asserted-by":"crossref","unstructured":"Reittu, H., & Norros, I. (2002). On the effect of very large nodes in Internet graphs. In Proc. GLOBECOM, Taipei, Taiwan.","DOI":"10.1109\/GLOCOM.2002.1189105"},{"issue":"4","key":"9334_CR16","doi-asserted-by":"crossref","first-page":"775","DOI":"10.1109\/TNET.2007.893888","volume":"15","author":"X. Yang","year":"2007","unstructured":"Yang, X., Clark, D., & Berger, A. (2007). NIRA: a new inter-domain routing architecture. IEEE\/ACM Transactions on Networking, 15(4), 775\u2013788.","journal-title":"IEEE\/ACM Transactions on Networking"}],"container-title":["Telecommunication Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11235-010-9334-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11235-010-9334-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11235-010-9334-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T10:50:09Z","timestamp":1559386209000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11235-010-9334-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6,4]]},"references-count":16,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2011,10]]}},"alternative-id":["9334"],"URL":"https:\/\/doi.org\/10.1007\/s11235-010-9334-y","relation":{},"ISSN":["1018-4864","1572-9451"],"issn-type":[{"value":"1018-4864","type":"print"},{"value":"1572-9451","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,6,4]]}}}