{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T01:31:52Z","timestamp":1760059912284,"version":"build-2065373602"},"reference-count":19,"publisher":"MDPI AG","issue":"7","license":[{"start":{"date-parts":[[2025,7,20]],"date-time":"2025-07-20T00:00:00Z","timestamp":1752969600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers"],"abstract":"<jats:p>Clos networks and their folded versions, fat trees, are widely adopted in interconnection network designs for data centers and supercomputers. There are two main types of Clos networks: strictly nonblocking Clos networks and rearrangeably nonblocking Clos networks. Strictly nonblocking Clos networks can connect an idle input to an idle output without interfering with existing connections. Rearrangeably nonblocking Clos networks can connect an idle input to an idle output with rearrangements of existing connections. Traditional strictly nonblocking Clos networks have two drawbacks. One drawback is the use of crossbars with different numbers of input and output ports, whereas the currently available switches are square crossbars with the same number of input and output ports. Another drawback is that every connection goes through a fixed number of stages, increasing the length of the communication path. A drawback of traditional fat trees is that the root stage uses differently sized crossbar switches than the other stages. To solve these problems, this paper proposes an Identical Strictly NonBlocking folded Clos (ISNBC) network that uses equally sized square crossbars for all switches. Correspondingly, this paper also proposes an Identical Rearrangeably NonBlocking folded Clos (IRNBC) network. Both ISNBC and IRNBC networks can have any number of stages, can use equally sized square crossbars with no unused switch ports, and can utilize shortcut connections to reduce communication path lengths. Moreover, both ISNBC and IRNBC networks have a lower switch crosspoint cost ratio relative to a single crossbar than their corresponding traditional Clos networks. Specifically, ISNBC networks use 46.43% to 87.71% crosspoints of traditional strictly nonblocking folded Clos networks, and IRNBC networks use 53.85% to 60.00% crosspoints of traditional rearrangeably nonblocking folded Clos networks.<\/jats:p>","DOI":"10.3390\/computers14070293","type":"journal-article","created":{"date-parts":[[2025,7,21]],"date-time":"2025-07-21T08:47:14Z","timestamp":1753087634000},"page":"293","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Design of Identical Strictly and Rearrangeably Nonblocking Folded Clos Networks with Equally Sized Square Crossbars"],"prefix":"10.3390","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0069-5629","authenticated-orcid":false,"given":"Yamin","family":"Li","sequence":"first","affiliation":[{"name":"Computer Architecture Laboratory, Department of Computer Science, Faculty of Computer and Information Sciences, Hosei University, Tokyo 184-8584, Japan"}]}],"member":"1968","published-online":{"date-parts":[[2025,7,20]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1002\/j.1538-7305.1953.tb01433.x","article-title":"A study of non-blocking switching networks","volume":"32","author":"Clos","year":"1953","journal-title":"Bell Syst. Tech. J."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"892","DOI":"10.1109\/TC.1985.6312192","article-title":"Fat-trees: Universal networks for hardware-efficient supercomputing","volume":"C-34","author":"Leiserson","year":"1985","journal-title":"IEEE Trans. Comput."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1145\/2829988.2787508","article-title":"Jupiter Rising: A Decade of Clos Topologies and Centralized Control in Google\u2019s Datacenter Network","volume":"45","author":"Singh","year":"2015","journal-title":"ACM SIGCOMM Comput. Commun. Rev."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/s11390-015-1520-7","article-title":"High Performance Interconnect Network for Tianhe System","volume":"30","author":"Liao","year":"2015","journal-title":"J. Comput. Sci. Technol."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"1869","DOI":"10.1007\/s11432-016-5588-7","article-title":"The Sunway TaihuLight supercomputer: System and applications","volume":"59","author":"Fu","year":"2016","journal-title":"Sci. China Inf. Sci."},{"doi-asserted-by":"crossref","unstructured":"Stanzione, D., West, J., Evans, R.T., Minyard, T., Ghattas, O., and Panda, D.K. (2020, January 27\u201331). Frontera: The Evolution of Leadership Computing at the National Science Foundation. Proceedings of the Practice and Experience in Advanced Research Computing 2020: Catch the Wave, New York, NY, USA. PEARC \u201920.","key":"ref_6","DOI":"10.1145\/3311790.3396656"},{"doi-asserted-by":"crossref","unstructured":"Stunkel, C.B., Graham, R.L., Shainer, G., Kagan, M., Sharkawi, S.S., Rosenburg, B., and Chochia, G.A. (2020). The high-speed networks of the Summit and Sierra supercomputers. IBM J. Res. Dev., 64.","key":"ref_7","DOI":"10.1147\/JRD.2020.2967330"},{"doi-asserted-by":"crossref","unstructured":"Zhao, C., Deng, C., Ruan, C., Dai, D., Gao, H., Li, J., Zhang, L., Huang, P., Zhou, S., and Ma, S. (2025, January 21\u201325). Insights into DeepSeek-V3: Scaling Challenges and Reflections on Hardware for AI Architectures. Proceedings of the 52nd Annual International Symposium on Computer Architecture, New York, NY, USA.","key":"ref_8","DOI":"10.1145\/3695053.3731412"},{"doi-asserted-by":"crossref","unstructured":"Abts, D., and Kim, J. (2011). High Performance Datacenter Networks: Architectures, Algorithms, and Opportunities, Morgan and Claypool.","key":"ref_9","DOI":"10.1007\/978-3-031-01730-8"},{"unstructured":"Petrini, F., and Vanneschi, M. (1997, January 1\u20135). k-ary n-trees: High performance networks for massively parallel architectures. Proceedings of the 11th International Parallel Processing Symposium, Geneva, Switzerland.","key":"ref_10"},{"unstructured":"Dally, W.J., and Towles, B.P. (2004). Principles and Practices of Interconnection Networks, Elsevier. Available online: https:\/\/books.google.co.jp\/books?id=oOqpcB5191sC.","key":"ref_11"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"1619","DOI":"10.1002\/j.1538-7305.1964.tb04102.x","article-title":"Permutation groups, complexes, and rearrangeable connecting networks","volume":"43","year":"1964","journal-title":"Bell Syst. Tech. J."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1145\/1402946.1402967","article-title":"A scalable, commodity data center network architecture","volume":"38","author":"Loukissas","year":"2008","journal-title":"ACM SIGCOMM Comput. Commun. Rev."},{"doi-asserted-by":"crossref","unstructured":"Li, Y., and Chu, W. (2018, January 8\u201312). MiKANT: A Mirrored K-Ary N-Tree for Reducing Hardware Cost and Packet Latency of Fat-Tree and Clos Networks. Proceedings of the 18th IEEE International Conference on Scalable Computing and Communications, Washington, DC, USA.","key":"ref_14","DOI":"10.1109\/SmartWorld.2018.00281"},{"doi-asserted-by":"crossref","unstructured":"Li, Y., and Chu, W. (2022, January 7\u20139). Fault Tolerance and Packet Latency of Peer Fat-Trees. Proceedings of the Parallel and Distributed Computing, Applications and Technologies, Sendai, Japan.","key":"ref_15","DOI":"10.1007\/978-3-031-29927-8_32"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"2558","DOI":"10.1109\/TNSM.2022.3228909","article-title":"Redesigning the Nonblocking Clos Network to Increase Its Capacity","volume":"20","author":"Mano","year":"2023","journal-title":"IEEE Trans. Netw. Serv. Manag."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1109\/LNET.2023.3322172","article-title":"Twisted and Folded Clos-Network Design Model with Two-Step Blocking Probability Guarantee","volume":"6","author":"Taka","year":"2024","journal-title":"IEEE Netw. Lett."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1364\/JOCN.513898","article-title":"Design model of a twisted and folded Clos network with multi-step grouped intermediate switches guaranteeing admissible blocking probability","volume":"16","author":"Taka","year":"2024","journal-title":"J. Opt. Commun. Netw."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"2278","DOI":"10.1109\/TNSM.2025.3539907","article-title":"Design of Multiple-Plane Twisted and Folded Clos Network Guaranteeing Admissible Blocking Probability","volume":"22","author":"Oki","year":"2025","journal-title":"IEEE Trans. Netw. Serv. Manag."}],"container-title":["Computers"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-431X\/14\/7\/293\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T18:12:52Z","timestamp":1760033572000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-431X\/14\/7\/293"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,20]]},"references-count":19,"journal-issue":{"issue":"7","published-online":{"date-parts":[[2025,7]]}},"alternative-id":["computers14070293"],"URL":"https:\/\/doi.org\/10.3390\/computers14070293","relation":{},"ISSN":["2073-431X"],"issn-type":[{"type":"electronic","value":"2073-431X"}],"subject":[],"published":{"date-parts":[[2025,7,20]]}}}