{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T18:20:27Z","timestamp":1775067627265,"version":"3.50.1"},"reference-count":31,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"Basic Research Program of the National Research University Higher School of Economics"},{"name":"Institute of Computational Mathematics and Mathematical Geophysics, Siberian Branch of the Russian Academy of Sciences","award":["0315-2019-0006"],"award-info":[{"award-number":["0315-2019-0006"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.3040323","type":"journal-article","created":{"date-parts":[[2020,11,25]],"date-time":"2020-11-25T01:50:16Z","timestamp":1606269016000},"page":"215010-215019","source":"Crossref","is-referenced-by-count":26,"title":["Shortest Path Search Algorithm in Optimal Two-Dimensional Circulant Networks: Implementation for Networks-on-Chip"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6814-4655","authenticated-orcid":false,"given":"Emilia A.","family":"Monakhova","sequence":"first","affiliation":[{"name":"Institute of Computational Mathematics and Mathematical Geophysics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk, Russia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9410-9431","authenticated-orcid":false,"given":"Aleksandr Yu","family":"Romanov","sequence":"additional","affiliation":[{"name":"Higher School of Economics, National Research University, Moscow, Russia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9990-6467","authenticated-orcid":false,"given":"Evgenii V.","family":"Lezhnev","sequence":"additional","affiliation":[{"name":"Higher School of Economics, National Research University, Moscow, Russia"}]}],"member":"263","reference":[{"key":"ref31","year":"2020","journal-title":"Cyclone v Device Overview"},{"key":"ref30","first-page":"81","article-title":"Algoritmy mezhmashinnyh vzaimodejstvij i rekonfiguracii grafov svyazej v vychisliteknyh sistemah s programmiruemoj strukturoj","author":"monakhova","year":"1982","journal-title":"Vychislitel’nye Sist"},{"key":"ref10","first-page":"175","article-title":"Optimal permutation routing in 2-jump circulant networks","author":"zerovnik","year":"2000","journal-title":"Proc 1st Int Conf Softw Eng Appl Netw Parallel\/Distrib Comput (SNPD)"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.04.002"},{"key":"ref12","first-page":"308","article-title":"A constant time optimal routing algorithm for undirected double-loop networks","volume":"16 2005","author":"chen","year":"0","journal-title":"Proc Int Conf Mobile Ad-Hoc and Sensor Networks"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2008.57"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.heliyon.2020.e03183"},{"key":"ref15","first-page":"81","article-title":"Ob analiticheskom opisanii optimal’nyh dvumernyh diofantovyh struktur odnorodnyh vychislitel’nyh sistem","author":"monakhova","year":"1981","journal-title":"Vychislitel’nye Sist"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1111\/j.1749-6632.1989.tb22436.x"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TCS.1985.1085667"},{"key":"ref18","first-page":"159","article-title":"The diameter of undirected graphs associated to plane tessellations","volume":"20","author":"yebra","year":"1985","journal-title":"Ars Combinatoria"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/12.93744"},{"key":"ref28","first-page":"837","article-title":"TESH: A new hierarchical interconnection network for massively parallel computing","volume":"80","author":"jain","year":"1997","journal-title":"IEICE Trans Inf Syst"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.5614\/ejgta.2014.2.2.9"},{"key":"ref27","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/978-981-10-3874-7_5","article-title":"Cost effectiveness analysis of a vertical midimew-connected mesh network (VMMN)","volume":"556","author":"rahman","year":"2017","journal-title":"Advances in Intelligent Systems and Computing"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1142\/S1793830912500024"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICMSAO.2017.7934923"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ICCITechn.2014.6997341"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.heliyon.2019.e01516"},{"key":"ref8","first-page":"7","article-title":"Optimal routing in 2-jump circulant networks","author":"robic","year":"1996"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1007\/3-540-48686-0_36","article-title":"On routing in circulant graphs","volume":"1627","author":"cai","year":"1999","journal-title":"Proc Int Comput Combinatorics Conf"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00341-3"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysarc.2005.12.003"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1006\/jpdc.1995.1002","article-title":"Distributed loop computer-networks: A survey","volume":"24","author":"bermond","year":"1995","journal-title":"J Parallel Distrib Comput"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054198000076"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/335231.335236"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.2001.1746"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1134\/S0032946008010018"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/SPDP.1993.395481"},{"key":"ref26","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/978-981-13-0514-6_15","article-title":"A new static cost-effective parameter for interconnection networks of massively parallel computer systems","volume":"758","author":"rahman","year":"2018","journal-title":"Advances in Intelligent Systems and Computing"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39707-6_33"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09268938.pdf?arnumber=9268938","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,8]],"date-time":"2022-09-08T20:17:31Z","timestamp":1662668251000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9268938\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/access.2020.3040323","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]}}}