{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T22:10:03Z","timestamp":1736633403148,"version":"3.32.0"},"reference-count":17,"publisher":"Elsevier BV","issue":"11-12","license":[{"start":{"date-parts":[[2006,12,1]],"date-time":"2006-12-01T00:00:00Z","timestamp":1164931200000},"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":["Parallel Computing"],"published-print":{"date-parts":[[2006,12]]},"DOI":"10.1016\/j.parco.2006.09.004","type":"journal-article","created":{"date-parts":[[2006,11,4]],"date-time":"2006-11-04T12:14:12Z","timestamp":1162642452000},"page":"886-901","source":"Crossref","is-referenced-by-count":11,"title":["Characterization of spatial fault patterns in interconnection networks"],"prefix":"10.1016","volume":"32","author":[{"given":"M. Hoseiny","family":"Farahabady","sequence":"first","affiliation":[]},{"given":"F.","family":"Safaei","sequence":"additional","affiliation":[]},{"given":"A.","family":"Khonsari","sequence":"additional","affiliation":[]},{"given":"M.","family":"Fathy","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.parco.2006.09.004_bib1","doi-asserted-by":"crossref","unstructured":"D. Karimou, J. Myoupo, A fault-tolerant permutation routing algorithm in mobile ad-hoc networks, in: Lecture Notes on Computer Science 3421, 2005, pp. 107\u2013115.","DOI":"10.1007\/978-3-540-31957-3_14"},{"key":"10.1016\/j.parco.2006.09.004_bib2","doi-asserted-by":"crossref","unstructured":"G. Gupta, M. Younis, Fault-tolerant clustering of wireless sensor networks, in: IEEE Conference on Wireless Communications and Networking, 2003, pp. 1579\u20131584.","DOI":"10.1109\/WCNC.2003.1200622"},{"key":"10.1016\/j.parco.2006.09.004_bib3","doi-asserted-by":"crossref","unstructured":"H. Sarbazi-Azad, A. Khonsari, A class of ball-and-bin problems and its application to mesh networks, in: ICECS, 2003, pp. 1038\u20131041.","DOI":"10.1109\/ICECS.2003.1301687"},{"year":"2003","series-title":"Interconnection Networks: an Engineering Approach","author":"Duato","key":"10.1016\/j.parco.2006.09.004_bib4"},{"key":"10.1016\/j.parco.2006.09.004_bib5","unstructured":"J.N. Al-Karaki, Performance analysis of repairable cluster of workstations, in: IPDPS, 2004."},{"key":"10.1016\/j.parco.2006.09.004_bib6","doi-asserted-by":"crossref","unstructured":"J. Wu, Z. Jiang, On constructing the minimum orthogonal convex polygon in 2-D faulty meshes, in: IPDPS, 2004.","DOI":"10.1109\/TR.2005.853039"},{"key":"10.1016\/j.parco.2006.09.004_bib7","unstructured":"J.M. Monta\u00f1ana, A transition-based zfault-tolerant routing methodology for infiniband networks, in: IPDPS, 2004."},{"year":"1958","series-title":"An Introduction to Combinatorial Analysis","author":"Riordan","key":"10.1016\/j.parco.2006.09.004_bib8"},{"year":"2002","series-title":"Discrete Mathematics and its Applications","author":"Rosen","key":"10.1016\/j.parco.2006.09.004_bib9"},{"key":"10.1016\/j.parco.2006.09.004_bib10","doi-asserted-by":"crossref","unstructured":"M.E. G\u00f3mez, A new adaptive fault-tolerant routing methodology for direct networks, in: HiPC, 2004, pp. 462\u2013473.","DOI":"10.1007\/978-3-540-30474-6_49"},{"key":"10.1016\/j.parco.2006.09.004_bib11","doi-asserted-by":"crossref","unstructured":"M. G\u00f3mez, An effective fault-tolerant routing methodology for direct networks, in: ICPP, 2004, pp. 222\u2013231.","DOI":"10.1109\/ICPP.2004.1327925"},{"issue":"8","key":"10.1016\/j.parco.2006.09.004_bib12","doi-asserted-by":"crossref","first-page":"1025","DOI":"10.1109\/TC.2005.134","article-title":"Performance evaluation and design trade-offs for network-on-chip interconnect architectures","volume":"54","author":"Pande","year":"2005","journal-title":"IEEE Transactions on Computers"},{"issue":"7","key":"10.1016\/j.parco.2006.09.004_bib13","doi-asserted-by":"crossref","first-page":"848","DOI":"10.1109\/12.392844","article-title":"Fault-tolerant wormhole routing algorithms for mesh networks","volume":"44","author":"Boppana","year":"1995","journal-title":"IEEE Transactions on Computers"},{"key":"10.1016\/j.parco.2006.09.004_bib14","unstructured":"S. Chakravorty, L.V. Kal\u00e9, A fault tolerant protocol for massively parallel systems, in: IPDPS, 2004."},{"year":"1901","series-title":"Choice and Chance","author":"Whiteworth","key":"10.1016\/j.parco.2006.09.004_bib15"},{"year":"2004","series-title":"Principles and Practices of Interconnection Networks","author":"Dally","key":"10.1016\/j.parco.2006.09.004_bib16"},{"issue":"3","key":"10.1016\/j.parco.2006.09.004_bib17","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1109\/71.841738","article-title":"Software-based rerouting for fault-tolerant pipelined communication","volume":"11","author":"Suh","year":"2000","journal-title":"IEEE Transactions On Parallel and Distributed Systems"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819106000676?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819106000676?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T21:30:15Z","timestamp":1736631015000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167819106000676"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,12]]},"references-count":17,"journal-issue":{"issue":"11-12","published-print":{"date-parts":[[2006,12]]}},"alternative-id":["S0167819106000676"],"URL":"https:\/\/doi.org\/10.1016\/j.parco.2006.09.004","relation":{},"ISSN":["0167-8191"],"issn-type":[{"type":"print","value":"0167-8191"}],"subject":[],"published":{"date-parts":[[2006,12]]}}}