{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T05:07:01Z","timestamp":1773551221877,"version":"3.50.1"},"reference-count":31,"publisher":"Oxford University Press (OUP)","issue":"1","license":[{"start":{"date-parts":[[2024,9,20]],"date-time":"2024-09-20T00:00:00Z","timestamp":1726790400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/pages\/standard-publication-reuse-rights"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U23B2002"],"award-info":[{"award-number":["U23B2002"]}],"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":["62272238"],"award-info":[{"award-number":["62272238"]}],"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":["62302235"],"award-info":[{"award-number":["62302235"]}],"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":["62372248"],"award-info":[{"award-number":["62372248"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Postgraduate Research & Practice Innovation Program of Jiangsu Province","award":["KYCX23_1076"],"award-info":[{"award-number":["KYCX23_1076"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,1,19]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>With the development of the fourth industrial revolution, the importance of data centers has significantly increased. Data centers are widely used in many fields due to their ability to provide efficient, secure, and reliable data storage and processing services. However, with the increasing amount of data, traditional data center networks (DCNs) are currently facing various challenges, prompting academia and industry to propose new DCN architectures. As a dual-port server-based DCN, DPCell has excellent scalability and bisection width, enabling it to meet the demands of large-scale data storage, processing, and computation in the digital revolution. In order to ensure the secure and reliable data communication in the DPCell, this paper designs a disjoint paths communication scheme based on the actual DCN routing requirements. This scheme constructs the optimal number of disjoint paths in DPCell, with a maximum path length of $2^{k}+3$, where $k$ represents the dimension of the DPCell. Furthermore, experiments have verified that the time complexity of this scheme is sublinear, making it more efficient than the current optimal maximum flow algorithm. To a certain extent, this scheme provides DPCell with the required high bandwidth, fault tolerance, and security for data communication.<\/jats:p>","DOI":"10.1093\/comjnl\/bxae091","type":"journal-article","created":{"date-parts":[[2024,9,21]],"date-time":"2024-09-21T05:42:39Z","timestamp":1726897359000},"page":"47-57","source":"Crossref","is-referenced-by-count":3,"title":["Disjoint paths construction algorithm in the data center network DPCell"],"prefix":"10.1093","volume":"68","author":[{"given":"Hui","family":"Dong","sequence":"first","affiliation":[{"name":"School of Computer Science , Nanjing University of Posts and Telecommunications, Nanjing 210003,","place":["China"]}]},{"given":"Huaqun","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Computer Science , Nanjing University of Posts and Telecommunications, Nanjing 210003,","place":["China"]}]},{"given":"Mengjie","family":"Lv","sequence":"additional","affiliation":[{"name":"School of Computer Science , Nanjing University of Posts and Telecommunications, Nanjing 210003,","place":["China"]}]},{"given":"Weibei","family":"Fan","sequence":"additional","affiliation":[{"name":"School of Computer Science , Nanjing University of Posts and Telecommunications, Nanjing 210003,","place":["China"]}]}],"member":"286","published-online":{"date-parts":[[2024,9,20]]},"reference":[{"key":"2025012013014857900_ref1","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1109\/COMST.2016.2626784","article-title":"A survey on data center networking (DCN): infrastructure and operations","volume":"19","author":"Xia","year":"2017","journal-title":"IEEE Commun Surv Tutorials"},{"key":"2025012013014857900_ref2","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1145\/1402946.1402967","article-title":"A scalable, commodity data center network architecture","volume-title":"Proceedings of ACM SIGCOMM\u201908, Seattle, WA, USA, 17\u201322 August","author":"Al-Fares","year":"2008"},{"key":"2025012013014857900_ref3","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1145\/1897852.1897877","article-title":"VL2: a scalable and flexible data center network","volume":"54","author":"Greenberg","year":"2011","journal-title":"Commun ACM"},{"key":"2025012013014857900_ref4","first-page":"75","article-title":"DCell: a scalable and fault-tolerant network structure for data centers","volume-title":"Proceedings of ACM SIGCOMM\u201908, Seattle, WA, USA, 17\u201322 August","author":"Guo","year":"2008"},{"key":"2025012013014857900_ref5","first-page":"63","article-title":"BCube: a high performance, server-centric network architecture for modular data centers","volume-title":"Proceedings of ACM SIGCOMM\u201909, Barcelona, Spain, 16\u201321 August","author":"Guo","year":"2009"},{"key":"2025012013014857900_ref6","doi-asserted-by":"publisher","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\/ACM Trans Netw"},{"key":"2025012013014857900_ref7","doi-asserted-by":"publisher","first-page":"2132","DOI":"10.1016\/j.comnet.2012.02.016","article-title":"DPillar: dual-port server interconnection network for large scale data centers","volume":"56","author":"Liao","year":"2012","journal-title":"Comput Netw"},{"key":"2025012013014857900_ref8","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 Trans Parallel Distrib Syst"},{"key":"2025012013014857900_ref9","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1109\/MNET.011.1500102","article-title":"DPCell: Constructing novel architectures of data center networks on dual-port servers","volume":"35","author":"Li","year":"2021","journal-title":"IEEE Netw"},{"key":"2025012013014857900_ref10","first-page":"32","article-title":"SDN-based multipath routing algorithm for fat-tree data center networks","volume":"4","author":"Nong","year":"2016","journal-title":"Comput Sci"},{"key":"2025012013014857900_ref11","first-page":"3072","article-title":"A simulation and emulation study of SDN-based multipath routing for fat-tree data center networks","volume-title":"Proceedings of the WSC\u201914, Savannah, GA, USA, 7\u201310 December","author":"Jo","year":"2014"},{"key":"2025012013014857900_ref12","first-page":"1","article-title":"Disjoint paths in networks","volume":"4","author":"Iqbal","year":"2015","journal-title":"Wiley Encyclopedia Elect Electron Eng"},{"key":"2025012013014857900_ref13","first-page":"4187","article-title":"Security enhancement through multiple path transmission in ad hoc networks","volume-title":"Proceedings of ICC\u201904, Paris, France, 20\u201324 June","author":"Haniotakis","year":"2004"},{"key":"2025012013014857900_ref14","first-page":"1","article-title":"End-to-end key exchange through disjoint paths in P2P networks","volume":"2","author":"Ahmat","year":"2015","journal-title":"EAI Endorsed Trans Security Safety"},{"key":"2025012013014857900_ref15","first-page":"612","article-title":"Maximum flow and minimum-cost flow in almost-linear time","volume-title":"Proceedings of FOCS\u201922, USA, 31 October \u2013 3 November","author":"Li","year":"2022"},{"key":"2025012013014857900_ref16","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1002\/net.1975.5.1.45","article-title":"On the complexity of combinatorial problems","volume":"5","author":"Karp","year":"1975","journal-title":"Networks"},{"key":"2025012013014857900_ref17","first-page":"119","article-title":"Unit capacity maxflow in almost O(m$^4\/3$) time","volume-title":"Proceedings of FOCS\u201920, USA, 16\u201319 November","author":"Kathuria","year":"2020"},{"key":"2025012013014857900_ref18","first-page":"516","article-title":"Fully dynamic electrical flows: sparse maxflow faster than Goldberg-Rao","volume-title":"Proceedings of FOCS\u201921, USA, 7\u201310 February","author":"Gao","year":"2021"},{"key":"2025012013014857900_ref19","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.jpdc.2016.05.001","article-title":"Vertex-disjoint paths in DCell networks","volume":"96","author":"Wang","year":"2016","journal-title":"J Parallel Distrib Comput"},{"key":"2025012013014857900_ref20","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/j.tcs.2015.09.022","article-title":"An efficient algorithm to construct disjoint path covers of DCell networks","volume":"609","author":"Wang","year":"2016","journal-title":"Theor Comput Sci"},{"key":"2025012013014857900_ref21","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/j.tcs.2019.01.019","article-title":"Disjoint path covers joining prescribed source and sink sets in interval graphs","volume":"776","author":"Park","year":"2019","journal-title":"Theor Comput Sci"},{"key":"2025012013014857900_ref22","doi-asserted-by":"publisher","first-page":"3740","DOI":"10.1109\/TNET.2016.2547438","article-title":"BCCC: an expandable network for data centers","volume":"24","author":"Li","year":"2016","journal-title":"IEEE\/ACM Trans Netw"},{"key":"2025012013014857900_ref23","doi-asserted-by":"publisher","first-page":"481","DOI":"10.3390\/a15120481","article-title":"BCCC disjoint path construction algorithm and fault-tolerant routing algorithm under restricted connectivity","volume":"15","author":"Lu","year":"2022","journal-title":"Algorithms"},{"key":"2025012013014857900_ref24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TR.2024.3371953","article-title":"Fault-tolerant communication in HSDC: ensuring reliable data transmission in smart cities","author":"Dong","year":"2024","journal-title":"IEEE Trans Reliab"},{"key":"2025012013014857900_ref25","doi-asserted-by":"publisher","first-page":"128262","DOI":"10.1016\/j.amc.2023.128262","article-title":"The disjoint path cover in the data center network HSDC with prescribed vertices in each path","volume":"459","author":"He","year":"2023","journal-title":"Appl Math Comput"},{"key":"2025012013014857900_ref26","doi-asserted-by":"publisher","first-page":"2467","DOI":"10.1109\/TC.2023.3251849","article-title":"Disjoint paths construction and fault-tolerant routing in BCube of data center networks","volume":"72","author":"Fan","year":"2023","journal-title":"IEEE Trans Comput"},{"key":"2025012013014857900_ref27","first-page":"1995","article-title":"The constructive algorithm of vertex-disjoint paths in the generalized hypercube under restricted connectivity","volume":"20","author":"Wang","year":"2019","journal-title":"J Internet Technol"},{"key":"2025012013014857900_ref28","doi-asserted-by":"publisher","first-page":"963","DOI":"10.1109\/TR.2021.3140069","article-title":"Fault diagnosis based on subsystem structures of data center network BCube","volume":"71","author":"Lv","year":"2022","journal-title":"IEEE Trans Reliab"},{"key":"2025012013014857900_ref29","doi-asserted-by":"publisher","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":"J Comput Sci Technol"},{"key":"2025012013014857900_ref30","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/j.tcs.2022.04.028","article-title":"Connectivity and constructive algorithms of disjoint paths in dragonfly networks","volume":"922","author":"Wu","year":"2022","journal-title":"Theor Comput Sci"},{"key":"2025012013014857900_ref31","first-page":"1","article-title":"Generalized DCell structure for load-balanced data center networks","volume-title":"Proceedings of INFOCOM IEEE Conference on Computer Communications Workshops, San Diego, CA, USA, 15\u201319 March","author":"Kliegl","year":"2010"}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/68\/1\/47\/59214720\/bxae091.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/68\/1\/47\/59214720\/bxae091.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T13:01:58Z","timestamp":1737378118000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article\/68\/1\/47\/7762873"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,20]]},"references-count":31,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2024,9,20]]},"published-print":{"date-parts":[[2025,1,19]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxae091","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"value":"0010-4620","type":"print"},{"value":"1460-2067","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2025,1]]},"published":{"date-parts":[[2024,9,20]]}}}