{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,6]],"date-time":"2023-01-06T21:13:03Z","timestamp":1673039583961},"reference-count":5,"publisher":"World Scientific Pub Co Pte Lt","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Inter. Net."],"published-print":{"date-parts":[[2007,9]]},"abstract":"<jats:p> Given a rooted n-node tree with arbitrary positive edge weights, and arbitrarily assigned node names, what is the minimum amount of space that a single-source compact routing algorithm could use in its largest routing table while achieving stretch 3? We show that the space requirements is [Formula: see text] bits in a port model that is more general than the fixed-port model, and note that this result also applies for all-pairs routing in trees. <\/jats:p>","DOI":"10.1142\/s0219265907002004","type":"journal-article","created":{"date-parts":[[2007,11,5]],"date-time":"2007-11-05T10:38:21Z","timestamp":1194259101000},"page":"229-251","source":"Crossref","is-referenced-by-count":1,"title":["A SPACE LOWER BOUND FOR NAME-INDEPENDENT COMPACT ROUTING IN TREES"],"prefix":"10.1142","volume":"08","author":[{"given":"KOFI A.","family":"LAING","sequence":"first","affiliation":[{"name":"Computer Science Department, Tufts University, Medford, MA 02155, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"RAJMOHAN","family":"RAJARAMAN","sequence":"additional","affiliation":[{"name":"College of Computer and Information Science, Northeastern University, Boston, MA 02115, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"reference":[{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1137\/0405013"},{"key":"rf13","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2007.02.015"},{"key":"rf16","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480197328631"},{"key":"rf18","unstructured":"Paul\u00a0Erd\u00f6s, Theory of Graphs and Its Applications (Publ. House Czechoslovak Acad. Sci., Prague, 1964)\u00a0pp. 29\u201336."},{"key":"rf20","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2606-0"}],"container-title":["Journal of Interconnection Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0219265907002004","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T03:32:31Z","timestamp":1565148751000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0219265907002004"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,9]]},"references-count":5,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[2007,9]]}},"alternative-id":["10.1142\/S0219265907002004"],"URL":"https:\/\/doi.org\/10.1142\/s0219265907002004","relation":{},"ISSN":["0219-2659","1793-6713"],"issn-type":[{"value":"0219-2659","type":"print"},{"value":"1793-6713","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,9]]}}}