{"id":"https://openalex.org/W1971827790","doi":"https://doi.org/10.1142/s0219265903000970","title":"Fault-Tolerant Routing in Wormhole Meshes","display_name":"Fault-Tolerant Routing in Wormhole Meshes","publication_year":2003,"publication_date":"2003-12-01","ids":{"openalex":"https://openalex.org/W1971827790","doi":"https://doi.org/10.1142/s0219265903000970","mag":"1971827790"},"language":"en","primary_location":{"id":"doi:10.1142/s0219265903000970","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0219265903000970","pdf_url":null,"source":{"id":"https://openalex.org/S63112013","display_name":"Journal of Interconnection Networks","issn_l":"0219-2659","issn":["0219-2659","1793-6713"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Interconnection Networks","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5087200092","display_name":"Ming\u2010Jer Tsai","orcid":"https://orcid.org/0000-0001-6287-908X"},"institutions":[{"id":"https://openalex.org/I25846049","display_name":"National Tsing Hua University","ror":"https://ror.org/00zdnkx70","country_code":"TW","type":"education","lineage":["https://openalex.org/I25846049"]}],"countries":["TW"],"is_corresponding":true,"raw_author_name":"Ming-Jer Tsai","raw_affiliation_strings":["Department of Computer Science, National Tsing Hua University, Hsing Chu, Taiwan, ROC"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, National Tsing Hua University, Hsing Chu, Taiwan, ROC","institution_ids":["https://openalex.org/I25846049"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5087200092"],"corresponding_institution_ids":["https://openalex.org/I25846049"],"apc_list":null,"apc_paid":null,"fwci":1.4165,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.85471353,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":97},"biblio":{"volume":"04","issue":"04","first_page":"463","last_page":"495"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9909999966621399,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9894999861717224,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/interconnection","display_name":"Interconnection","score":0.793068528175354},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7534390091896057},{"id":"https://openalex.org/keywords/wormhole","display_name":"Wormhole","score":0.7039240598678589},{"id":"https://openalex.org/keywords/deadlock","display_name":"Deadlock","score":0.6588028073310852},{"id":"https://openalex.org/keywords/fault-tolerance","display_name":"Fault tolerance","score":0.6484172344207764},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.6162592172622681},{"id":"https://openalex.org/keywords/polygon-mesh","display_name":"Polygon mesh","score":0.615688681602478},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5926502346992493},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5599819421768188},{"id":"https://openalex.org/keywords/routing-algorithm","display_name":"Routing algorithm","score":0.5569291114807129},{"id":"https://openalex.org/keywords/adaptive-routing","display_name":"Adaptive routing","score":0.4823998212814331},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.4658088982105255},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.44140517711639404},{"id":"https://openalex.org/keywords/distance-vector-routing-protocol","display_name":"Distance-vector routing protocol","score":0.43501392006874084},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.43219444155693054},{"id":"https://openalex.org/keywords/destination-sequenced-distance-vector-routing","display_name":"Destination-Sequenced Distance Vector routing","score":0.4149046540260315},{"id":"https://openalex.org/keywords/dynamic-source-routing","display_name":"Dynamic Source Routing","score":0.3049796521663666},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.26688146591186523},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.11413004994392395}],"concepts":[{"id":"https://openalex.org/C123745756","wikidata":"https://www.wikidata.org/wiki/Q1665949","display_name":"Interconnection","level":2,"score":0.793068528175354},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7534390091896057},{"id":"https://openalex.org/C29013271","wikidata":"https://www.wikidata.org/wiki/Q7544","display_name":"Wormhole","level":2,"score":0.7039240598678589},{"id":"https://openalex.org/C159023740","wikidata":"https://www.wikidata.org/wiki/Q623276","display_name":"Deadlock","level":2,"score":0.6588028073310852},{"id":"https://openalex.org/C63540848","wikidata":"https://www.wikidata.org/wiki/Q3140932","display_name":"Fault tolerance","level":2,"score":0.6484172344207764},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.6162592172622681},{"id":"https://openalex.org/C31487907","wikidata":"https://www.wikidata.org/wiki/Q1154597","display_name":"Polygon mesh","level":2,"score":0.615688681602478},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5926502346992493},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5599819421768188},{"id":"https://openalex.org/C2984173633","wikidata":"https://www.wikidata.org/wiki/Q22725","display_name":"Routing algorithm","level":4,"score":0.5569291114807129},{"id":"https://openalex.org/C24856439","wikidata":"https://www.wikidata.org/wiki/Q352483","display_name":"Adaptive routing","level":5,"score":0.4823998212814331},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.4658088982105255},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.44140517711639404},{"id":"https://openalex.org/C202385902","wikidata":"https://www.wikidata.org/wiki/Q1229441","display_name":"Distance-vector routing protocol","level":5,"score":0.43501392006874084},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.43219444155693054},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.4149046540260315},{"id":"https://openalex.org/C9659607","wikidata":"https://www.wikidata.org/wiki/Q1268903","display_name":"Dynamic Source Routing","level":4,"score":0.3049796521663666},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.26688146591186523},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11413004994392395},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0219265903000970","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0219265903000970","pdf_url":null,"source":{"id":"https://openalex.org/S63112013","display_name":"Journal of Interconnection Networks","issn_l":"0219-2659","issn":["0219-2659","1793-6713"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Interconnection Networks","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W2008041840","https://openalex.org/W2054951192","https://openalex.org/W2091424727","https://openalex.org/W2114053923","https://openalex.org/W2123512296","https://openalex.org/W2124552466","https://openalex.org/W2129307244","https://openalex.org/W2129784825","https://openalex.org/W2145278435","https://openalex.org/W2145874778","https://openalex.org/W2147295633","https://openalex.org/W2152138974","https://openalex.org/W2154323564","https://openalex.org/W2157664430","https://openalex.org/W2160083733"],"related_works":["https://openalex.org/W2121563512","https://openalex.org/W2145485627","https://openalex.org/W2081911632","https://openalex.org/W3117346514","https://openalex.org/W2499499497","https://openalex.org/W2353387446","https://openalex.org/W2369931954","https://openalex.org/W2065107411","https://openalex.org/W2957789300","https://openalex.org/W1522654193"],"abstract_inverted_index":{"In":[0],"wormhole":[1],"meshes,":[2],"many":[3],"a":[4,8,22,27,45,82,104],"routing":[5,72],"algorithm":[6,73,77],"prevents":[7],"deadlock":[9],"by":[10,56],"enclosing":[11],"unlimited":[12],"number":[13,29],"of":[14,30,34,47,58],"faulty":[15,18,42,83,93,99],"nodes":[16],"with":[17,44],"blocks":[19,43,100],"and":[20,70],"dividing":[21],"physical":[23],"interconnection":[24,62],"network":[25],"into":[26],"fixed":[28],"virtual":[31,61],"ones;":[32],"none":[33],"them,":[35],"however,":[36],"is":[37,74,78],"able":[38],"to":[39,102],"tolerate":[40],"two":[41,60],"distance":[46],"two,":[48],"no":[49,110],"less,":[50],"in":[51],"at":[52],"least":[53],"one":[54],"dimension":[55],"use":[57],"only":[59],"networks.":[63],"To":[64],"fill":[65],"this":[66],"gap,":[67],"an":[68],"adaptive":[69],"fault-tolerant":[71],"proposed.":[75],"The":[76,106],"fully-adaptive":[79],"until":[80],"encountering":[81],"block.":[84,94],"It":[85],"then":[86],"detours":[87,97],"the":[88,92,96],"blocked":[89],"message":[90],"around":[91,98],"Arranging":[95],"attempts":[101],"prevent":[103],"deadlock.":[105],"proposed":[107],"method":[108],"has":[109],"need":[111],"for":[112],"global":[113],"information.":[114]},"counts_by_year":[{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}