{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:43:30Z","timestamp":1777596210891,"version":"3.51.4"},"reference-count":11,"publisher":"World Scientific Pub Co Pte Lt","issue":"05","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2011,8]]},"abstract":"<jats:p> The recursive dual-net is a newly proposed interconnection network for massive parallel computers. The recursive dual-net is based on recursive dual-construction of a symmetric base network. A k-level dual-construction for k &gt; 0 creates a network containing (2n<jats:sub>0<\/jats:sub>)<jats:sup>2<jats:sup>k<\/jats:sup><\/jats:sup>\/2 nodes with node-degree d<jats:sub>0<\/jats:sub> + k, where n<jats:sub>0<\/jats:sub> and d<jats:sub>0<\/jats:sub> are the number of nodes and the node-degree of the base network, respectively. The recursive dual-net is node and edge symmetric and can contain huge number of nodes with small node-degree and short diameter. Disjoint-paths routing and fault-tolerant routing are fundamental and critical issues for the performance of an interconnection network. In this paper, we propose efficient algorithms for disjoint-paths and fault-tolerant routings on the recursive dual-net. <\/jats:p>","DOI":"10.1142\/s0129054111008532","type":"journal-article","created":{"date-parts":[[2011,8,10]],"date-time":"2011-08-10T05:42:53Z","timestamp":1312954973000},"page":"1001-1018","source":"Crossref","is-referenced-by-count":16,"title":["DISJOINT-PATHS AND FAULT-TOLERANT ROUTING ON RECURSIVE DUAL-NET"],"prefix":"10.1142","volume":"22","author":[{"given":"YAMIN","family":"LI","sequence":"first","affiliation":[{"name":"Department of Computer Science, Hosei University, Tokyo 184-8584, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"SHIETUNG","family":"PENG","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Hosei University, Tokyo 184-8584, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"WANMING","family":"CHU","sequence":"additional","affiliation":[{"name":"Department of Computer Hardware, University of Aizu, Aizu-Wakamatsu 965-8580, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1147\/rd.492.0265"},{"key":"rf2","volume-title":"Parallel Computation: Models and Methods","author":"Aki S. G.","year":"1997"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230240602"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1109\/71.372797"},{"key":"rf5","volume-title":"Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes","author":"Leighton F. T.","year":"1992"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1023\/B:SUPE.0000014803.83151.dc"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1080\/02533839.2009.9671580"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1145\/358645.358660"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1109\/12.2234"},{"key":"rf12","volume-title":"Interconnection Networks for Multiprocessors and Multicomputers: Theory and Practice","author":"Varma A.","year":"1994"},{"key":"rf13","doi-asserted-by":"publisher","DOI":"10.1016\/0167-739X(88)90007-6"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054111008532","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T20:33:25Z","timestamp":1565123605000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054111008532"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,8]]},"references-count":11,"journal-issue":{"issue":"05","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2011,8]]}},"alternative-id":["10.1142\/S0129054111008532"],"URL":"https:\/\/doi.org\/10.1142\/s0129054111008532","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,8]]}}}