{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T12:11:46Z","timestamp":1725624706896},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642246494"},{"type":"electronic","value":"9783642246500"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-24650-0_6","type":"book-chapter","created":{"date-parts":[[2011,10,22]],"date-time":"2011-10-22T14:08:55Z","timestamp":1319292535000},"page":"54-65","source":"Crossref","is-referenced-by-count":2,"title":["Set-to-Set Disjoint-Paths Routing in Recursive Dual-Net"],"prefix":"10.1007","author":[{"given":"Yamin","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shietung","family":"Peng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wanming","family":"Chu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2\/3","key":"6_CR1","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1147\/rd.492.0265","volume":"49","author":"N.R. Adiga","year":"2005","unstructured":"Adiga, N.R., Blumrich, M.A., Chen, D., Coteus, P., Gara, A., Giampapa, M.E., Heidelberger, P., Singh, S., Steinmacher-Burow, B.D., Takken, T., Tsao, M., Vranas, P.: Blue gene\/l torus interconnection network. IBM Journal of Research and Development\u00a049(2\/3), 265\u2013276 (2005)","journal-title":"IBM Journal of Research and Development"},{"issue":"4","key":"6_CR2","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1109\/12.21148","volume":"38","author":"S.B. Akers","year":"1989","unstructured":"Akers, S.B., Krishnamurthy, B.: A group-theoretic model for symmetric interconnection networks. IEEE Transactions on Computers\u00a038(4), 555\u2013566 (1989)","journal-title":"IEEE Transactions on Computers"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Beckman, P.: Looking toward exascale computing. In: Proceedings of the 2008 International Conference on Parallel and Distributed Computing, Applications and Technologies (December 2008) keynote speaker","DOI":"10.1109\/PDCAT.2008.88"},{"key":"6_CR4","first-page":"8","volume-title":"Proceedings of the International Conference on Parallel and Distributed Computing, Applications and Technologies","author":"A. Bossard","year":"2009","unstructured":"Bossard, A., Kaneko, K., Peng, S.: Node-to-set disjoint-paths routing in metacube. In: Proceedings of the International Conference on Parallel and Distributed Computing, Applications and Technologies, pp. 8\u201311. IEEE Computer Society Press, Hiroshima (2009)"},{"issue":"5","key":"6_CR5","doi-asserted-by":"publisher","first-page":"622","DOI":"10.1109\/71.159045","volume":"3","author":"P.F. Corbett","year":"1992","unstructured":"Corbett, P.F.: Rotator graphs: An efficient topology for point-to-point multiprocessor networks. IEEE Transactions on Parallel and Distributed Systems\u00a03(5), 622\u2013626 (1992)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"1","key":"6_CR6","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1109\/71.262586","volume":"5","author":"K. Day","year":"1994","unstructured":"Day, K., Tripathi, A.: A comparative study of topological properties of hypercubes and star graphs. IEEE Transactions on Parallel and Distributed Systems\u00a05(1), 31\u201338 (1994)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"6_CR7","volume-title":"Interconnection Networks: An Engineering Approach","author":"J. Duato","year":"1997","unstructured":"Duato, J., Yalamanchili, S., Ni, L.: Interconnection Networks: An Engineering Approach. IEEE Computer Society Press, Los Alamitos (1997)"},{"issue":"4","key":"6_CR8","first-page":"282","volume":"E79-D","author":"Q.P. Gu","year":"1996","unstructured":"Gu, Q.P., Peng, S.: Set-to-set fault tolerant routing in star graphs. IEICE Trans. on Information and Systems\u00a0E79-D(4), 282\u2013289 (1996)","journal-title":"IEICE Trans. on Information and Systems"},{"issue":"4","key":"6_CR9","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/S0020-0190(97)00059-8","volume":"62","author":"Q.P. Gu","year":"1997","unstructured":"Gu, Q.P., Peng, S.: Node-to-set disjoint paths problem in star graphs. Information Processing Letters\u00a062(4), 201\u2013207 (1997)","journal-title":"Information Processing Letters"},{"issue":"9","key":"6_CR10","doi-asserted-by":"publisher","first-page":"1245","DOI":"10.1016\/S0167-8191(98)00050-7","volume":"24","author":"Q.P. Gu","year":"1998","unstructured":"Gu, Q.P., Peng, S.: Node-to-set and set-to-set cluster fault tolerant routing in hypercubes. Parallel Computing\u00a024(9), 1245\u20131261 (1998)","journal-title":"Parallel Computing"},{"issue":"3","key":"6_CR11","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/0020-0190(94)90092-2","volume":"49","author":"Z. Jovanovic","year":"1994","unstructured":"Jovanovic, Z., Misic, J.V.: Fault tolerance of the star graph interconnection network. Information Processing Letters\u00a049(3), 145\u2013150 (1994)","journal-title":"Information Processing Letters"},{"issue":"9","key":"6_CR12","first-page":"1628","volume":"E86-D","author":"K. Kaneko","year":"2003","unstructured":"Kaneko, K., Suzuki, Y.: Node-to-set disjoint paths problem in pancake graphs. IEICE Transactions on Information and Systems\u00a0E86-D(9), 1628\u20131633 (2003)","journal-title":"IEICE Transactions on Information and Systems"},{"issue":"3","key":"6_CR13","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0020-0190(93)90060-M","volume":"46","author":"S. Latifi","year":"1993","unstructured":"Latifi, S.: On the fault-diameter of the star graph. Information Processing Letters\u00a046(3), 143\u2013150 (1993)","journal-title":"Information Processing Letters"},{"key":"6_CR14","unstructured":"Li, Y., Peng, S.: Dual-cubes: a new interconnection network for high-performance computer clusters. In: Proceedings of the 2000 International Computer Symposium, Workshop on Computer Architecture, ChiaYi, Taiwan, pp. 51\u201357 (December 2000)"},{"issue":"3","key":"6_CR15","first-page":"29","volume":"24","author":"Y. Li","year":"2002","unstructured":"Li, Y., Peng, S., Chu, W.: Metacube - a new interconnection network for large scale parallel systems. Australian Computer Science Communications\u00a024(3), 29\u201336 (2002)","journal-title":"Australian Computer Science Communications"},{"key":"6_CR16","first-page":"48","volume-title":"Proceedings of the International Conference on Parallel and Distributed Computing, Applications and Technologies","author":"Y. Li","year":"2009","unstructured":"Li, Y., Peng, S., Chu, W.: Disjoint-paths and fault-tolerant routing on recursive dual-net. In: Proceedings of the International Conference on Parallel and Distributed Computing, Applications and Technologies, pp. 48\u201356. IEEE Computer Society Press, Hiroshima (2009)"},{"key":"6_CR17","doi-asserted-by":"publisher","first-page":"931","DOI":"10.1080\/02533839.2009.9671580","volume":"32","author":"Y. Li","year":"2009","unstructured":"Li, Y., Peng, S., Chu, W.: Recursive dual-net: A new versatile network for supercomputers of the next generation. Journal of Chinese Institute of Engineer\u00a032, 931\u2013938 (2009)","journal-title":"Journal of Chinese Institute of Engineer"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"Li, Y., Peng, S., Chu, W.: Node-to-set disjoint-paths routing in recursive dual-net. In: Proceedings of the First International Conference on Networking and Computing, Higashi Hiroshima, Japan, pp. 9\u201314 (November 2010)","DOI":"10.1109\/IC-NC.2010.11"},{"issue":"3","key":"6_CR19","first-page":"610","volume":"E86-D","author":"Y. Suzuki","year":"2003","unstructured":"Suzuki, Y., Kaneko, K.: An algorithm for node-disjoint paths in pancake graphs. IEICE Transactions on Information and Systems\u00a0E86-D(3), 610\u2013615 (2003)","journal-title":"IEICE Transactions on Information and Systems"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24650-0_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T21:14:26Z","timestamp":1555190066000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24650-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642246494","9783642246500"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24650-0_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}