{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,23]],"date-time":"2026-10-23T20:04:11Z","timestamp":1792785851902,"version":"4.5.0"},"reference-count":34,"publisher":"Oxford University Press (OUP)","issue":"8","license":[{"start":{"date-parts":[[2022,5,14]],"date-time":"2022-05-14T00:00:00Z","timestamp":1652486400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62172291"],"award-info":[{"award-number":["62172291"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61972272"],"award-info":[{"award-number":["61972272"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62102196"],"award-info":[{"award-number":["62102196"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Jiangsu Province Department of Education Future Network Research Fund Project","award":["FNSRFP-2021-YB-39"],"award-info":[{"award-number":["FNSRFP-2021-YB-39"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,8,14]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>The data center network HSDC is a superior candidate for building large-scale data centers, and strikes a good balance among diameter, bisection width, incremental scalability and other important characteristics in contrast to the state-of-the-art data center network architectures. The Hamiltonian property is an important indicator to measure the reliability of a network. In this paper, we study the Hamiltonian properties of HSDC\u2019s logic graph $H_n$. Firstly, we prove that $H_n$ is Hamiltonian-connected for $n\\geq 3$. Secondly, we propose an $O(NlogN)$ algorithm for finding a Hamiltonian path between any two distinct nodes in $H_n$, where $N$ is the number of nodes in $H_n$. Furthermore, we consider the Hamiltonian properties of $H_n$ with faulty elements, and prove that $H_n$ is $(n-3)$-fault-tolerant Hamiltonian-connected and $(n-2)$-fault-tolerant Hamiltonian for $n\\geq 3$.<\/jats:p>","DOI":"10.1093\/comjnl\/bxac055","type":"journal-article","created":{"date-parts":[[2022,4,14]],"date-time":"2022-04-14T07:13:14Z","timestamp":1649920394000},"page":"1965-1981","source":"Crossref","is-referenced-by-count":12,"title":["Hamiltonian Properties of the Data Center Network HSDC with Faulty Elements"],"prefix":"10.1093","volume":"66","author":[{"given":"Hui","family":"Dong","sequence":"first","affiliation":[{"name":"School of Computer Science and Technology, Soochow University , Suzhou 215006 , China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jianxi","family":"Fan","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Soochow University , Suzhou 215006 , China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Baolei","family":"Cheng","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Soochow University , Suzhou 215006 , China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yan","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Soochow University , Suzhou 215006 , China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Li","family":"Xu","sequence":"additional","affiliation":[{"name":"School of Mathematics and Informatics, Fujian Normal University , Fuzhou, Fujian, 350117 , China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"286","published-online":{"date-parts":[[2022,5,14]]},"reference":[{"key":"2023081805144419600_ref1","first-page":"63","volume-title":"Proceedings of SIGCOMM\u201908, Seattle, WA, 17\u201322 August","author":"Al-Fares","year":"2008"},{"key":"2023081805144419600_ref2","doi-asserted-by":"crossref","first-page":"1105","DOI":"10.1109\/TPDS.2018.2874659","article-title":"HSDC: A highly scalable data center network architecture for greater incremental scalability","volume":"30","author":"Zhang","year":"2019","journal-title":"IEEE Transaction on Parallel and Distributed Systems"},{"key":"2023081805144419600_ref3","first-page":"75","volume-title":"Proceedings of SIGCOMM\u201908, Seattle, WA, 17\u201322 August","author":"Guo","year":"2008"},{"key":"2023081805144419600_ref4","first-page":"63","volume-title":"Proceedings of SIGCOMM\u201909, Barcelona, Spain, 17\u201321 August","author":"Guo","year":"2009"},{"key":"2023081805144419600_ref5","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1109\/TNET.2010.2053718","article-title":"Scalable and cost-effective interconnection of data-center servers using dual server ports","volume":"19","author":"Li","year":"2011","journal-title":"IEEE Transactions on Networking"},{"key":"2023081805144419600_ref6","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/s11464-009-0017-5","article-title":"Survey on path and cycle embedding in some networks","volume":"4","author":"Ma","year":"2009","journal-title":"Frontiers of Mathematics in China"},{"key":"2023081805144419600_ref7","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1016\/j.ins.2018.10.035","article-title":"On exploiting priority relation graph for reliable multi-path communication in mobile social networks","volume":"477","author":"Lin","year":"2019","journal-title":"Inform. Sci."},{"key":"2023081805144419600_ref8","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1016\/j.ins.2013.03.044","article-title":"Hamiltonian properties of honeycomb meshes","volume":"240","author":"Xu","year":"2013","journal-title":"Inform. Sci."},{"key":"2023081805144419600_ref9","first-page":"420","article-title":"Number of proper paths in edge-colored hypercubes","volume":"332","author":"Xue","year":"2018","journal-title":"Appl. Math Comput."},{"key":"2023081805144419600_ref10","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/j.dam.2016.09.013","article-title":"Many-to-many disjoint paths in hypercubes with faulty vertices","volume":"217","author":"Li","year":"2017","journal-title":"Discrete Applied Mathematics"},{"key":"2023081805144419600_ref11","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1109\/71.689441","article-title":"Resource deadlocks and performance of wormhole multicast routing algorithms","volume":"9","author":"Boppana","year":"1998","journal-title":"IEEE Transaction on Parallel and Distributed Systems"},{"key":"2023081805144419600_ref12","doi-asserted-by":"crossref","first-page":"793","DOI":"10.1109\/71.298203","article-title":"Deadlock-free multicast wormhole routing in 2D mesh multicomputers","volume":"5","author":"Lin","year":"1994","journal-title":"IEEE Transactions on Parallel Distributed Systems"},{"key":"2023081805144419600_ref13","doi-asserted-by":"crossref","first-page":"1550005:1","DOI":"10.1142\/S021926591550005X","article-title":"Diagnosability and diagnostic algorithm for pancake graph under the comparison model","volume":"15","author":"Liu","year":"2015","journal-title":"Journal of Interconnection Networks"},{"key":"2023081805144419600_ref14","doi-asserted-by":"crossref","first-page":"2459","DOI":"10.1109\/TPDS.2014.2350480","article-title":"Five-round adaptive diagnosis in Hamiltonian networks","volume":"26","author":"Ye","year":"2015","journal-title":"IEEE Transaction on Parallel and Distributed Systems"},{"key":"2023081805144419600_ref15","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/0196-6774(81)90037-7","article-title":"The NP-completeness column: An ongoing guide","volume":"2","author":"Johnson","year":"1981","journal-title":"Journal of Algorithms"},{"key":"2023081805144419600_ref16","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/j.tcs.2013.06.001","article-title":"DVcube: A novel compound architecture of disc-ring graph and hypercube-like graph","volume":"498","author":"Hung","year":"2013","journal-title":"Theoretical Computer Science"},{"key":"2023081805144419600_ref17","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1016\/j.dam.2017.12.043","article-title":"Hamiltonian properties of some compound networks","volume":"239","author":"Qin","year":"2018","journal-title":"Discrete Applied Mathematics"},{"key":"2023081805144419600_ref18","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/j.jpdc.2016.10.015","article-title":"Sufficient conditions for Hamiltonicity in multiswapped networks","volume":"101","author":"Stewart","year":"2016","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"2023081805144419600_ref19","first-page":"1359","article-title":"On the fault tolerant hamiltonicity of faulty crossed cubes","volume":"6","author":"Huang","year":"2002","journal-title":"IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences"},{"key":"2023081805144419600_ref20","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1016\/j.tcs.2008.05.002","article-title":"Fault-tolerant embedding of paths in crossed cubes","volume":"407","author":"Ma","year":"2008","journal-title":"Theoretical Computer Science"},{"key":"2023081805144419600_ref21","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1016\/j.ic.2016.10.002","article-title":"Conditional edge-fault hamiltonian-connectivity of restricted hypercube-like networks","volume":"251","author":"Hsieh","year":"2016","journal-title":"Information Computation"},{"key":"2023081805144419600_ref22","doi-asserted-by":"crossref","first-page":"854","DOI":"10.1109\/TC.2006.104","article-title":"Hamiltonian path embedding and pancyclicity on the M\u00f6bius cube with faulty nodes and faulty edges","volume":"55","author":"Hsieh","year":"2006","journal-title":"IEEE Trans. Comput."},{"key":"2023081805144419600_ref23","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1142\/S0219265907002016","article-title":"Distributed algorithms for building Hamiltonian cycles in k-ary n-cubes and hypercubes with faulty links","volume":"8","author":"Stewart","year":"2007","journal-title":"Journal of Interconnection Networks"},{"key":"2023081805144419600_ref24","doi-asserted-by":"crossref","first-page":"2944","DOI":"10.1093\/comjnl\/bxv019","article-title":"Hamiltonian properties of DCell networks","volume":"58","author":"Wang","year":"2015","journal-title":"The Computer Journal"},{"key":"2023081805144419600_ref25","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/j.dam.2018.03.049","article-title":"Conditional edge-fault-tolerant Hamiltonicity of the data center network","volume":"247","author":"Qin","year":"2018","journal-title":"Discrete Applied Mathematics"},{"key":"2023081805144419600_ref26","doi-asserted-by":"crossref","first-page":"1064","DOI":"10.1007\/s11390-020-9508-3","article-title":"Fault-tolerant Hamiltonicity and Hamiltonian connectivity of BCube with various faulty elements","volume":"35","author":"Wang","year":"2020","journal-title":"Journal of Computer Science and Technology"},{"key":"2023081805144419600_ref27","doi-asserted-by":"crossref","first-page":"700","DOI":"10.1007\/s10766-021-00699-x","article-title":"Fault-tolerant and unicast performances of the data center network HSDC","volume":"49","author":"Dong","year":"2021","journal-title":"International Journal of Parallel Programming"},{"key":"2023081805144419600_ref28","article-title":"Parallel construction of multiple independent spanning trees on highly scalable datacenter networks","volume":"413","author":"Yang","year":"2022","journal-title":"Appl. Math Comput."},{"key":"2023081805144419600_ref29","volume-title":"Science Press","author":"Xu","year":"2001"},{"key":"2023081805144419600_ref30","doi-asserted-by":"crossref","first-page":"1090","DOI":"10.1007\/11602613_108","article-title":"Edge-pancyclicity of twisted cubes","volume":"3827","author":"Fan","year":"2005","journal-title":"Lecture Notes in Computer Science"},{"key":"2023081805144419600_ref31","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1016\/j.tcs.2020.11.027","article-title":"The vertex-pancyclicity of data center networks","volume":"855","author":"Hao","year":"2021","journal-title":"Theoretical Computer Science"},{"key":"2023081805144419600_ref32","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.jpdc.2015.11.002","article-title":"Fault-tolerant vertex-pancyclicity of locally twisted cubes LTQn","volume":"88","author":"Xu","year":"2016","journal-title":"Journal of Parallel Distributed Computing"},{"key":"2023081805144419600_ref33","doi-asserted-by":"crossref","first-page":"2268","DOI":"10.1016\/j.ins.2011.01.031","article-title":"Fault-tolerant edge-pancyclicity of locally twisted cubes","volume":"181","author":"Xu","year":"2011","journal-title":"Inform. Sci."},{"key":"2023081805144419600_ref34","doi-asserted-by":"crossref","first-page":"3440","DOI":"10.1016\/j.tcs.2011.02.014","article-title":"An efficient fault-tolerant routing algorithm in bijective connection networks with restricted faulty edges","volume":"412","author":"Fan","year":"2011","journal-title":"Theoretical Computer Science"}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/66\/8\/1965\/51107469\/bxac055.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/66\/8\/1965\/51107469\/bxac055.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,18]],"date-time":"2023-08-18T01:15:13Z","timestamp":1692321313000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article\/66\/8\/1965\/6585620"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,14]]},"references-count":34,"journal-issue":{"issue":"8","published-online":{"date-parts":[[2022,5,14]]},"published-print":{"date-parts":[[2023,8,14]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxac055","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"value":"0010-4620","type":"print"},{"value":"1460-2067","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2023,8]]},"published":{"date-parts":[[2022,5,14]]}}}