{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T17:26:11Z","timestamp":1775323571966,"version":"3.50.1"},"reference-count":11,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"5","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. &amp; Syst."],"published-print":{"date-parts":[[2025,5,1]]},"DOI":"10.1587\/transinf.2024edl8073","type":"journal-article","created":{"date-parts":[[2024,11,11]],"date-time":"2024-11-11T22:10:36Z","timestamp":1731363036000},"page":"431-435","source":"Crossref","is-referenced-by-count":2,"title":["On a Perturbation Concept in Regular Interconnection Networks"],"prefix":"10.1587","volume":"E108.D","author":[{"given":"Takashi","family":"YOKOTA","sequence":"first","affiliation":[{"name":"Utsunomiya University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kanemitsu","family":"OOTSU","sequence":"additional","affiliation":[{"name":"Utsunomiya University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","unstructured":"[1] W.J. Dally and B. Towles, Principles and Practices of Interconnection Networks, Morgan Kaufmann Pub., 2004."},{"key":"2","doi-asserted-by":"publisher","unstructured":"[3] T. Yokota, K. Ootsu, and T. Ohkawa, \u201cAccelerating large-scale interconnection network simulation by cellular automata concept,\u201d IEICE Trans. Inf. &amp; Syst., vol.E102-D, no.1, p.52-74, Jan. 2019. DOI: 10.1587\/transinf.2018EDP7131. 10.1587\/transinf.2018edp7131","DOI":"10.1587\/transinf.2018EDP7131"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[4] A. Singh, W.J. Dally, A.K. Gupta, and B. Towles, \u201cGOAL: A load-balanced adaptive routing algorithm for torus networks,\u201d Proc. 2003 International Symposium on Computer Architecture, p.194-205, 2003. DOI: 10.1145\/859618.859641. 10.1109\/isca.2003.1207000","DOI":"10.1145\/871656.859641"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[5] M. Koibuchi, H. Matsutani, H. Amano, D.F. Hsu, and H. Casanova, \u201cA case for random shortcut topologies for HPC interconnects,\u201d Proc. 39th Ann. Intl. Symp. on Computer Architecture, p.177-188, 2012. DOI: 10.1109\/ISCA.2012.6237016. 10.1109\/isca.2012.6237016","DOI":"10.1109\/ISCA.2012.6237016"},{"key":"5","doi-asserted-by":"publisher","unstructured":"[6] R. Kawano, H. Nakahara, I. Fujiwara, H. Matsutani, M. Koibuchi, and H. Amano, \u201cA layout-oriented routing method for low-latency HPC networks,\u201d IEICE Trans. Inf. &amp; Syst., vol.E100-D, no.12, p.2796-2807, Dec. 2017. DOI: 10.1587\/transinf.2017PAP0019. 10.1587\/transinf.2017pap0019","DOI":"10.1587\/transinf.2017PAP0019"},{"key":"6","unstructured":"[7] A. Singla, C.Y. Hong, L. Popa, and P.B. Godfrey, \u201cJellyfish: Networking data centers randomly,\u201d 9th USENIX Symp. on Networked Systems Design and Implementation, p.225-238, April 2012."},{"key":"7","doi-asserted-by":"crossref","unstructured":"[8] P. Faizian, M. Mollah, X. Yuan, Z. Alzaid, S. Pakin, and M. Lang, \u201cRandom regular graph and generalized de bruijn graph with <i>k<\/i>-shortest path routing,\u201d IEEE Trans. Parallel &amp; Distrib. Syst., vol.29, no.1, p.144-155, Jan. 2018. DOI: 10.1109\/TPDS.2017.2741492. 10.1109\/tpds.2017.2741492","DOI":"10.1109\/TPDS.2017.2741492"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[9] M. Nakao, H. Murai, and M. Sato, \u201cA method for order\/degree problem based on graph symmetry and simulated annealing with MPI\/OpenMP parallelization,\u201d Proc. Internl. Conf. High Performance Computing in Asia-Pacific Region, p.128-137, 2019. DOI: 10.1145\/3293320.3293325. 10.1145\/3293320.3293325","DOI":"10.1145\/3293320.3293325"},{"key":"9","doi-asserted-by":"crossref","unstructured":"[10] R. Aleliunas, \u201cRandomized parallel communication (preliminary version),\u201d Proc. First ACM SIGACT-SIGOPS Symp. Principles of Distributed Computing, p.60-72, 1982. DOI: 10.1145\/800220.806683. 10.1145\/800220.806683","DOI":"10.1145\/800220.806683"},{"key":"10","doi-asserted-by":"crossref","unstructured":"[11] L.G. Valiant and G.J. Brebner, \u201cUniversal schemes for parallel communication,\u201d Proc. 13th Ann. ACM Symp. on Theory of Computing, p.263-277, 1981. DOI: 10.1145\/800076.802479. 10.1145\/800076.802479","DOI":"10.1145\/800076.802479"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[12] B. Towles and W.J. Dally, \u201cWorst-case traffic for oblivious routing functions,\u201d Proc. 14th Ann. ACM Symp. on Parallel Algorithms and Architectures, p.1-8, 2002. DOI: 10.1145\/564870.564872. 10.1145\/564871.564872","DOI":"10.1145\/564870.564872"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E108.D\/5\/E108.D_2024EDL8073\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T03:46:30Z","timestamp":1746243990000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E108.D\/5\/E108.D_2024EDL8073\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,1]]},"references-count":11,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2025]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2024edl8073","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,5,1]]},"article-number":"2024EDL8073"}}