{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T11:19:59Z","timestamp":1725621599817},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642244025"},{"type":"electronic","value":"9783642244032"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-24403-2_4","type":"book-chapter","created":{"date-parts":[[2011,10,17]],"date-time":"2011-10-17T11:56:27Z","timestamp":1318852587000},"page":"44-58","source":"Crossref","is-referenced-by-count":0,"title":["Improved Compact Routing Schemes for Power-Law Networks"],"prefix":"10.1007","author":[{"given":"Mingdong","family":"Tang","sequence":"first","affiliation":[]},{"given":"Jianxun","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Guoqing","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","first-page":"1","volume-title":"13th ACM Symposium on Parallel Algorithms and Architecture","author":"M. Thorup","year":"2001","unstructured":"Thorup, M., Zwick, U.: Compact routing schemes. In: 13th ACM Symposium on Parallel Algorithms and Architecture, pp. 1\u201310. ACM Press, New York (2001)"},{"issue":"1","key":"4_CR2","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1006\/jagm.2000.1134","volume":"38","author":"L. Cowen","year":"2001","unstructured":"Cowen, L.: Compact routing with minimum stretch. Journal of Algorithms\u00a038(1), 170\u2013183 (2001)","journal-title":"Journal of Algorithms"},{"issue":"5","key":"4_CR3","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1006\/jpdc.2000.1705","volume":"61","author":"C. Gavoille","year":"2001","unstructured":"Gavoille, C., Gengler, M.: Space-Efficiency for routing schemes of stretch factor three. Journal of Parallel and Distributed Computing\u00a061(5), 679\u2013687 (2001)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"4_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1007\/3-540-48224-5_62","volume-title":"Automata, Languages and Programming","author":"P. Fraigniaud","year":"2001","unstructured":"Fraigniaud, P., Gavoille, C.: Routing in trees. In: Yu, Y., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol.\u00a02076, pp. 757\u2013772. Springer, Heidelberg (2001)"},{"issue":"2","key":"4_CR5","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.ipl.2007.02.015","volume":"103","author":"K.A. Laing","year":"2007","unstructured":"Laing, K.A.: Name-independent compact routing in trees. Information Processing Letters\u00a0103(2), 57\u201360 (2007)","journal-title":"Information Processing Letters"},{"key":"4_CR6","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/3-540-45655-4_8","volume-title":"8th International Computing and Combinatorics Conference","author":"H. Lu","year":"2002","unstructured":"Lu, H.: Improved compact routing tables for planar networks via orderly spanning trees. In: 8th International Computing and Combinatorics Conference, pp. 57\u201366. Springer, Heidelberg (2002)"},{"key":"4_CR7","first-page":"49","volume-title":"17th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA 2005)","author":"I. Abraham","year":"2005","unstructured":"Abraham, I., Malkhi, D.: Name independent routing for growth bounded networks. In: 17th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA 2005), pp. 49\u201355. ACM Press, New York (2005)"},{"key":"4_CR8","first-page":"939","volume-title":"18th ACM-SIAM Symposium on Discrete Algorithms","author":"G. Konjevod","year":"2007","unstructured":"Konjevod, G., Richa, A., Xia, D.: Optimal scale-free compact routing schemes in networks of low doubling dimension. In: 18th ACM-SIAM Symposium on Discrete Algorithms, pp. 939\u2013948. ACM Press, New York (2007)"},{"key":"4_CR9","volume-title":"26th International Conference on Distributed Computing Systems","author":"I. Abraham","year":"2006","unstructured":"Abraham, I., Gavoille, C., Goldberg, A.V., Malkhi, D.: Routing in networks with low doubling dimension. In: 26th International Conference on Distributed Computing Systems. IEEE Computer Society, Washington, DC (2006)"},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1145\/316194.316229","volume":"29","author":"M. Faloutsos","year":"1999","unstructured":"Faloutsos, M., Faloutsos, P., Faloutsos, C.: On power-law relationships of the Internet topology. Computer Communications Review\u00a029, 251\u2013262 (1999)","journal-title":"Computer Communications Review"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Ripeanu, M., Iarmnitchi, A., Foster, I.: Mapping the Gnutella network. IEEE Internet Computing, 50\u201357 (2002)","DOI":"10.1109\/4236.978369"},{"key":"4_CR12","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1038\/43601","volume":"401","author":"R. Albert","year":"1999","unstructured":"Albert, R., Jeong, H., Barabasi, A.L.: Dimeter of the world wide web. Nature\u00a0401, 130\u2013131 (1999)","journal-title":"Nature"},{"key":"4_CR13","volume-title":"IEEE INFOCOM 2004","author":"D. Krioukov","year":"2004","unstructured":"Krioukov, D., Fall, K., Yang, X.: Compact routing on Internet-like graphs. In: IEEE INFOCOM 2004, IEEE Computer Society, Washington, DC (2004)"},{"key":"4_CR14","first-page":"119","volume-title":"8th Workshop on Algorithm Engineering and Experiments","author":"A. Brady","year":"2006","unstructured":"Brady, A., Cowen, L.: Compact routing on power law graphs with additive stretch. In: 8th Workshop on Algorithm Engineering and Experiments, pp. 119\u2013128. SIAM, Philadelphia (2006)"},{"key":"4_CR15","doi-asserted-by":"publisher","first-page":"1102","DOI":"10.1209\/epl\/i2006-10049-1","volume":"74","author":"S. Carmi","year":"2006","unstructured":"Carmi, S., Cohen, R., Dolev, D.: Searching complex networks efficiently with minimal information. Europhysics Letters\u00a074, 1102\u20131108 (2006)","journal-title":"Europhysics Letters"},{"key":"4_CR16","first-page":"977","volume-title":"IEEE INFOCOM 2008","author":"M. Enachescu","year":"2008","unstructured":"Enachescu, M., Wang, M., Goel, A.: Reducing maximum stretch in compact routing. In: IEEE INFOCOM 2008, pp. 977\u2013985. IEEE Computer Society, Washington, DC (2008)"},{"key":"4_CR17","volume-title":"5th Euro-NGI Conference on Next Generation Internet Networks","author":"I. Norros","year":"2009","unstructured":"Norros, I.: Powernet: compact routing on Internet-like random networks. In: 5th Euro-NGI Conference on Next Generation Internet Networks. IEEE Press, New York (2009)"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Meyer, D., Zhang, L., Fall, K.: Report from the IAB workshop on routing and addressing. RFC4984 (2007)","DOI":"10.17487\/rfc4984"},{"key":"4_CR19","unstructured":"Huston, G.: Analyzing the Internet\u2019s BGP routing table. The Internet Protocol Journal\u00a04(1) (2001)"},{"issue":"3","key":"4_CR20","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1145\/1273445.1273450","volume":"37","author":"D. Krioukov","year":"2007","unstructured":"Krioukov, D., Claffy, K.: On compact routing for the Internet. ACM SIGCOMM Computer Communication Review\u00a037(3), 43\u201352 (2007)","journal-title":"ACM SIGCOMM Computer Communication Review"},{"key":"4_CR21","first-page":"15879","volume":"1","author":"F. Chung","year":"2002","unstructured":"Chung, F., Lu, L.: The average distances in random graphs with given expected degrees. Internet Mathematics\u00a01, 15879\u201315882 (2002)","journal-title":"Internet Mathematics"},{"key":"4_CR22","unstructured":"Lu, L.: Probabilistic methods in massive graphs and Internet computing. Ph D thesis, University of California San Diego (2002)"},{"key":"4_CR23","first-page":"11","volume-title":"17th Annual ACM Symposium on Principles of Distributed Computing","author":"T. Eilam","year":"1998","unstructured":"Eilam, T., Gavoille, C., Peleg, D.: Compact routing schemes with low stretch factor. In: 17th Annual ACM Symposium on Principles of Distributed Computing, pp. 11\u201320. ACM Press, New York (1998)"},{"key":"4_CR24","first-page":"183","volume-title":"ACM Symposium on Theory of Computing","author":"M. Thorup","year":"2001","unstructured":"Thorup, M., Zwick, U.: Approximate distance oracles. In: ACM Symposium on Theory of Computing, pp. 183\u2013192. ACM Press, New York (2001)"},{"key":"4_CR25","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A. Barabasi","year":"1999","unstructured":"Barabasi, A., Albert, R.: Emergence of scaling in random network. Science\u00a0286, 509 (1999)","journal-title":"Science"},{"key":"4_CR26","doi-asserted-by":"publisher","first-page":"123027","DOI":"10.1088\/1367-2630\/10\/12\/123027","volume":"10","author":"G.Q. Zhang","year":"2008","unstructured":"Zhang, G.Q., Zhang, G.Q., Yang, Q.F., Cheng, S.Q., Zhou, T.: Evolution of the Internet and its cores. New Journal of Physics\u00a010, 123027 (2008)","journal-title":"New Journal of Physics"},{"key":"4_CR27","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1109\/LCOMM.2004.823426","volume":"3","author":"S. Zhou","year":"2004","unstructured":"Zhou, S., Mondragon, R.J.: The rich-club phenomenon in the Internet topology. IEEE Communications Letters\u00a03, 180\u2013182 (2004)","journal-title":"IEEE Communications Letters"},{"key":"4_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/978-3-642-04355-0_41","volume-title":"Distributed Computing","author":"W. Chen","year":"2009","unstructured":"Chen, W., Sommer, C., Teng, S.-H., Wang, Y.: Compacting routing in power-law graphs. In: Keidar, I. (ed.) DISC 2009. LNCS, vol.\u00a05805, pp. 379\u2013391. Springer, Heidelberg (2009)"},{"key":"4_CR29","unstructured":"CAIDA, http:\/\/www.caida.org"}],"container-title":["Lecture Notes in Computer Science","Network and Parallel Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24403-2_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:15:58Z","timestamp":1606187758000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24403-2_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642244025","9783642244032"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24403-2_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}