{"id":"https://openalex.org/W3212441661","doi":"https://doi.org/10.1109/iecon48115.2021.9589829","title":"Fault-Tolerant Routing in Networks-on-Chip Using Self-Organizing Routing Algorithms","display_name":"Fault-Tolerant Routing in Networks-on-Chip Using Self-Organizing Routing Algorithms","publication_year":2021,"publication_date":"2021-10-13","ids":{"openalex":"https://openalex.org/W3212441661","doi":"https://doi.org/10.1109/iecon48115.2021.9589829","mag":"3212441661"},"language":"en","primary_location":{"id":"doi:10.1109/iecon48115.2021.9589829","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iecon48115.2021.9589829","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IECON 2021 \u2013 47th Annual Conference of the IEEE Industrial Electronics Society","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/A5060261504","display_name":"A. Yu. Romanov","orcid":"https://orcid.org/0000-0002-9410-9431"},"institutions":[{"id":"https://openalex.org/I118501908","display_name":"National Research University Higher School of Economics","ror":"https://ror.org/055f7t516","country_code":"RU","type":"education","lineage":["https://openalex.org/I118501908"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"Aleksandr Romanov","raw_affiliation_strings":["HSE University, Moscow, Russian Federation"],"affiliations":[{"raw_affiliation_string":"HSE University, Moscow, Russian Federation","institution_ids":["https://openalex.org/I118501908"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5080238546","display_name":"Nikolay Myachin","orcid":"https://orcid.org/0000-0002-8828-8939"},"institutions":[{"id":"https://openalex.org/I118501908","display_name":"National Research University Higher School of Economics","ror":"https://ror.org/055f7t516","country_code":"RU","type":"education","lineage":["https://openalex.org/I118501908"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Nikolay Myachin","raw_affiliation_strings":["HSE University, Moscow, Russian Federation"],"affiliations":[{"raw_affiliation_string":"HSE University, Moscow, Russian Federation","institution_ids":["https://openalex.org/I118501908"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5073393016","display_name":"Andrei M. Sukhov","orcid":"https://orcid.org/0000-0001-6948-4988"},"institutions":[{"id":"https://openalex.org/I118501908","display_name":"National Research University Higher School of Economics","ror":"https://ror.org/055f7t516","country_code":"RU","type":"education","lineage":["https://openalex.org/I118501908"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Andrei Sukhov","raw_affiliation_strings":["HSE University, Moscow, Russian Federation"],"affiliations":[{"raw_affiliation_string":"HSE University, Moscow, Russian Federation","institution_ids":["https://openalex.org/I118501908"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5060261504"],"corresponding_institution_ids":["https://openalex.org/I118501908"],"apc_list":null,"apc_paid":null,"fwci":2.2922,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.88731437,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9994000196456909,"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":0.9994000196456909,"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/T12784","display_name":"Modular Robots and Swarm Intelligence","score":0.9812999963760376,"subfield":{"id":"https://openalex.org/subfields/2210","display_name":"Mechanical Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9800000190734863,"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.7779369354248047},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6499961614608765},{"id":"https://openalex.org/keywords/routing-table","display_name":"Routing table","score":0.6457189917564392},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.5776039958000183},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.5744078159332275},{"id":"https://openalex.org/keywords/suurballes-algorithm","display_name":"Suurballe's algorithm","score":0.5151066184043884},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.49948954582214355},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.489156037569046},{"id":"https://openalex.org/keywords/destination-sequenced-distance-vector-routing","display_name":"Destination-Sequenced Distance Vector routing","score":0.48658716678619385},{"id":"https://openalex.org/keywords/multipath-routing","display_name":"Multipath routing","score":0.4643227458000183},{"id":"https://openalex.org/keywords/dynamic-source-routing","display_name":"Dynamic Source Routing","score":0.4602768123149872},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.43925023078918457},{"id":"https://openalex.org/keywords/hierarchical-routing","display_name":"Hierarchical routing","score":0.41043803095817566},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.3858826160430908},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3780823051929474},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.3543137311935425},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.11543294787406921}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7779369354248047},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6499961614608765},{"id":"https://openalex.org/C184896649","wikidata":"https://www.wikidata.org/wiki/Q290066","display_name":"Routing table","level":4,"score":0.6457189917564392},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.5776039958000183},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.5744078159332275},{"id":"https://openalex.org/C98779529","wikidata":"https://www.wikidata.org/wiki/Q7650417","display_name":"Suurballe's algorithm","level":5,"score":0.5151066184043884},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.49948954582214355},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.489156037569046},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.48658716678619385},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.4643227458000183},{"id":"https://openalex.org/C9659607","wikidata":"https://www.wikidata.org/wiki/Q1268903","display_name":"Dynamic Source Routing","level":4,"score":0.4602768123149872},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.43925023078918457},{"id":"https://openalex.org/C177818476","wikidata":"https://www.wikidata.org/wiki/Q12878103","display_name":"Hierarchical routing","level":5,"score":0.41043803095817566},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.3858826160430908},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3780823051929474},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.3543137311935425},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.11543294787406921},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iecon48115.2021.9589829","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iecon48115.2021.9589829","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IECON 2021 \u2013 47th Annual Conference of the IEEE Industrial Electronics Society","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W1581621714","https://openalex.org/W1668025881","https://openalex.org/W1994221466","https://openalex.org/W1994937951","https://openalex.org/W2045673866","https://openalex.org/W2054302810","https://openalex.org/W2057785859","https://openalex.org/W2062686943","https://openalex.org/W2070359319","https://openalex.org/W2104782624","https://openalex.org/W2113081707","https://openalex.org/W2119677480","https://openalex.org/W2121264877","https://openalex.org/W2130183852","https://openalex.org/W2132878613","https://openalex.org/W2137671609","https://openalex.org/W2143620338","https://openalex.org/W2344923855","https://openalex.org/W2700369620","https://openalex.org/W2792299293","https://openalex.org/W2817830254","https://openalex.org/W3000132418","https://openalex.org/W3047468745","https://openalex.org/W3048966825","https://openalex.org/W4210984760","https://openalex.org/W6748963831"],"related_works":["https://openalex.org/W2314157120","https://openalex.org/W2382831994","https://openalex.org/W1817053572","https://openalex.org/W2371042914","https://openalex.org/W2376231728","https://openalex.org/W3015233512","https://openalex.org/W2339073167","https://openalex.org/W2978166001","https://openalex.org/W2136320479","https://openalex.org/W3023359981"],"abstract_inverted_index":{"This":[0],"work":[1],"focuses":[2],"on":[3,134],"using":[4,141],"self-organizing":[5],"algorithms":[6,116,161],"employed":[7],"in":[8,39,92,128,173],"the":[9,40,47,89,110,124,129,135,142,153,168,174,181,186],"field":[10],"of":[11,36,42,49,57,114,121,123,131,137,176,183],"wireless":[12],"sensor":[13],"networks":[14],"to":[15,167],"networks-on-chip":[16],"(NoCs)":[17],"and":[18,26,46,54,71,81,99,112,117,126,162],"presents":[19],"a":[20,27,55,72,102,178],"method":[21,70],"for":[22,31,59,83,180],"choosing":[23],"hierarchical":[24,68],"coordinates":[25],"greedy":[28,73],"forwarding":[29,74],"algorithm":[30,37,78,144,156,170],"path":[32],"finding.":[33],"The":[34,66],"features":[35],"functioning":[38],"conditions":[41],"an":[43],"overloaded":[44],"NoC":[45,85],"presence":[48],"fault":[50,75,159],"nodes":[51,98,133,139,189],"are":[52,79],"considered,":[53],"set":[56],"rules":[58],"bypassing":[60],"blocked":[61],"network":[62,187],"sections":[63],"is":[64],"given.":[65],"proposed":[67,90,154],"coordinate":[69,118],"tolerant":[76,160],"routing":[77,115,143,155],"universal":[80],"suit":[82],"any":[84],"topology.":[86],"To":[87],"test":[88],"solutions":[91],"NoCs":[93],"with":[94],"more":[95],"than":[96],"300":[97],"mesh":[100],"topology":[101],"special":[103],"software":[104],"simulator":[105],"was":[106,146,150,163],"developed,":[107],"which":[108],"confirmed":[109],"efficiency":[111],"stability":[113],"assignment.":[119],"Dependence":[120],"lengthening":[122],"route":[125,179],"increase":[127],"number":[130,136],"unreachable":[132],"disabled":[138],"(when":[140],"proposed)":[145],"also":[147],"investigated.":[148],"It":[149],"shown":[151],"that":[152],"significantly":[157],"exceeded":[158],"only":[164],"slightly":[165],"inferior":[166],"optimal":[169],"(Dijkstra's":[171],"algorithm)":[172],"capability":[175],"constructing":[177],"movement":[182],"packets":[184],"through":[185],"under":[188],"failures":[190],"conditions.":[191]},"counts_by_year":[{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}