{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,30]],"date-time":"2025-03-30T04:11:04Z","timestamp":1743307864470,"version":"3.40.3"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T00:00:00Z","timestamp":1742947200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T00:00:00Z","timestamp":1742947200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100004480","name":"Natural Science Foundation of Shanxi Province","doi-asserted-by":"publisher","award":["202103021224058"],"award-info":[{"award-number":["202103021224058"]}],"id":[{"id":"10.13039\/501100004480","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"crossref","award":["12371356"],"award-info":[{"award-number":["12371356"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Postdoctoral Research Grant in Henan Province","award":["HN2022148"],"award-info":[{"award-number":["HN2022148"]}]},{"DOI":"10.13039\/501100006407","name":"Natural Science Foundation of Henan Province","doi-asserted-by":"publisher","award":["242300420645"],"award-info":[{"award-number":["242300420645"]}],"id":[{"id":"10.13039\/501100006407","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"DOI":"10.1007\/s11227-025-07064-6","type":"journal-article","created":{"date-parts":[[2025,3,29]],"date-time":"2025-03-29T14:56:24Z","timestamp":1743260184000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Min-min edge-disjoint path pairs with constraints on common nodes"],"prefix":"10.1007","volume":"81","author":[{"given":"Shanshan","family":"Shan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shurong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lin","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dongyue","family":"Liang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weihua","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuli","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,3,26]]},"reference":[{"key":"7064_CR1","doi-asserted-by":"crossref","unstructured":"Gomes T, Fernandes L (2010) Obtaining a srlg-disjoint path pair of min-sum cost. In: Proceedings of the International Congress on Ultra Modern Telecommunications and Control Systems, pp. 582\u2013588","DOI":"10.1109\/ICUMT.2010.5676578"},{"issue":"3","key":"7064_CR2","doi-asserted-by":"crossref","first-page":"2598","DOI":"10.1109\/TNSM.2023.3237832","volume":"20","author":"BL Tao","year":"2023","unstructured":"Tao BL, Xiao MY, Zhao JY (2023) Minimum-weight link-disjoint paths with a bounded number of shared nodes. IEEE Trans Netw Serv Manag 20(3):2598\u20132610","journal-title":"IEEE Trans Netw Serv Manag"},{"issue":"3","key":"7064_CR3","doi-asserted-by":"crossref","first-page":"1110","DOI":"10.1109\/TNET.2018.2823912","volume":"26","author":"J Yallouz","year":"2018","unstructured":"Yallouz J, Rottenstreich O, Babarczi P et al (2018) Minimum-weight link-disjoint node-\"somewhat disjoint\" paths. IEEE\/ACM Trans Netw 26(3):1110\u20131122","journal-title":"IEEE\/ACM Trans Netw"},{"key":"7064_CR4","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/j.tcs.2021.08.009","volume":"886","author":"YY Deng","year":"2021","unstructured":"Deng YY, Guo LK, Liao KW et al (2021) On finding maximum disjoint paths with different colors: computational complexity and practical LP-based algorithms. Theor Comput Sci 886:157\u2013168","journal-title":"Theor Comput Sci"},{"key":"7064_CR5","doi-asserted-by":"crossref","unstructured":"Guo LK, Deng YY, Liao KW, et\u00a0al (2018) A fast algorithm for optimally finding partially disjoint shortest paths. In: Proceedings of the 27th International Joint Conference on Artificial Intelligence, pp. 1456\u20131462","DOI":"10.24963\/ijcai.2018\/202"},{"key":"7064_CR6","unstructured":"Xu DH, Chen Y, Xiong YZ, et\u00a0al (2004) On finding disjoint paths in single and dual link cost networks. In: IEEE INFOCOM 2004, vol\u00a01. IEEE"},{"issue":"7","key":"7064_CR7","doi-asserted-by":"crossref","first-page":"970","DOI":"10.1109\/68.681287","volume":"10","author":"WS Hu","year":"1998","unstructured":"Hu WS, Zeng QJ (1998) Multicasting optical cross connects employing splitter-and-delivery switch. IEEE Photon Technol Lett 10(7):970\u2013972","journal-title":"IEEE Photon Technol Lett"},{"key":"7064_CR8","unstructured":"Xi K, Liu YL, Chao HJ (2011) Enabling flow-based routing control in data center networks using probe and ECMP. In: IEEE Conference on Computer Communications Workshops. IEEE, pp. 608\u2013613"},{"key":"7064_CR9","doi-asserted-by":"crossref","first-page":"109989","DOI":"10.1016\/j.comnet.2023.109989","volume":"235","author":"T Wang","year":"2023","unstructured":"Wang T, Fan X, Cheng K et al (2023) Parameterized deep reinforcement learning with hybrid action space for energy efficient data center networks. Comput Netw 235:109989","journal-title":"Comput Netw"},{"key":"7064_CR10","doi-asserted-by":"crossref","unstructured":"Kliazovich D, Arzo ST, Granelli F, et\u00a0al (2013) Accounting for load variation in energy-efficient data centers. In: Proceedings of the IEEE International Conference on Communications (ICC), pp. 2561\u20132566","DOI":"10.1109\/ICC.2013.6654920"},{"issue":"11","key":"7064_CR11","doi-asserted-by":"crossref","first-page":"9662","DOI":"10.1109\/JIOT.2023.3234582","volume":"10","author":"XH Cao","year":"2023","unstructured":"Cao XH, Wang J, Cheng Y et al (2023) Optimal sleep scheduling for energy-efficient AOI optimization in industrial internet of things. IEEE Internet Things J 10(11):9662\u20139674","journal-title":"IEEE Internet Things J"},{"issue":"3","key":"7064_CR12","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1016\/j.dcan.2022.01.006","volume":"8","author":"Y Tripathi","year":"2022","unstructured":"Tripathi Y, Prakash A, Tripathi R (2022) A novel slot scheduling technique for duty-cycle based data transmission for wireless sensor network. Digit Commun Netw 8(3):351\u2013358","journal-title":"Digit Commun Netw"},{"issue":"2","key":"7064_CR13","doi-asserted-by":"crossref","first-page":"2057","DOI":"10.1109\/TCC.2022.3181890","volume":"11","author":"ZL Zha","year":"2023","unstructured":"Zha ZL, Wang A, Guo Y et al (2023) Towards software defined measurement in data centers: a comparative study of designs, implementation, and evaluation. IEEE Trans Cloud Comput 11(2):2057\u20132070","journal-title":"IEEE Trans Cloud Comput"},{"key":"7064_CR14","doi-asserted-by":"crossref","first-page":"38458","DOI":"10.1109\/ACCESS.2022.3166154","volume":"10","author":"YW Chan","year":"2022","unstructured":"Chan YW, Fathoni H, Yen HY et al (2022) Implementation of a cluster-based heterogeneous edge computing system for resource monitoring and performance evaluation. IEEE Access 10:38458\u201338471","journal-title":"IEEE Access"},{"issue":"5","key":"7064_CR15","doi-asserted-by":"crossref","first-page":"1339","DOI":"10.1109\/JSAC.2021.3065093","volume":"39","author":"DJ Guo","year":"2021","unstructured":"Guo DJ, Hou IH (2021) Scheduling real-time information-update flows for the optimal confidence in estimation. IEEE J Sel Areas Commun 39(5):1339\u20131351","journal-title":"IEEE J Sel Areas Commun"},{"key":"7064_CR16","doi-asserted-by":"crossref","unstructured":"Yan LC, Li Y, Song H, et\u00a0al (2021) Edge computing based data center monitoring. In: Proceedings of the IEEE International Conference on Edge Computing (EDGE), pp. 17\u201324","DOI":"10.1109\/EDGE53862.2021.00012"},{"issue":"1","key":"7064_CR17","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1109\/TCAD.2024.3428473","volume":"44","author":"LB Deng","year":"2025","unstructured":"Deng LB, Zeng G, Kurachi R et al (2025) Design synthesis and optimization strategy for low delay and high bandwidth utilization in time-sensitive networking. IEEE Trans Comput Aided Des Integr Circuits Syst 44(1):91\u2013104","journal-title":"IEEE Trans Comput Aided Des Integr Circuits Syst"},{"issue":"4","key":"7064_CR18","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1145\/2043164.2018467","volume":"41","author":"C Raiciu","year":"2011","unstructured":"Raiciu C, Barre S, Pluntke C et al (2011) Improving datacenter performance and robustness with multipath TCP. Comput Commun Rev 41(4):266\u2013277","journal-title":"Comput Commun Rev"},{"key":"7064_CR19","doi-asserted-by":"crossref","unstructured":"Rostami MJ, Khorsandi S, Khodaparast AA (2007) Cose: A srlg-disjoint routing algorithm. In: The 4th European Conference on Universal Multiservice Networks. IEEE, pp. 86\u201392","DOI":"10.1109\/ECUMN.2007.15"},{"issue":"3","key":"7064_CR20","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1109\/TCOMM.2003.809779","volume":"51","author":"JQ Hu","year":"2003","unstructured":"Hu JQ (2003) Diverse routing in optical mesh networks. IEEE Trans Commun 51(3):489\u2013494","journal-title":"IEEE Trans Commun"},{"key":"7064_CR21","doi-asserted-by":"crossref","unstructured":"Kodialam M, Lakshman TV (2000) Dynamic routing of bandwidth guaranteed tunnels with restoration. In: The 19th Annual Joint Conference of the IEEE Computer and Communications Societies, vol\u00a02. IEEE, pp. 902\u2013911","DOI":"10.1109\/INFCOM.2000.832265"},{"key":"7064_CR22","doi-asserted-by":"crossref","unstructured":"Qiao CM, Xu DH (2002) Distributed partial information management (dpim) schemes for survivable networks. 1. In: The 21st Annual Joint Conference of the IEEE Computer and Communications Societies, vol\u00a01. IEEE, pp. 302\u2013311","DOI":"10.1109\/INFCOM.2002.1019272"},{"key":"7064_CR23","doi-asserted-by":"crossref","unstructured":"Matsuura H, Koshiji K, Yokoi H, et\u00a0al (2023) Finding srlg-disjoint primary and backup route pairs using k-SPF algorithm in optical networks. In: IEEE Global Communications Conference. IEEE, pp. 2141\u20132147","DOI":"10.1109\/GLOBECOM54140.2023.10436808"},{"key":"7064_CR24","doi-asserted-by":"crossref","unstructured":"Xie K, Tao H, Wang X, et\u00a0al (2018) Divide and conquer for fast SRLG disjoint routing. In: The 48th Annual IEEE\/IFIP International Conference on Dependable Systems and Networks. IEEE, pp. 622\u2013633","DOI":"10.1109\/DSN.2018.00069"},{"issue":"2","key":"7064_CR25","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1137\/S0097539795290477","volume":"28","author":"David Eppstein","year":"1998","unstructured":"Eppstein David (1998) Finding the k shortest paths. SIAM J Comput 28(2):652\u2013673","journal-title":"SIAM J Comput"},{"issue":"4","key":"7064_CR26","doi-asserted-by":"crossref","first-page":"919","DOI":"10.1109\/TC.2021.3065527","volume":"71","author":"VK Akram","year":"2021","unstructured":"Akram VK (2021) Distributed detection of minimum cuts in wireless multi-hop networks. IEEE Trans Comput 71(4):919\u2013932","journal-title":"IEEE Trans Comput"},{"issue":"6","key":"7064_CR27","doi-asserted-by":"crossref","first-page":"3870","DOI":"10.1109\/TIT.2022.3145232","volume":"68","author":"GW Dai","year":"2022","unstructured":"Dai GW, Guo LK, Gutin G et al (2022) Iterative message passing algorithm for vertex-disjoint shortest paths. IEEE Trans Inf Theory 68(6):3870\u20133878","journal-title":"IEEE Trans Inf Theory"},{"issue":"9","key":"7064_CR28","doi-asserted-by":"crossref","first-page":"2467","DOI":"10.1109\/TC.2023.3251849","volume":"72","author":"WB Fan","year":"2023","unstructured":"Fan WB, Xiao F, Cai H et al (2023) Disjoint paths construction and fault-tolerant routing in BCube of data center networks. IEEE Trans Comput 72(9):2467\u20132481","journal-title":"IEEE Trans Comput"},{"issue":"2","key":"7064_CR29","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1109\/JCN.2020.000004","volume":"22","author":"AQ Hou","year":"2020","unstructured":"Hou AQ, Wu CQ, Zuo LD et al (2020) Bandwidth scheduling for big data transfer with two variable node-disjoint paths. J Commun Netw 22(2):130\u2013144","journal-title":"J Commun Netw"},{"key":"7064_CR30","doi-asserted-by":"crossref","unstructured":"W\u0142odarczyk M, Zehavi M (2023) Planar disjoint paths, treewidth, and kernels. In: The 64th Annual Symposium on Foundations of Computer Science. IEEE, pp. 649\u2013662","DOI":"10.1109\/FOCS57990.2023.00044"},{"issue":"12","key":"7064_CR31","doi-asserted-by":"crossref","first-page":"2381","DOI":"10.1016\/j.comnet.2008.04.017","volume":"52","author":"P Datta","year":"2008","unstructured":"Datta P, Somani AK (2008) Graph transformation approaches for diverse routing in shared risk resource group (SRRG) failures. Comput Netw 52(12):2381\u20132394","journal-title":"Comput Netw"},{"issue":"6","key":"7064_CR32","doi-asserted-by":"crossref","first-page":"3051","DOI":"10.1109\/TNET.2023.3276815","volume":"31","author":"B Vass","year":"2023","unstructured":"Vass B, B\u00e9rczi-Kov\u00e1cs ER, Barab\u00e1s \u00c1 et al (2023) A whirling dervish: polynomial-time algorithm for the regional SRLG-disjoint paths problem. IEEE\/ACM Trans Netw 31(6):3051\u20133062","journal-title":"IEEE\/ACM Trans Netw"},{"key":"7064_CR33","doi-asserted-by":"crossref","first-page":"1067","DOI":"10.1007\/s10922-014-9332-6","volume":"23","author":"T Gomes","year":"2015","unstructured":"Gomes T, Soares M, Craveirinha J et al (2015) Two heuristics for calculating a shared risk link group disjoint set of paths of min-sum cost. J Netw Syst Manag 23:1067\u20131103","journal-title":"J Netw Syst Manag"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-025-07064-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-025-07064-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-025-07064-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,29]],"date-time":"2025-03-29T14:57:04Z","timestamp":1743260224000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-025-07064-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,26]]},"references-count":33,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2025,4]]}},"alternative-id":["7064"],"URL":"https:\/\/doi.org\/10.1007\/s11227-025-07064-6","relation":{},"ISSN":["1573-0484"],"issn-type":[{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,3,26]]},"assertion":[{"value":"12 February 2025","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 March 2025","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"662"}}