{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T17:20:17Z","timestamp":1648574417521},"reference-count":22,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"12","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. &amp; Syst."],"published-print":{"date-parts":[[2020,12,1]]},"DOI":"10.1587\/transinf.2020pap0005","type":"journal-article","created":{"date-parts":[[2020,11,30]],"date-time":"2020-11-30T22:20:00Z","timestamp":1606774800000},"page":"2471-2479","source":"Crossref","is-referenced-by-count":1,"title":["Traffic-Independent Multi-Path Routing for High-Throughput Data Center Networks"],"prefix":"10.1587","volume":"E103.D","author":[{"given":"Ryuta","family":"KAWANO","sequence":"first","affiliation":[{"name":"Japan Advanced Institute of Science and Technology"}]},{"given":"Ryota","family":"YASUDO","sequence":"additional","affiliation":[{"name":"Hiroshima University"}]},{"given":"Hiroki","family":"MATSUTANI","sequence":"additional","affiliation":[{"name":"Dept. of ICS, Keio University"}]},{"given":"Michihiro","family":"KOIBUCHI","sequence":"additional","affiliation":[{"name":"National Institute of Informatics"}]},{"given":"Hideharu","family":"AMANO","sequence":"additional","affiliation":[{"name":"Dept. of ICS, Keio University"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] M. Koibuchi, H. Matsutani, H. Amano, D.F. Hsu, and H. Casanova, \u201cA case for random shortcut topologies for HPC interconnects,\u201d Proc. International Symposium on Computer Architecture (ISCA), pp.177-188, June 2012. 10.1109\/isca.2012.6237016","DOI":"10.1145\/2366231.2337179"},{"key":"2","unstructured":"[2] A. Singla, C.Y. Hong, L. Popa, and P.B. Godfrey, \u201cJellyfish: Networking data centers randomly,\u201d Proc. USENIX Symposium on Networked Systems Design and Implementation (NSDI), pp.225-238, April 2012."},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] C.E. Leiserson, \u201cFat-trees: Universal networks for hardware-efficient supercomputing,\u201d IEEE Trans. Comput. (TC), vol.34, no.10, pp.892-901, Oct. 1985. 10.1109\/tc.1985.6312192","DOI":"10.1109\/TC.1985.6312192"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] C. Hopps, \u201cRFC 2992-Analysis of an equal-cost multi-path algorithm,\u201d Tech. Rep., Internet Engineering Task Force, 2000. 10.17487\/rfc2992","DOI":"10.17487\/rfc2992"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] J.Y. Yen, \u201cFinding the <i>K<\/i> shortest loopless paths in a network,\u201d Management Science, Theory Series, vol.17, no.11, pp.712-716, July 1971. 10.1287\/mnsc.17.11.712","DOI":"10.1287\/mnsc.17.11.712"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] B. Towles, W.J. Dally, and S. Boyd, \u201cThroughput-centric routing algorithm design,\u201d Proc. 15th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp.200-209, June 2003. 10.1145\/777412.777444","DOI":"10.1145\/777412.777444"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] R. Kawano, R. Yasudo, H. Matsutani, and H. Amano, \u201c<i>k<\/i>-optimized path routing for high-throughput data center networks,\u201d Proc. 6th International Symposium on Computing and Networking (CANDAR), pp.99-105, Nov. 2018. 10.1109\/candar.2018.00020","DOI":"10.1109\/CANDAR.2018.00020"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] S. Kassing, A. Valadarsky, G. Shahaf, M. Schapira, and A. Singla, \u201cBeyond fat-trees without antennae, mirrors, and disco-balls,\u201d Proc. Conference of the ACM Special Interest Group on Data Communication (SIGCOMM), pp.281-294, Aug. 2017. 10.1145\/3098822.3098836","DOI":"10.1145\/3098822.3098836"},{"key":"9","doi-asserted-by":"publisher","unstructured":"[9] D.J. Watts and S.H. Strogatz, \u201cCollective dynamics of \u2018small-world\u2019 networks,\u201d Nature, vol.393, no.6684, pp.440-442, June 1998. 10.1038\/30918","DOI":"10.1038\/30918"},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] M. Besta and T. Hoefler, \u201cSlim fly: A cost effective low-diameter network topology,\u201d Proc. International Conference for High Performance Computing, Networking, Storage and Analysis (SC), pp.348-359, Nov. 2014. 10.1109\/sc.2014.34","DOI":"10.1109\/SC.2014.34"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] A. Valadarsky, G. Shahaf, M. Dinitz, and M. Schapira, \u201cXpander: Towards optimal-performance datacenters,\u201d Proc. 12th International on Conference on emerging Networking EXperiments and Technologies (CoNEXT), pp.205-219, Dec. 2016. 10.1145\/2999572.2999580","DOI":"10.1145\/2999572.2999580"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] S.A. Jyothi, A. Singla, P.B. Godfrey, and A. Kolla, \u201cMeasuring and understanding throughput of network topologies,\u201d Proc. International Conference for High Performance Computing, Networking, Storage and Analysis (SC), pp.761-772, Nov. 2016. 10.1109\/sc.2016.64","DOI":"10.1109\/SC.2016.64"},{"key":"13","doi-asserted-by":"publisher","unstructured":"[13] H. Wang, K. Qian, C. Hu, C. Zhang, and Y. Zhou, \u201cRouting optimization for server-centric data center networks,\u201d Computer Science and Information Systems, vol.13, no.2, pp.593-608, June 2016. 10.2298\/csis160228017w","DOI":"10.2298\/CSIS160228017W"},{"key":"14","doi-asserted-by":"crossref","unstructured":"[14] X. Yuan, S. Mahapatra, W. Nienaber, S. Pakin, and M. Lang, \u201cA new routing scheme for Jellyfish and its performance with HPC workloads,\u201d Proc. International Conference on High Performance Computing, Networking, Storage and Analysis (SC), pp.1-11, Nov. 2013. 10.1145\/2503210.2503229","DOI":"10.1145\/2503210.2503229"},{"key":"15","unstructured":"[15] Gurobi Optimization Inc., \u201cGurobi optimizer reference manual,\u201d http:\/\/www.gurobi.com"},{"key":"16","doi-asserted-by":"publisher","unstructured":"[16] W.J. Dally, \u201cPerformance analysis of k-ary n-cube interconnection networks,\u201d IEEE Trans. Comput., vol.39, no.6, pp.775-785, 1990. 10.1109\/12.53599","DOI":"10.1109\/12.53599"},{"key":"17","doi-asserted-by":"publisher","unstructured":"[17] M. Al-Fares, A. Loukissas, and A. Vahdat, \u201cA scalable, commodity data center network architecture,\u201d Proc. ACM Conference on Data Communication (SIGCOMM), pp.63-74, Aug. 2008. 10.1145\/1402946.1402967","DOI":"10.1145\/1402946.1402967"},{"key":"18","doi-asserted-by":"crossref","unstructured":"[18] J. Kim, W.J. Dally, S. Scott, and D. Abts, \u201cTechnology-driven, highly-scalable dragonfly topology,\u201d Proc. International Symposium on Computer Architecture (ISCA), pp.77-88, June 2008. 10.1109\/isca.2008.19","DOI":"10.1145\/1394608.1382129"},{"key":"19","doi-asserted-by":"publisher","unstructured":"[19] F. Silla and J. Duato, \u201cHigh-performance routing in networks of workstations with irregular topology,\u201d IEEE Trans. Parallel Distrib. Syst. (TPDS), vol.11, no.7, pp.699-719, July 2000. 10.1109\/71.877816","DOI":"10.1109\/71.877816"},{"key":"20","doi-asserted-by":"publisher","unstructured":"[20] M.D. Schroeder, A.D. Birrell, M. Burrows, H. Murray, R.M. Needham, T.L. Rodeheffer, E.H. Satterthwaite, and C.P. Thacker, \u201cAutonet: A high-speed, self-configuring local area network using point-to-point links,\u201d IEEE J. Sel. Areas Commun., vol.9, no.8, pp.1318-1335, Oct. 1991. 10.1109\/49.105178","DOI":"10.1109\/49.105178"},{"key":"21","doi-asserted-by":"crossref","unstructured":"[21] N. Jiang, D.U. Becker, G. Michelogiannakis, J. Balfour, B. Towles, D.E. Shaw, J. Kim, and W.J. Dally, \u201cA detailed and flexible cycle-accurate network-on-chip simulator,\u201d Proc. IEEE International Symposium on Performance Analysis of Systems and Software (ISPASS), pp.86-96, April 2013. 10.1109\/ispass.2013.6557149","DOI":"10.1109\/ISPASS.2013.6557149"},{"key":"22","doi-asserted-by":"crossref","unstructured":"[22] H. Matsutani, P. Bogdan, R. Marculescu, Y. Take, D. Sasaki, H. Zhang, M. Koibuchi, T. Kuroda, and H. Amano, \u201cA case for wireless 3D NoCs for CMPs,\u201d Proc. Asia and South Pacific Design Automation Conference (ASP-DAC), pp.22-28, Jan. 2013. 10.1109\/aspdac.2013.6509553","DOI":"10.1109\/ASPDAC.2013.6509553"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E103.D\/12\/E103.D_2020PAP0005\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,5]],"date-time":"2020-12-05T04:27:43Z","timestamp":1607142463000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E103.D\/12\/E103.D_2020PAP0005\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12,1]]},"references-count":22,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2020]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2020pap0005","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,12,1]]}}}