{"id":"https://openalex.org/W3109075713","doi":"https://doi.org/10.1109/access.2020.3040323","title":"Shortest Path Search Algorithm in Optimal Two-Dimensional Circulant Networks: Implementation for Networks-on-Chip","display_name":"Shortest Path Search Algorithm in Optimal Two-Dimensional Circulant Networks: Implementation for Networks-on-Chip","publication_year":2020,"publication_date":"2020-01-01","ids":{"openalex":"https://openalex.org/W3109075713","doi":"https://doi.org/10.1109/access.2020.3040323","mag":"3109075713"},"language":"en","primary_location":{"id":"doi:10.1109/access.2020.3040323","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2020.3040323","pdf_url":"https://ieeexplore.ieee.org/ielx7/6287639/6514899/09268938.pdf","source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://ieeexplore.ieee.org/ielx7/6287639/6514899/09268938.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5023361347","display_name":"\u042d. \u0410. \u041c\u043e\u043d\u0430\u0445\u043e\u0432\u0430","orcid":"https://orcid.org/0000-0002-6814-4655"},"institutions":[{"id":"https://openalex.org/I4210110796","display_name":"Institute of Computational Mathematics and Mathematical Geophysics","ror":"https://ror.org/01z686714","country_code":"RU","type":"facility","lineage":["https://openalex.org/I1313323035","https://openalex.org/I4210110796","https://openalex.org/I4210124601"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"Emilia A. Monakhova","raw_affiliation_strings":["Institute of Computational Mathematics and Mathematical Geophysics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk, Russia"],"affiliations":[{"raw_affiliation_string":"Institute of Computational Mathematics and Mathematical Geophysics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk, Russia","institution_ids":["https://openalex.org/I4210110796"]}]},{"author_position":"middle","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":false,"raw_author_name":"Aleksandr Yu Romanov","raw_affiliation_strings":["Higher School of Economics, National Research University, Moscow, Russia"],"affiliations":[{"raw_affiliation_string":"Higher School of Economics, National Research University, Moscow, Russia","institution_ids":["https://openalex.org/I118501908"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110353086","display_name":"Evgenii V. Lezhnev","orcid":null},"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":"Evgenii V. Lezhnev","raw_affiliation_strings":["Higher School of Economics, National Research University, Moscow, Russia"],"affiliations":[{"raw_affiliation_string":"Higher School of Economics, National Research University, Moscow, Russia","institution_ids":["https://openalex.org/I118501908"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5023361347"],"corresponding_institution_ids":["https://openalex.org/I4210110796"],"apc_list":{"value":1850,"currency":"USD","value_usd":1850},"apc_paid":{"value":1850,"currency":"USD","value_usd":1850},"fwci":3.0759,"has_fulltext":true,"cited_by_count":29,"citation_normalized_percentile":{"value":0.91968013,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":97,"max":99},"biblio":{"volume":"8","issue":null,"first_page":"215010","last_page":"215019"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9998999834060669,"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.9998999834060669,"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/T10847","display_name":"Advanced Optical Network Technologies","score":0.9866999983787537,"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"}},{"id":"https://openalex.org/T10714","display_name":"Software-Defined Networks and 5G","score":0.9714999794960022,"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/shortest-path-problem","display_name":"Shortest path problem","score":0.780213475227356},{"id":"https://openalex.org/keywords/circulant-matrix","display_name":"Circulant matrix","score":0.7506353855133057},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.6791824102401733},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6564576029777527},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5660817623138428},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.5596376657485962},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.538669228553772},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5087617039680481},{"id":"https://openalex.org/keywords/floyd\u2013warshall-algorithm","display_name":"Floyd\u2013Warshall algorithm","score":0.4926667809486389},{"id":"https://openalex.org/keywords/bidirectional-search","display_name":"Bidirectional search","score":0.4749341607093811},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.4497133493423462},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.42892658710479736},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.4105284810066223},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.33864057064056396},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3303374648094177},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2948651611804962},{"id":"https://openalex.org/keywords/incremental-heuristic-search","display_name":"Incremental heuristic search","score":0.27969324588775635},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.1290062665939331},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.10008373856544495},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.09566342830657959},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.07878684997558594}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.780213475227356},{"id":"https://openalex.org/C115973184","wikidata":"https://www.wikidata.org/wiki/Q245457","display_name":"Circulant matrix","level":2,"score":0.7506353855133057},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.6791824102401733},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6564576029777527},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5660817623138428},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.5596376657485962},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.538669228553772},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5087617039680481},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.4926667809486389},{"id":"https://openalex.org/C831591","wikidata":"https://www.wikidata.org/wiki/Q59750","display_name":"Bidirectional search","level":5,"score":0.4749341607093811},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.4497133493423462},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.42892658710479736},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.4105284810066223},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.33864057064056396},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3303374648094177},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2948651611804962},{"id":"https://openalex.org/C139979381","wikidata":"https://www.wikidata.org/wiki/Q17056021","display_name":"Incremental heuristic search","level":4,"score":0.27969324588775635},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.1290062665939331},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.10008373856544495},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.09566342830657959},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.07878684997558594}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/access.2020.3040323","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2020.3040323","pdf_url":"https://ieeexplore.ieee.org/ielx7/6287639/6514899/09268938.pdf","source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:f7e449c87ba84f49a2e42e68d14f554b","is_oa":true,"landing_page_url":"https://doaj.org/article/f7e449c87ba84f49a2e42e68d14f554b","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE Access, Vol 8, Pp 215010-215019 (2020)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1109/access.2020.3040323","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2020.3040323","pdf_url":"https://ieeexplore.ieee.org/ielx7/6287639/6514899/09268938.pdf","source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321770","display_name":"Siberian Branch, Russian Academy of Sciences","ror":"https://ror.org/02frkq021"},{"id":"https://openalex.org/F4320324261","display_name":"National Research University Higher School of Economics","ror":"https://ror.org/055f7t516"},{"id":"https://openalex.org/F4320336388","display_name":"Institute of Computational Mathematics and Mathematical Geophysics, Siberian Branch, Russian Academy of Sciences","ror":null}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3109075713.pdf","grobid_xml":"https://content.openalex.org/works/W3109075713.grobid-xml"},"referenced_works_count":30,"referenced_works":["https://openalex.org/W1537778554","https://openalex.org/W1549597813","https://openalex.org/W1584491524","https://openalex.org/W1830543510","https://openalex.org/W1975339667","https://openalex.org/W2003860501","https://openalex.org/W2010388720","https://openalex.org/W2017923694","https://openalex.org/W2051905148","https://openalex.org/W2066072863","https://openalex.org/W2080283299","https://openalex.org/W2087382169","https://openalex.org/W2087770781","https://openalex.org/W2094613978","https://openalex.org/W2105099851","https://openalex.org/W2121323312","https://openalex.org/W2127169135","https://openalex.org/W2133003613","https://openalex.org/W2145786792","https://openalex.org/W2153503650","https://openalex.org/W2158988585","https://openalex.org/W2615685396","https://openalex.org/W2621010304","https://openalex.org/W2888370135","https://openalex.org/W2949131874","https://openalex.org/W2999851101","https://openalex.org/W3125602367","https://openalex.org/W6632857883","https://openalex.org/W6634928916","https://openalex.org/W6948076897"],"related_works":["https://openalex.org/W4293054712","https://openalex.org/W2198982833","https://openalex.org/W2353519994","https://openalex.org/W2360981904","https://openalex.org/W2354846196","https://openalex.org/W4321491762","https://openalex.org/W4307561361","https://openalex.org/W2368964068","https://openalex.org/W2163494787","https://openalex.org/W3109075713"],"abstract_inverted_index":{"For":[0],"a":[1,23,66,102],"family":[2],"of":[3,16,36,40,71,77],"optimal":[4,89],"two-dimensional":[5],"circulant":[6,37],"networks":[7],"with":[8,22,65,93,128],"an":[9,94,114],"analytical":[10,95],"description,":[11],"two":[12],"new":[13,98],"improved":[14],"versions":[15,76],"the":[17,33,41,45,69,72,78,81,106,124],"shortest":[18,46,84],"path":[19,47,85],"search":[20,48,86],"algorithm":[21,49,79,87,100],"constant":[24],"complexity":[25],"estimate":[26],"are":[27,55,60],"obtained.":[28],"A":[29],"simple,":[30],"based":[31],"on":[32],"geometric":[34],"model":[35],"graphs,":[38],"proof":[39],"formulas":[42],"used":[43],"for":[44,62,88,105],"is":[50,101],"given.":[51],"Pair":[52],"exchange":[53],"algorithms":[54],"presented,":[56],"and":[57,122],"their":[58],"estimates":[59],"given":[61],"networks-on-chip":[63],"(NoCs)":[64],"topology":[67],"in":[68,108],"form":[70],"considered":[73],"graphs.":[74],"New":[75],"improve":[80],"previously":[82,132],"proposed":[83,99],"generalized":[90],"Petersen":[91],"graphs":[92],"description.":[96],"The":[97],"promising":[103],"solution":[104],"use":[107],"NoCs":[109],"which":[110],"was":[111],"confirmed":[112],"by":[113],"experimental":[115],"study":[116],"while":[117],"synthesizing":[118],"NoC":[119],"communication":[120],"subsystems":[121],"comparing":[123],"consumed":[125],"hardware":[126],"resources":[127],"those":[129],"when":[130],"other":[131],"developed":[133],"routing":[134],"algorithms.":[135]},"counts_by_year":[{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":7}],"updated_date":"2026-04-02T15:55:50.835912","created_date":"2025-10-10T00:00:00"}