{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,6]],"date-time":"2023-01-06T20:27:59Z","timestamp":1673036879374},"reference-count":21,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1993,12,1]],"date-time":"1993-12-01T00:00:00Z","timestamp":754704000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computer Networks and ISDN Systems"],"published-print":{"date-parts":[[1993,12]]},"DOI":"10.1016\/0169-7552(93)90079-j","type":"journal-article","created":{"date-parts":[[2003,8,7]],"date-time":"2003-08-07T23:11:16Z","timestamp":1060297876000},"page":"403-421","source":"Crossref","is-referenced-by-count":13,"title":["Prefix routing schemes in dynamic networks"],"prefix":"10.1016","volume":"26","author":[{"given":"Erwin M.","family":"Bakker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"van Leeuwen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Richard B.","family":"Tan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0169-7552(93)90079-J_BIB1","series-title":"Proc. 28th Annual IEEE Symposium on Foundations of Computer Science","first-page":"347","article-title":"Local management of a global resource in a communication network","author":"Afek","year":"1987"},{"key":"10.1016\/0169-7552(93)90079-J_BIB2","series-title":"Proc. 30th Annual IEEE Symposium on Foundations of Computer Science","first-page":"370","article-title":"Upper and lower bounds for routing schemes in dynamic networks","author":"Afek","year":"1989"},{"issue":"2","key":"10.1016\/0169-7552(93)90079-J_BIB3","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1137\/0405013","article-title":"Routing with polynomial communication-space trade-off","volume":"5","author":"Awerbuch","year":"1992","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/0169-7552(93)90079-J_BIB4","series-title":"Proc. 21st Annual ACM Symposium on Theory of Computing","first-page":"479","article-title":"Compact distributed data structures for adaptive routing","author":"Awerbuch","year":"1989"},{"key":"10.1016\/0169-7552(93)90079-J_BIB5","series-title":"Proc. 31st Annual IEEE Symposium on Foundations of Computer Science","first-page":"492","article-title":"Communication-optimal maintenance of replicated information","author":"Awerbuch","year":"1990"},{"issue":"2","key":"10.1016\/0169-7552(93)90079-J_BIB6","first-page":"45","article-title":"Linear interval routing","volume":"2","author":"Bakker","year":"1991","journal-title":"Algorithms Rev."},{"key":"10.1016\/0169-7552(93)90079-J_BIB7","series-title":"Theory of Codes","author":"Berstel","year":"1985"},{"key":"10.1016\/0169-7552(93)90079-J_BIB8","first-page":"433","article-title":"Planar permutation graphs","author":"Chartrand","year":"1967","journal-title":"Ann. Inst. H. Poincar\u00e9, Section B3"},{"key":"10.1016\/0169-7552(93)90079-J_BIB9","article-title":"PARIS: an approach to private integrated networks","volume":"1","author":"Cidon","year":"1988","journal-title":"J. Analog and Digital Cabled Systems"},{"key":"10.1016\/0169-7552(93)90079-J_BIB10","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1109\/65.3234","article-title":"Addressing, bridging, and source routing","volume":"2","author":"Dixon","year":"1988","journal-title":"IEEE Network Mag."},{"key":"10.1016\/0169-7552(93)90079-J_BIB11","series-title":"Proc. 27th Annual IEEE Symposition on Foundations of Computer Science","first-page":"428","article-title":"Separator-based strategies for efficient message routing","author":"Frederickson","year":"1986"},{"key":"10.1016\/0169-7552(93)90079-J_BIB12","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/BF01762113","article-title":"Designing networks with compact routing tables","volume":"3","author":"Frederickson","year":"1988","journal-title":"Algorithmica"},{"key":"10.1016\/0169-7552(93)90079-J_BIB13","first-page":"10","article-title":"Source routing bridge implementation","volume":"2","author":"Hammer","year":"1988","journal-title":"IEEE Network Mag."},{"key":"10.1016\/0169-7552(93)90079-J_BIB14","series-title":"The Book of L","first-page":"259","article-title":"Computer networks with compact routing tables","author":"van Leeuwen","year":"1986"},{"issue":"4","key":"10.1016\/0169-7552(93)90079-J_BIB15","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1093\/comjnl\/30.4.298","article-title":"Interval routing","volume":"30","author":"van Leeuwen","year":"1987","journal-title":"Comput. J."},{"key":"10.1016\/0169-7552(93)90079-J_BIB16","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1002\/net.3230180402","article-title":"Efficient storage of nonadaptive routing tables","volume":"18","author":"Manber","year":"1988","journal-title":"Networks"},{"key":"10.1016\/0169-7552(93)90079-J_BIB17","article-title":"A dial-up network of UNIX systems","volume":"Vol. 2","author":"Nowitz","year":"1983"},{"key":"10.1016\/0169-7552(93)90079-J_BIB18_1","series-title":"Proc. 20th Annual ACM Symposium on Theory of Computing","first-page":"43","article-title":"A tradeoff between size and efficiency for routing tables","author":"Peleg","year":"1988"},{"issue":"3","key":"10.1016\/0169-7552(93)90079-J_BIB18_2","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1145\/65950.65953","volume":"36","year":"1989","journal-title":"J. ACM"},{"key":"10.1016\/0169-7552(93)90079-J_BIB19","doi-asserted-by":"crossref","first-page":"932","DOI":"10.1145\/6617.6618","article-title":"Notable computer networks","volume":"29","author":"Quaterman","year":"1986","journal-title":"Comm. ACM"},{"issue":"1","key":"10.1016\/0169-7552(93)90079-J_BIB20","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1093\/comjnl\/28.1.5","article-title":"Labeling and implicit routing in networks","volume":"28","author":"Santoro","year":"1985","journal-title":"Comput. J."}],"container-title":["Computer Networks and ISDN Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016975529390079J?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016975529390079J?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T07:28:07Z","timestamp":1552634887000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016975529390079J"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,12]]},"references-count":21,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1993,12]]}},"alternative-id":["016975529390079J"],"URL":"https:\/\/doi.org\/10.1016\/0169-7552(93)90079-j","relation":{},"ISSN":["0169-7552"],"issn-type":[{"value":"0169-7552","type":"print"}],"subject":[],"published":{"date-parts":[[1993,12]]}}}