{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T22:03:49Z","timestamp":1765231429212},"reference-count":13,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1998,3,1]],"date-time":"1998-03-01T00:00:00Z","timestamp":888710400000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[1998,3]]},"DOI":"10.1016\/s0020-0190(98)00013-1","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T13:32:24Z","timestamp":1049722344000},"page":"255-260","source":"Crossref","is-referenced-by-count":16,"title":["An optimal message routing algorithm for double-loop networks"],"prefix":"10.1016","volume":"65","author":[{"given":"D.J.","family":"Guan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(98)00013-1_BIB1","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0196-6774(90)90017-9","article-title":"Improved routing strategies with succinct tables","volume":"11","author":"Awerbuch","year":"1990","journal-title":"J. Algorithms"},{"key":"10.1016\/S0020-0190(98)00013-1_BIB2","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1006\/jpdc.1995.1002","article-title":"Distributed loop computer networks: a survey","volume":"24","author":"Bermond","year":"1995","journal-title":"J. Parallel Distrib. Comput."},{"key":"10.1016\/S0020-0190(98)00013-1_BIB3","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1016\/0196-6774(88)90030-2","article-title":"Diameters of weighted double-loop networks","volume":"9","author":"Cheng","year":"1988","journal-title":"J. Algorithms"},{"key":"10.1016\/S0020-0190(98)00013-1_BIB4","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1002\/net.3230200204","article-title":"A combinatorial problem related to distributed loop networks","volume":"20","author":"Du","year":"1990","journal-title":"Networks"},{"key":"10.1016\/S0020-0190(98)00013-1_BIB5","first-page":"187","article-title":"Fault-tolerant routing in double-loop networks","volume":"25A","author":"Escudero","year":"1988","journal-title":"Ars Combin."},{"issue":"6","key":"10.1016\/S0020-0190(98)00013-1_BIB6","doi-asserted-by":"crossref","first-page":"702","DOI":"10.1109\/TC.1987.1676963","article-title":"A discrete optimization problem in local networks and data alignment","volume":"36","author":"Fiol","year":"1987","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0020-0190(98)00013-1_BIB7","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"},{"issue":"4","key":"10.1016\/S0020-0190(98)00013-1_BIB8","doi-asserted-by":"crossref","first-page":"843","DOI":"10.1137\/0218058","article-title":"Efficient message routing in planar networks","volume":"18","author":"Frederickson","year":"1989","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10.1016\/S0020-0190(98)00013-1_BIB9","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1137\/0219011","article-title":"Space-efficient message routing in c-decomposable networks","volume":"19","author":"Frederickson","year":"1990","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(98)00013-1_BIB10","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1017\/S0269964800002072","article-title":"Reliabilities of double-loop networks","volume":"5","author":"Hwang","year":"1991","journal-title":"Probability in the Engineering and Information Sciences"},{"key":"10.1016\/S0020-0190(98)00013-1_BIB11","series-title":"The Art of Computer Programming, vol. 2: Seminumerical Algorithms","author":"Knuth","year":"1981"},{"issue":"1","key":"10.1016\/S0020-0190(98)00013-1_BIB12","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1109\/TC.1985.1676514","article-title":"Reliable loop topologies for large local computer networks","volume":"34","author":"Raghavendra","year":"1985","journal-title":"IEEE Trans. Comput."},{"issue":"4","key":"10.1016\/S0020-0190(98)00013-1_BIB13","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."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019098000131?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019098000131?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T18:27:24Z","timestamp":1556044044000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019098000131"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,3]]},"references-count":13,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1998,3]]}},"alternative-id":["S0020019098000131"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(98)00013-1","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1998,3]]}}}