{"id":"https://openalex.org/W2170686986","doi":"https://doi.org/10.1109/cec.2011.5949923","title":"A new fault-tolerant and congestion-aware adaptive routing algorithm for regular Networks-on-Chip","display_name":"A new fault-tolerant and congestion-aware adaptive routing algorithm for regular Networks-on-Chip","publication_year":2011,"publication_date":"2011-06-01","ids":{"openalex":"https://openalex.org/W2170686986","doi":"https://doi.org/10.1109/cec.2011.5949923","mag":"2170686986"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2011.5949923","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2011.5949923","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE Congress of Evolutionary Computation (CEC)","raw_type":"proceedings-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/A5046385722","display_name":"Hamed S. Kia","orcid":null},"institutions":[{"id":"https://openalex.org/I57328836","display_name":"North Dakota State University","ror":"https://ror.org/05h1bnb22","country_code":"US","type":"education","lineage":["https://openalex.org/I57328836"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Hamed S. Kia","raw_affiliation_strings":["Department of Electrical and Computer Engineering, North Dakota State University, Fargo, ND, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, North Dakota State University, Fargo, ND, USA","institution_ids":["https://openalex.org/I57328836"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086561910","display_name":"Cristinel Ababei","orcid":"https://orcid.org/0000-0002-7609-5304"},"institutions":[{"id":"https://openalex.org/I57328836","display_name":"North Dakota State University","ror":"https://ror.org/05h1bnb22","country_code":"US","type":"education","lineage":["https://openalex.org/I57328836"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Cristinel Ababei","raw_affiliation_strings":["Department of Electrical and Computer Engineering, North Dakota State University, Fargo, ND, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, North Dakota State University, Fargo, ND, USA","institution_ids":["https://openalex.org/I57328836"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5046385722"],"corresponding_institution_ids":["https://openalex.org/I57328836"],"apc_list":null,"apc_paid":null,"fwci":2.1862,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.88972017,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"2465","last_page":"2472"},"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/T10179","display_name":"Supercapacitor Materials and Fabrication","score":0.9868000149726868,"subfield":{"id":"https://openalex.org/subfields/2504","display_name":"Electronic, Optical and Magnetic Materials"},"field":{"id":"https://openalex.org/fields/25","display_name":"Materials Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10502","display_name":"Advanced Memory and Neural Computing","score":0.986299991607666,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.803257942199707},{"id":"https://openalex.org/keywords/multipath-routing","display_name":"Multipath routing","score":0.5676232576370239},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.5618126392364502},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.5052450299263},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5041006803512573},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.478059321641922},{"id":"https://openalex.org/keywords/routing-table","display_name":"Routing table","score":0.4676479995250702},{"id":"https://openalex.org/keywords/network-on-a-chip","display_name":"Network on a chip","score":0.4510079622268677},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.43746837973594666},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4364003539085388},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4316585958003998},{"id":"https://openalex.org/keywords/policy-based-routing","display_name":"Policy-based routing","score":0.41399556398391724},{"id":"https://openalex.org/keywords/distance-vector-routing-protocol","display_name":"Distance-vector routing protocol","score":0.4111524224281311},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3977428674697876},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.3888636827468872},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3451501131057739},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.28444963693618774},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.11376515030860901}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.803257942199707},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.5676232576370239},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.5618126392364502},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.5052450299263},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5041006803512573},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.478059321641922},{"id":"https://openalex.org/C184896649","wikidata":"https://www.wikidata.org/wiki/Q290066","display_name":"Routing table","level":4,"score":0.4676479995250702},{"id":"https://openalex.org/C128519102","wikidata":"https://www.wikidata.org/wiki/Q339554","display_name":"Network on a chip","level":2,"score":0.4510079622268677},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.43746837973594666},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4364003539085388},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4316585958003998},{"id":"https://openalex.org/C196423136","wikidata":"https://www.wikidata.org/wiki/Q7209671","display_name":"Policy-based routing","level":5,"score":0.41399556398391724},{"id":"https://openalex.org/C202385902","wikidata":"https://www.wikidata.org/wiki/Q1229441","display_name":"Distance-vector routing protocol","level":5,"score":0.4111524224281311},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3977428674697876},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.3888636827468872},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3451501131057739},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.28444963693618774},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.11376515030860901},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/cec.2011.5949923","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2011.5949923","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE Congress of Evolutionary Computation (CEC)","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.709.350","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.709.350","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://dejazzer.com/doc/2011_cec.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W148591501","https://openalex.org/W1501077214","https://openalex.org/W1559789667","https://openalex.org/W1981991312","https://openalex.org/W2031084743","https://openalex.org/W2034998457","https://openalex.org/W2083594031","https://openalex.org/W2110069347","https://openalex.org/W2112190344","https://openalex.org/W2120052218","https://openalex.org/W2122654467","https://openalex.org/W2126432959","https://openalex.org/W2129233376","https://openalex.org/W2132523953","https://openalex.org/W2138219496","https://openalex.org/W2144709243","https://openalex.org/W2150199332","https://openalex.org/W2154689056","https://openalex.org/W2161755212","https://openalex.org/W2162162020","https://openalex.org/W2163251871","https://openalex.org/W2170980056","https://openalex.org/W2171595125","https://openalex.org/W3150832729","https://openalex.org/W4251074885","https://openalex.org/W4251385205","https://openalex.org/W6606036963","https://openalex.org/W6677731180"],"related_works":["https://openalex.org/W2349715051","https://openalex.org/W2386369498","https://openalex.org/W2352609928","https://openalex.org/W2351097701","https://openalex.org/W2162880363","https://openalex.org/W142214912","https://openalex.org/W2154440508","https://openalex.org/W3152092244","https://openalex.org/W2114321370","https://openalex.org/W1924167960"],"abstract_inverted_index":{"In":[0],"this":[1,93],"paper,":[2],"we":[3],"propose":[4],"a":[5,28,51],"new":[6],"fault-tolerant":[7],"and":[8,26,67,104,134],"congestion-aware":[9],"adaptive":[10,121,136],"routing":[11,60,122,133],"algorithm":[12,18,123],"for":[13],"Networks-on-Chip":[14],"(NoCs).":[15],"The":[16],"proposed":[17,120],"is":[19,74,89,95],"based":[20,31,96,111],"on":[21,32,97,112],"the":[22,35,58,84,98,101,119,126],"ball":[23],"and-string":[24],"model":[25],"employs":[27],"distributed":[29],"approach":[30],"partitioning":[33],"of":[34],"regular":[36],"NoC":[37],"architecture":[38],"into":[39],"regions":[40],"controlled":[41],"by":[42],"local":[43,47],"monitoring":[44,48],"units.":[45],"Each":[46],"unit":[49],"runs":[50],"shortest":[52,85],"path":[53,61,86],"computation":[54,87],"procedure":[55,88,94],"to":[56,79,130],"identify":[57],"best":[59],"so":[62],"that":[63,118],"highly":[64],"congested":[65],"routers":[66],"faulty":[68],"links":[69],"are":[70,107],"avoided":[71],"while":[72],"latency":[73],"improved.":[75],"To":[76],"dynamically":[77],"react":[78],"continuously":[80],"changing":[81],"traffic":[82],"conditions,":[83],"invoked":[90],"periodically.":[91],"Because":[92],"ball-and-string":[99],"model,":[100],"hardware":[102],"overhead":[103],"computational":[105],"times":[106],"minimal.":[108],"Experimental":[109],"results":[110],"an":[113],"actual":[114],"Verilog":[115],"implementation":[116],"demonstrate":[117],"improves":[124],"significantly":[125],"network":[127],"throughput":[128],"compared":[129],"traditional":[131],"XY":[132],"DyXY":[135],"algorithms.":[137]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}