{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T06:00:58Z","timestamp":1783576858501,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642415265","type":"print"},{"value":"9783642415272","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-41527-2_29","type":"book-chapter","created":{"date-parts":[[2013,10,3]],"date-time":"2013-10-03T10:55:48Z","timestamp":1380797748000},"page":"418-432","source":"Crossref","is-referenced-by-count":5,"title":["On the Communication Complexity of Distributed Name-Independent Routing Schemes"],"prefix":"10.1007","author":[{"given":"Cyril","family":"Gavoille","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christian","family":"Glacet","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nicolas","family":"Hanusse","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David","family":"Ilcinkas","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"29_CR1","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 (ICDCS). IEEE Computer Society Press (July 2006)"},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"Abraham, I., Gavoille, C., Malkhi, D.: On space-stretch trade-offs: Lower bounds. In: 18th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 217\u2013224. ACM Press (July 2006)","DOI":"10.1145\/1148109.1148143"},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"Abraham, I., Gavoille, C., Malkhi, D.: On space-stretch trade-offs: Upper bounds. In: 18th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 207\u2013216. ACM Press (July 2006)","DOI":"10.1145\/1148109.1148144"},{"key":"29_CR4","first-page":"37","volume":"3","author":"I. Abraham","year":"2008","unstructured":"Abraham, I., Gavoille, C., Malkhi, D., Nisan, N., Thorup, M.: Compact name-independent routing with minimum stretch. ACM Transactions on Algorithms\u00a03, Article 37 (2008)","journal-title":"ACM Transactions on Algorithms"},{"key":"29_CR5","doi-asserted-by":"publisher","first-page":"837","DOI":"10.1007\/s00224-010-9283-6","volume":"47","author":"I. Abraham","year":"2010","unstructured":"Abraham, I., Gavoille, C., Malkhi, D., Wieder, U.: Strong-diameter decompositions of minor free graphs. Theory of Computing Systems\u00a047, 837\u2013855 (2010)","journal-title":"Theory of Computing Systems"},{"key":"29_CR6","doi-asserted-by":"crossref","unstructured":"Abraham, I., Malkhi, D.: Name independent routing for growth bounded networks. In: 17th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 49\u201355. ACM Press (July 2005)","DOI":"10.1145\/1073970.1073978"},{"key":"29_CR7","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1006\/jagm.1993.1016","volume":"14","author":"Y. Afek","year":"1993","unstructured":"Afek, Y., Ricklin, M.: Sparser: A paradigm for running distributed algorithms. Journal of Algorithms\u00a014, 316\u2013328 (1993)","journal-title":"Journal of Algorithms"},{"key":"29_CR8","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1137\/04062053","volume":"20","author":"M. Arias","year":"2006","unstructured":"Arias, M., Cowen, L.J., Laing, K.A., Rajaraman, R., Taka, O.: Compact routing with name independence. SIAM Journal on Discrete Mathematics\u00a020, 705\u2013726 (2006)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"29_CR9","doi-asserted-by":"publisher","first-page":"804","DOI":"10.1145\/4221.4227","volume":"32","author":"B. Awerbuch","year":"1985","unstructured":"Awerbuch, B.: Complexity of network synchronization. Journal of the ACM\u00a032, 804\u2013823 (1985)","journal-title":"Journal of the ACM"},{"key":"29_CR10","doi-asserted-by":"publisher","first-page":"2515","DOI":"10.1109\/26.310604","volume":"42","author":"B. Awerbuch","year":"1994","unstructured":"Awerbuch, B., Bar-Noy, A., Gopal, M.: Approximate distributed Bellman-Ford algorithms. IEEE Transactions on Communications\u00a042, 2515\u20132519 (1994)","journal-title":"IEEE Transactions on Communications"},{"key":"29_CR11","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/0196-6774(90)90017-9","volume":"11","author":"B. Awerbuch","year":"1990","unstructured":"Awerbuch, B., Bar-Noy, A., Linial, N., Peleg, D.: Improved routing strategies with succinct tables. Journal of Algorithms\u00a011, 307\u2013341 (1990)","journal-title":"Journal of Algorithms"},{"key":"29_CR12","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1006\/inco.1993.1054","volume":"106","author":"R.A. Baeza-Yates","year":"1993","unstructured":"Baeza-Yates, R.A., Culberson, J.C., Rawlins, G.J.E.: Searching in the plane. Information and Computation\u00a0106, 234\u2013252 (1993)","journal-title":"Information and Computation"},{"key":"29_CR13","unstructured":"Bertsekas, D.P., Gallager, R.G.: Data Networks, 2nd edn. Routing in Data Networks, ch. 5. Prentice Hall (1992)"},{"key":"29_CR14","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1145\/1103963.1103968","volume":"1","author":"M. Elkin","year":"2005","unstructured":"Elkin, M.: Computing almost shortest paths. ACM Transactions on Algorithms\u00a01, 283\u2013323 (2005)","journal-title":"ACM Transactions on Algorithms"},{"key":"29_CR15","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/s00446-005-0147-2","volume":"18","author":"M. Elkin","year":"2006","unstructured":"Elkin, M., Zhang, J.: Efficient algorithms for constructing (1\u2009+\u2009\u03b5,\u03b2)-spanners in the distributed and streaming models. Distributed Computing\u00a018, 375\u2013385 (2006)","journal-title":"Distributed Computing"},{"key":"29_CR16","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: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol.\u00a02076, pp. 757\u2013772. Springer, Heidelberg (2001)"},{"key":"29_CR17","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1006\/jagm.1996.0842","volume":"24","author":"S. Haldar","year":"1997","unstructured":"Haldar, S.: An \u2019all pairs shortest paths\u2019 distributed algorithm using 2n\n                           2 messages. Journal of Algorithms\u00a024, 20\u201336 (1997)","journal-title":"Journal of Algorithms"},{"key":"29_CR18","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1006\/inco.1996.0092","volume":"131","author":"M.-Y. Kao","year":"1996","unstructured":"Kao, M.-Y., Reif, J.H., Tate, S.R.: Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem. Information and Computation\u00a0131, 63\u201379 (1996)","journal-title":"Information and Computation"},{"key":"29_CR19","first-page":"155","volume":"1","author":"L. Kleinrock","year":"1977","unstructured":"Kleinrock, L., Kamoun, F.: Hierarchical routing for large networks; performance evaluation and optimization. Computer Networks\u00a01, 155\u2013174 (1977)","journal-title":"Computer Networks"},{"key":"29_CR20","doi-asserted-by":"crossref","unstructured":"Konjevod, G., Richa, A.W., Xia, D.: Optimal-stretch name-independent compact routing in doubling metrics. In: 25th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 198\u2013207. ACM Press (July 2006)","DOI":"10.1145\/1146381.1146412"},{"key":"29_CR21","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, 57\u201360 (2007)","journal-title":"Information Processing Letters"},{"key":"29_CR22","doi-asserted-by":"crossref","unstructured":"Peleg, D.: Distributed Computing: A Locality-Sensitive Approach. SIAM Monographs on Discrete Mathematics and Applications (2000)","DOI":"10.1137\/1.9780898719772"},{"key":"29_CR23","first-page":"29","volume":"3","author":"L. Roditty","year":"2008","unstructured":"Roditty, L., Thorup, M., Zwick, U.: Roundtrip spanners and roundtrip routing in directed graphs. ACM Transactions on Algorithms\u00a03, Article 29 (2008)","journal-title":"ACM Transactions on Algorithms"},{"key":"29_CR24","doi-asserted-by":"crossref","unstructured":"Singla, A., Godfrey, P.B., Fall, K., Iannaccone, G., Ratnasamy, S.: Scalable routing on flat names. In: 6th International Conference on Emerging Networking EXperiments and Technologies (CoNEXT), Article No. 20. ACM Press (November 2010)","DOI":"10.1145\/1921168.1921195"},{"key":"29_CR25","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1016\/j.comcom.2012.09.009","volume":"36","author":"M. Tang","year":"2013","unstructured":"Tang, M., Zhang, G., Lin, T., Liu, J.: HDLBR: A name-independent compact routing scheme for power-law networks. Computer Communications\u00a036, 351\u2013359 (2013)","journal-title":"Computer Communications"},{"key":"29_CR26","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/201019.201029","volume":"42","author":"J.N. Tsitsiklis","year":"1995","unstructured":"Tsitsiklis, J.N., Stamoulis, G.D.: On the average communication complexity of asynchronous distributed algorithms. Journal of the ACM\u00a042, 382\u2013400 (1995)","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-41527-2_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T14:34:13Z","timestamp":1558103653000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-41527-2_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642415265","9783642415272"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-41527-2_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}