{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,2,7]],"date-time":"2024-02-07T07:26:45Z","timestamp":1707290805589},"reference-count":6,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[2002,9,1]],"date-time":"2002-09-01T00:00:00Z","timestamp":1030838400000},"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":[[2002,9]]},"DOI":"10.1016\/s0020-0190(02)00217-x","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T17:55:05Z","timestamp":1034618105000},"page":"331-336","source":"Crossref","is-referenced-by-count":6,"title":["There is no optimal routing policy for the torus"],"prefix":"10.1016","volume":"83","author":[{"given":"Loren","family":"Schwiebert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"10","key":"10.1016\/S0020-0190(02)00217-X_BIB001","doi-asserted-by":"crossref","first-page":"1362","DOI":"10.1109\/12.35831","article-title":"An optimal shortest-path routing policy for network computers with regular mesh-connected topologies","volume":"38","author":"Badr","year":"1989","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0020-0190(02)00217-X_BIB002","series-title":"19th Annual International Symposium on Computer Architecture","first-page":"278","article-title":"The turn model for adaptive routing","author":"Glass","year":"1992"},{"key":"10.1016\/S0020-0190(02)00217-X_BIB003","volume":"1","author":"Knuth","year":"1997"},{"issue":"7","key":"10.1016\/S0020-0190(02)00217-X_BIB004","doi-asserted-by":"crossref","first-page":"862","DOI":"10.1109\/12.293267","article-title":"Comments on \u201cAn optimal shortest-path routing policy for network computers with regular mesh-connected topologies\u201d","volume":"43","author":"Weller","year":"1994","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0020-0190(02)00217-X_BIB005","first-page":"267","article-title":"An optimal routing policy for mesh-connected topologies","volume":"I","author":"Wu","year":"1996"},{"issue":"3","key":"10.1016\/S0020-0190(02)00217-X_BIB006","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1109\/24.799848","article-title":"Maximum-Shortest-Path (MSP): An optimal routing policy for mesh-connected multicomputers","volume":"48","author":"Wu","year":"1999","journal-title":"IEEE Trans. Reliability"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002001900200217X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002001900200217X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T23:54:46Z","timestamp":1556927686000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S002001900200217X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,9]]},"references-count":6,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2002,9]]}},"alternative-id":["S002001900200217X"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(02)00217-x","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2002,9]]}}}