{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T00:48:30Z","timestamp":1768870110791,"version":"3.49.0"},"reference-count":38,"publisher":"Oxford University Press (OUP)","issue":"1","license":[{"start":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T00:00:00Z","timestamp":1757116800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/pages\/standard-publication-reuse-rights"}],"funder":[{"name":"Major Scientific Instruments and Equipments Development Project of National Natural Science Foundation of China","award":["62427809"],"award-info":[{"award-number":["62427809"]}]},{"name":"Key Program of Natural Science Foundation of Jiangsu","award":["BK20243053"],"award-info":[{"award-number":["BK20243053"]}]},{"name":"Key Program of Natural Science Foundation of Jiangsu","award":["24KJA520006"],"award-info":[{"award-number":["24KJA520006"]}]},{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62372248"],"award-info":[{"award-number":["62372248"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62402241"],"award-info":[{"award-number":["62402241"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62302235"],"award-info":[{"award-number":["62302235"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004608","name":"Natural Science Foundation of Jiangsu Province","doi-asserted-by":"publisher","award":["BK20230352"],"award-info":[{"award-number":["BK20230352"]}],"id":[{"id":"10.13039\/501100004608","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004608","name":"Natural Science Foundation of Jiangsu Province","doi-asserted-by":"publisher","award":["BK20200753"],"award-info":[{"award-number":["BK20200753"]}],"id":[{"id":"10.13039\/501100004608","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Jiangsu Postdoctoral Science Foundation Funded Project","award":["2021K096A"],"award-info":[{"award-number":["2021K096A"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026,1,13]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>High-performance computing utilizes powerful processor clusters to parallel process big data and solve complex problems at extremely high speeds, relying significantly on interconnection networks. As networks grow in scale and complexity, failures become unavoidable. Interconnection networks demand consistent operation and efficient routing algorithms to enable smooth data transmission among processors. Fault-tolerant routing is essential for assessing network reliability. The application of independent spanning trees (ISTs) is an effective method to enhance network fault tolerance. Regarded as a significant extension of the hypercube, the $3$-ary $n$-cube network $(Q^{3}_{n})$ boasts many advantageous such as low vertex degree, regularity, and straightforward implementation. In this paper, we introduce parallel algorithms for generating $2n$ ISTs on $Q^{3}_{n}$, where $2n$ represents the maximum achievable number, enhancing the efficiency and obtaining additional sets of ISTs and disjoint paths. Building upon previously constructed ISTs, a fault-tolerant routing system is developed, utilizing them as the routing table. Subsequently, the effectiveness of this mechanism is assessed through simulated data, showing an increment in transmission success rates as dimensionality grows, nearing near-perfection at almost $100\\%$. These results also reveal that the algorithm we proposed demonstrates better performance than traditional classical algorithms.<\/jats:p>","DOI":"10.1093\/comjnl\/bxaf105","type":"journal-article","created":{"date-parts":[[2025,8,26]],"date-time":"2025-08-26T11:33:07Z","timestamp":1756207987000},"page":"148-161","source":"Crossref","is-referenced-by-count":0,"title":["Parallel construction of multiple independent spanning trees on 3-ary\n                    <i>n<\/i>\n                    -cube networks"],"prefix":"10.1093","volume":"69","author":[{"given":"Weibei","family":"Fan","sequence":"first","affiliation":[{"name":"School of Computer, Nanjing University of Posts and Telecommunications , 9 Wenyuan Road, Xianlin University Town, Qixia District, Nanjing City, Jiangsu Province 210023 ,","place":["P. R. China"]}]},{"given":"Yuzhen","family":"Xu","sequence":"additional","affiliation":[{"name":"School of Computer, Nanjing University of Posts and Telecommunications , 9 Wenyuan Road, Xianlin University Town, Qixia District, Nanjing City, Jiangsu Province 210023 ,","place":["P. R. China"]}]},{"given":"Mengjie","family":"Lv","sequence":"additional","affiliation":[{"name":"School of Computer, Nanjing University of Posts and Telecommunications , 9 Wenyuan Road, Xianlin University Town, Qixia District, Nanjing City, Jiangsu Province 210023 ,","place":["P. R. China"]}]},{"given":"Xueli","family":"Sun","sequence":"additional","affiliation":[{"name":"School of Computer, Nanjing University of Posts and Telecommunications , 9 Wenyuan Road, Xianlin University Town, Qixia District, Nanjing City, Jiangsu Province 210023 ,","place":["P. R. China"]}]}],"member":"286","published-online":{"date-parts":[[2025,9,6]]},"reference":[{"key":"2026011907114267600_ref1","doi-asserted-by":"publisher","first-page":"114015","DOI":"10.1016\/j.tcs.2023.114015","article-title":"Reliability evaluation of complete graph-based recursive networks","volume":"966-967","author":"Wang","year":"2023","journal-title":"Theor Comput Sci"},{"key":"2026011907114267600_ref2","doi-asserted-by":"publisher","first-page":"1302","DOI":"10.1109\/TR.2023.3330685","article-title":"Reliability assessment of interconnection networks based on link fault patterns","volume":"73","author":"Xu","year":"2024","journal-title":"IEEE Trans Reliab"},{"key":"2026011907114267600_ref3","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1109\/TPDS.2023.3242089","article-title":"Intermittent fault diagnosis of split-star networks and its applications","volume":"34","author":"Song","year":"2023","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"2026011907114267600_ref4","doi-asserted-by":"crossref","first-page":"1719","DOI":"10.1109\/TC.2020.3023120","article-title":"A novel measurement for network reliability","volume":"70","author":"Lin","year":"2020","journal-title":"IEEE Trans Comput"},{"key":"2026011907114267600_ref5","doi-asserted-by":"crossref","first-page":"1241","DOI":"10.1109\/TR.2020.3013158","article-title":"Strong reliability of star graphs interconnection networks","volume":"71","author":"Lin","year":"2020","journal-title":"IEEE Trans Reliab"},{"key":"2026011907114267600_ref6","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/j.dam.2022.08.015","article-title":"The 3-path-connectivity of the hypercubes","volume":"322","author":"Zhu","year":"2022","journal-title":"Discrete Appl Math"},{"key":"2026011907114267600_ref7","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1093\/comjnl\/bxad012","article-title":"The cyclic diagnosability of hypercubes under the PMC model and the MM$^{*}$ model","volume":"67","author":"Zhang","year":"2024","journal-title":"Comput J"},{"key":"2026011907114267600_ref8","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.dam.2023.07.013","article-title":"Reliability analysis of 3-aryn-cube in terms of average degree edge-connectivity","volume":"341","author":"Zhang","year":"2023","journal-title":"Discrete Appl Math"},{"key":"2026011907114267600_ref9","doi-asserted-by":"publisher","first-page":"127499","DOI":"10.1016\/j.amc.2022.127499","article-title":"The 3-path-connectivity of the k-ary n-cube","volume":"436","author":"Zhu","year":"2023","journal-title":"Appl Math Comput"},{"key":"2026011907114267600_ref10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TPDS.2023.3264698","article-title":"An efficient algorithm for Hamiltonian path embedding of k-ary n-cubes under the partitioned edge fault model","volume":"34","author":"Zhuang","year":"2023","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"2026011907114267600_ref11","doi-asserted-by":"publisher","first-page":"3245","DOI":"10.1109\/TC.2023.3288766","article-title":"Embedding Hamiltonian paths in k-ary n-cubes with exponentially-many faulty edges","volume":"72","author":"Zhuang","year":"2023","journal-title":"IEEE Trans Comput"},{"key":"2026011907114267600_ref12","volume-title":"Proceedings of the Winter Simulation Conference 2009"},{"key":"2026011907114267600_ref13","doi-asserted-by":"crossref","DOI":"10.1109\/GLOCOM.2014.7037143","article-title":"NovaCube: a low latency torus-based network architecture for data centers","volume-title":"Proceedings of the 2014 IEEE Global Communications Conference (GLOBECOM 2014)","author":"Wang"},{"key":"2026011907114267600_ref14","doi-asserted-by":"publisher","first-page":"1689","DOI":"10.1109\/TNET.2022.3147320","article-title":"Transmission failure analysis of multi-protection routing in data center networks with heterogeneous edge-core servers","volume":"30","author":"Li","year":"2022","journal-title":"IEEE\/ACM Trans Netw"},{"key":"2026011907114267600_ref15","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1109\/TR.2023.3301629","article-title":"Probabilistic reliability via subsystem structures of arrangement graph networks","volume":"73","author":"Huang","year":"2023","journal-title":"IEEE Trans Reliab"},{"key":"2026011907114267600_ref16","doi-asserted-by":"crossref","first-page":"1939","DOI":"10.1109\/TPDS.2021.3133595","article-title":"Completely independent spanning trees on BCCC data center networks with an application to fault-tolerant routing","volume":"33","author":"Li","year":"2021","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"2026011907114267600_ref17","doi-asserted-by":"publisher","first-page":"874","DOI":"10.1109\/TNET.2023.3305611","article-title":"A new measure of fault-tolerance for network reliability: double-structure connectivity","volume":"32","author":"Wang","year":"2024","journal-title":"IEEE\/ACM Trans Netw"},{"key":"2026011907114267600_ref18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3591110","article-title":"Independent spanning trees in networks: a survey","volume":"55","author":"Cheng","year":"2023","journal-title":"ACM Comput Surv"},{"key":"2026011907114267600_ref19","doi-asserted-by":"publisher","first-page":"1971","DOI":"10.1109\/TC.2022.3230288","article-title":"Constructing multiple CISTs on BCube-based data center networks in the occurrence of switch failures","volume":"72","author":"Lin","year":"2023","journal-title":"IEEE Trans Comput"},{"key":"2026011907114267600_ref20","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1109\/TDSC.2017.2693372","article-title":"Fault-tolerant adaptive routing in dragonfly networks","volume":"16","author":"Xiang","year":"2019","journal-title":"IEEE Trans Dependable Secure Comput"},{"key":"2026011907114267600_ref21","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/S0012-365X(00)00377-0","article-title":"Completely independent spanning trees in the underlying graph of a line digraph","volume":"234","author":"Hasunuma","year":"2001","journal-title":"Discrete Math"},{"key":"2026011907114267600_ref22","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.tcs.2022.11.023","article-title":"A parallel algorithm to construct edge independent spanning trees on the line graphs of conditional bijective connection networks","volume":"942","author":"Pan","year":"2020","journal-title":"Theor Comput Sci"},{"key":"2026011907114267600_ref23","article-title":"Completely independent spanning trees in the hypercube","author":"Shaw","year":"2024"},{"key":"2026011907114267600_ref24","doi-asserted-by":"publisher","first-page":"114969","DOI":"10.1016\/j.tcs.2024.114969","article-title":"Vertex-independent spanning trees in complete Josephus cubes","volume":"1025","author":"He","year":"2025","journal-title":"Theor Comput Sci"},{"key":"2026011907114267600_ref25","doi-asserted-by":"publisher","first-page":"124546","DOI":"10.1016\/j.amc.2019.06.060","article-title":"Constructing dual-CISTs of DCell data center networks","volume":"362","author":"Qin","year":"2019","journal-title":"Appl Math Comput"},{"key":"2026011907114267600_ref26","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.dam.2019.09.021","article-title":"An improved algorithm to construct edge-independent spanning trees in augmented cubes","volume":"277","author":"Cheng","year":"2020","journal-title":"Discrete Appl Math"},{"key":"2026011907114267600_ref27","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/0020-0190(92)90230-S","article-title":"On independent spanning trees","volume":"42","author":"Khuller","year":"1992","journal-title":"Inf Process Lett"},{"key":"2026011907114267600_ref28","doi-asserted-by":"publisher","first-page":"1023","DOI":"10.1137\/S0097539703436734","article-title":"Finding four independent trees","volume":"35","author":"Curran","year":"2006","journal-title":"SIAM J Comput"},{"key":"2026011907114267600_ref29","doi-asserted-by":"crossref","DOI":"10.1109\/ASAP52443.2021.00038","article-title":"Parallel construction of independent spanning trees on folded crossed cubes","volume-title":"Proceedings of the 2021 IEEE 32nd International Conference on Application-Specific Systems, Architectures and Processors (ASAP 2021)","author":"Zhang","year":"2021"},{"key":"2026011907114267600_ref30","doi-asserted-by":"publisher","first-page":"103","DOI":"10.3233\/FI-2020-1965","article-title":"Constructing node-independent spanning trees in augmented cubes","volume":"176","author":"Cheng","year":"2020","journal-title":"Fundamenta Informaticae"},{"key":"2026011907114267600_ref31","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/j.jpdc.2019.08.006","article-title":"Constructing node-independent spanning trees on the line graph of the hypercube by an independent forest scheme","volume":"134","author":"Cheng","year":"2019","journal-title":"J Parallel Distrib Comput"},{"key":"2026011907114267600_ref32","doi-asserted-by":"crossref","first-page":"74\u010a82","DOI":"10.1016\/j.dam.2016.11.017","article-title":"A parallel algorithm for constructing independent spanning trees in twisted cubes","volume":"219","author":"Chang","year":"2017","journal-title":"Discrete Appl Math"},{"key":"2026011907114267600_ref33","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.parco.2006.12.001","article-title":"Parallel construction of optimal independent spanning trees on hypercubes","volume":"33","author":"Yang","year":"2007","journal-title":"Parallel Comput"},{"key":"2026011907114267600_ref34","doi-asserted-by":"publisher","first-page":"1713","DOI":"10.1016\/j.jpdc.2012.07.003","article-title":"An efficient parallel construction of optimal independent spanning trees on hypercubes","volume":"72","author":"Werapun","year":"2012","journal-title":"J Parallel Distrib Comput"},{"key":"2026011907114267600_ref35","doi-asserted-by":"publisher","first-page":"2237","DOI":"10.1016\/j.tcs.2010.12.061","article-title":"Constructing independent spanning trees for locally twisted cubes","volume":"412","author":"Liu","year":"2011","journal-title":"Theor Comput Sci"},{"key":"2026011907114267600_ref36","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1016\/j.future.2018.02.010","article-title":"Constructing independent spanning trees with height n on the n-dimensional crossed cube","volume":"87","author":"Cheng","year":"2018","journal-title":"Future Gener Comput Syst"},{"key":"2026011907114267600_ref37","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/j.dam.2022.01.015","article-title":"The vertex Tur\u00e1n density in 3-ary n-cubes","volume":"311","author":"Li","year":"2022","journal-title":"Discrete Appl Math"},{"key":"2026011907114267600_ref38","doi-asserted-by":"publisher","first-page":"1279","DOI":"10.1007\/s11227-013-0883-1","article-title":"Parallel construction of independent spanning trees and an application in diagnosis on M\u00f6bius cubes","volume":"65","author":"Cheng","year":"2013","journal-title":"J Supercomput"}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/69\/1\/148\/64217089\/bxaf105.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/69\/1\/148\/64217089\/bxaf105.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T12:11:54Z","timestamp":1768824714000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article\/69\/1\/148\/8248732"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,6]]},"references-count":38,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,9,6]]},"published-print":{"date-parts":[[2026,1,13]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxaf105","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"value":"0010-4620","type":"print"},{"value":"1460-2067","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2026,1]]},"published":{"date-parts":[[2025,9,6]]}}}