{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:15:00Z","timestamp":1750306500374,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":48,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,1,4]],"date-time":"2016-01-04T00:00:00Z","timestamp":1451865600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Israeli Ministry of Science and Technology","award":["3\/9778"],"award-info":[{"award-number":["3\/9778"]}]},{"name":"The Israeli Centers of Research Excellence (I-CORE) program"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,1,4]]},"DOI":"10.1145\/2833312.2833328","type":"proceedings-article","created":{"date-parts":[[2016,2,5]],"date-time":"2016-02-05T14:54:02Z","timestamp":1454684042000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Compact routing messages in self-healing trees"],"prefix":"10.1145","author":[{"given":"Armando","family":"Casta\u00f1eda","sequence":"first","affiliation":[{"name":"Instituto de Matem\u00e1ticas, UNAM, Mexico"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Danny","family":"Dolev","sequence":"additional","affiliation":[{"name":"The Hebrew University of Jerusalem, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amitabh","family":"Trehan","sequence":"additional","affiliation":[{"name":"Queen's University Belfast, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,1,4]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","DOI":"10.1002\/0471478210","volume-title":"Distributed Computing: Fundamentals, Simulations and Advanced Topics","author":"Attiya H.","year":"2004","unstructured":"H. Attiya and J. Welch . Distributed Computing: Fundamentals, Simulations and Advanced Topics . John Wiley & Sons , 2004 . H. Attiya and J. Welch. Distributed Computing: Fundamentals, Simulations and Advanced Topics. John Wiley & Sons, 2004."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(90)90017-9"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/77600.77618"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/1759210.1759250"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.09.016"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/SASO.2009.25"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1012319418150"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484239.2484268"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2012.10.009"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-011-9543-0"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/1763424.1763430"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2000.1134"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/361179.361202"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"S. Dolev. Self-stabilization. MIT Press Cambridge MA USA 2000.   S. Dolev. Self-stabilization. MIT Press Cambridge MA USA 2000.","DOI":"10.7551\/mitpress\/6156.001.0001"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.10.006"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02139308"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281100.1281128"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02948985"},{"key":"e_1_3_2_1_19_1","first-page":"757","volume-title":"28th International Colloquium, ICALP 2001","author":"Fraigniaud P.","year":"2001","unstructured":"P. Fraigniaud and C. Gavoille . Routing in trees. In Automata, Languages and Programming , 28th International Colloquium, ICALP 2001 , Proceedings , pages 757 -- 772 , 2001 . P. Fraigniaud and C. Gavoille. Routing in trees. In Automata, Languages and Programming, 28th International Colloquium, ICALP 2001, Proceedings, pages 757--772, 2001."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"P.\n      Fraigniaud\n     and \n      C.\n      Gavoille\n  . \n  A space lower bound for routing in trees\n  . In H. Alt and A. Ferreira editors STACS \n  2002 Proceedings volume \n  2285\n   of \n  Lecture Notes in Computer Science pages \n  65\n  --\n  75\n  . \n  Springer 2002.   P. Fraigniaud and C. Gavoille. A space lower bound for routing in trees. In H. Alt and A. Ferreira editors STACS 2002 Proceedings volume 2285 of Lecture Notes in Computer Science pages 65--75. Springer 2002.","DOI":"10.1007\/3-540-45841-7_4"},{"key":"e_1_3_2_1_21_1","volume-title":"Proceedings of the 20th Annual Canadian Conference on Computational Geometry","author":"Fraser M.","year":"2008","unstructured":"M. Fraser , E. Kranakis , and J. Urrutia . Memory requirements for local geometric routing and traversal in digraphs . In Proceedings of the 20th Annual Canadian Conference on Computational Geometry , Montr\u00e9al, Canada, August 13--15 , 2008 , 2008. M. Fraser, E. Kranakis, and J. Urrutia. Memory requirements for local geometric routing and traversal in digraphs. In Proceedings of the 20th Annual Canadian Conference on Computational Geometry, Montr\u00e9al, Canada, August 13--15, 2008, 2008."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.1997.605267"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dss.2006.06.011"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1400751.1400779"},{"key":"e_1_3_2_1_25_1","first-page":"1","volume-title":"Distributed Computing","author":"Hayes T. P.","year":"2012","unstructured":"T. P. Hayes , J. Saia , and A. Trehan . The forgiving graph: a distributed data structure for low stretch under adversarial attack . Distributed Computing , pages 1 -- 18 , 2012 . T. P. Hayes, J. Saia, and A. Trehan. The forgiving graph: a distributed data structure for low stretch under adversarial attack. Distributed Computing, pages 1--18, 2012."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.700896"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-007-0035-z"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993806.1993866"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2007.08.004"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-003-1106-6"},{"key":"e_1_3_2_1_31_1","volume-title":"Proceedings of the 11th Canadian Conference on Computational Geometry, UBC","author":"Kranakis E.","year":"1999","unstructured":"E. Kranakis , H. Singh , and J. Urrutia . Compass routing on geometric networks . In Proceedings of the 11th Canadian Conference on Computational Geometry, UBC , Vancouver, British Columbia, Canada, August 15--18 , 1999 , 1999. E. Kranakis, H. Singh, and J. Urrutia. Compass routing on geometric networks. In Proceedings of the 11th Canadian Conference on Computational Geometry, UBC, Vancouver, British Columbia, Canada, August 15--18, 1999, 1999."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806760"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/11558989_2"},{"key":"e_1_3_2_1_34_1","series-title":"Lecture Notes in Computer Science","first-page":"846","volume-title":"Distributed Computing","author":"Kutten S.","year":"1999","unstructured":"S. Kutten and A. Porat . Maintenance of a spanning tree in dynamic networks . In P. Jayanti, editor, Distributed Computing , volume 1693 of Lecture Notes in Computer Science , pages 846 -- 846 . Springer Berlin \/ Heidelberg , 1999 . S. Kutten and A. Porat. Maintenance of a spanning tree in dynamic networks. In P. Jayanti, editor, Distributed Computing, volume 1693 of Lecture Notes in Computer Science, pages 846--846. Springer Berlin \/ Heidelberg, 1999."},{"key":"e_1_3_2_1_35_1","volume-title":"Distributed Algorithms","author":"Lynch N.","year":"1996","unstructured":"N. Lynch . Distributed Algorithms . Morgan Kaufmann Publishers , San Mateo, CA , 1996 . N. Lynch. Distributed Algorithms. Morgan Kaufmann Publishers, San Mateo, CA, 1996."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.5555\/839292.843031"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2014.78"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-013-0192-1"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62217"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/846057.864027"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"crossref","unstructured":"G.\n      Saad\n     and \n      J.\n      Saia\n  . \n  Self-healing computation\n  . In P. Felber and V. K. Garg editors Stabilization Safety and Security of Distributed Systems SSS \n  2014 Proceedings volume \n  8756\n   of \n  Lecture Notes in Computer Science pages \n  195\n  --\n  210\n  . \n  Springer 2014.  G. Saad and J. Saia. Self-healing computation. In P. Felber and V. K. Garg editors Stabilization Safety and Security of Distributed Systems SSS 2014 Proceedings volume 8756 of Lecture Notes in Computer Science pages 195--210. Springer 2014.","DOI":"10.1007\/978-3-319-11764-5_14"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2008.4536326"},{"key":"e_1_3_2_1_43_1","volume-title":"Labelling and implicit routing in networks. The computer journal, 28(1):5--8","author":"Santoro N.","year":"1985","unstructured":"N. Santoro and R. Khatib . Labelling and implicit routing in networks. The computer journal, 28(1):5--8 , 1985 . N. Santoro and R. Khatib. Labelling and implicit routing in networks. The computer journal, 28(1):5--8, 1985."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/378580.378581"},{"key":"e_1_3_2_1_45_1","volume-title":"Algorithms for self-healing networks. Dissertation","author":"Trehan A.","year":"2010","unstructured":"A. Trehan . Algorithms for self-healing networks. Dissertation , University of New Mexico , 2010 . A. Trehan. Algorithms for self-healing networks. Dissertation, University of New Mexico, 2010."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.1997.605255"},{"key":"e_1_3_2_1_47_1","first-page":"125","volume-title":"1st International Colloquium, SIROCCO 1994","author":"Vounckx J.","year":"1994","unstructured":"J. Vounckx , G. Deconinck , R. Lauwereins , and J. A. Peperstraete . Fault-tolerant compact routing based on reduced structural information in wormhole-switching based networks. In Structural Information and Communication Complexity , 1st International Colloquium, SIROCCO 1994 , Proceedings , pages 125 -- 148 , 1994 . J. Vounckx, G. Deconinck, R. Lauwereins, and J. A. Peperstraete. Fault-tolerant compact routing based on reduced structural information in wormhole-switching based networks. In Structural Information and Communication Complexity, 1st International Colloquium, SIROCCO 1994, Proceedings, pages 125--148, 1994."},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.759330"}],"event":{"name":"ICDCN '16: 17th International Conference on Distributed Computing and Networking","acronym":"ICDCN '16","location":"Singapore Singapore"},"container-title":["Proceedings of the 17th International Conference on Distributed Computing and Networking"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2833312.2833328","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2833312.2833328","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:48:49Z","timestamp":1750225729000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2833312.2833328"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1,4]]},"references-count":48,"alternative-id":["10.1145\/2833312.2833328","10.1145\/2833312"],"URL":"https:\/\/doi.org\/10.1145\/2833312.2833328","relation":{},"subject":[],"published":{"date-parts":[[2016,1,4]]},"assertion":[{"value":"2016-01-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}