{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,7]],"date-time":"2025-08-07T21:29:57Z","timestamp":1754602197847,"version":"3.37.3"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,5,25]],"date-time":"2024-05-25T00:00:00Z","timestamp":1716595200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,5,25]],"date-time":"2024-05-25T00:00:00Z","timestamp":1716595200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61861013","61861013","61861013","61861013"],"award-info":[{"award-number":["61861013","61861013","61861013","61861013"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100013091","name":"Science and Technology Major Project of Guangxi","doi-asserted-by":"publisher","award":["AA18118031","AA18118031","AA18118031","AA18118031"],"award-info":[{"award-number":["AA18118031","AA18118031","AA18118031","AA18118031"]}],"id":[{"id":"10.13039\/501100013091","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Guangxi Natural Science Foundation","award":["2018GXNSFAA281318","2018GXNSFAA281318","2018GXNSFAA281318","2018GXNSFAA281318"],"award-info":[{"award-number":["2018GXNSFAA281318","2018GXNSFAA281318","2018GXNSFAA281318","2018GXNSFAA281318"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cloud Comp"],"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Digital twin network (DTN) as an emerging network paradigm, have garnered growing attention. For large-scale networks, a crucial problem is how to effectively map physical networks onto the infrastructure platform of DTN. To address this issue, we propose a heuristic method of the adaptive boundary whale optimization algorithm (ABWOA) to solve the digital twin network construction problem, improving the efficiency and reducing operational costs of DTN. Extensive comparison experiments are conducted between ABWOA and various algorithms such as genetic algorithm, particle swarm optimization, artificial bee colony, differential evolution algorithm, moth search algorithm and original whale optimization algorithm. The experimental results show that ABWOA is superior to other algorithms in terms of solution quality, convergence speed, and time cost. It can solve the digital twin network construction problem more effectively.<\/jats:p>","DOI":"10.1186\/s13677-024-00667-z","type":"journal-article","created":{"date-parts":[[2024,5,25]],"date-time":"2024-05-25T06:02:04Z","timestamp":1716616924000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["ABWOA: adaptive boundary whale optimization algorithm for large-scale digital twin network construction"],"prefix":"10.1186","volume":"13","author":[{"given":"Hao","family":"Feng","sequence":"first","affiliation":[]},{"given":"Kun","family":"Cao","sequence":"additional","affiliation":[]},{"given":"Gan","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Hao","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,5,25]]},"reference":[{"issue":"18","key":"667_CR1","doi-asserted-by":"publisher","first-page":"13789","DOI":"10.1109\/JIOT.2021.3079510","volume":"8","author":"Y Wu","year":"2021","unstructured":"Wu Y, Zhang K, Zhang Y (2021) Digital twin networks: a survey. IEEE Internet Things J 8(18):13789\u201313804","journal-title":"IEEE Internet Things J"},{"issue":"10","key":"667_CR2","doi-asserted-by":"publisher","first-page":"4692","DOI":"10.1109\/TWC.2019.2927312","volume":"18","author":"R Dong","year":"2019","unstructured":"Dong R, She C, Hardjawana W, Li Y, Vucetic B (2019) Deep learning for hybrid 5g services in mobile edge computing systems: learn from a digital twin. IEEE Trans Wirel Commun 18(10):4692\u20134707","journal-title":"IEEE Trans Wirel Commun"},{"key":"667_CR3","doi-asserted-by":"publisher","unstructured":"Shi G, Shen X, Xiao F, He Y (2023) DANTD: a deep abnormal network traffic detection model for security of industrial internet of things using high-order features. IEEE Internet Things J 10(24):21143-21153. https:\/\/doi.org\/10.1109\/JIOT.2023.3253777","DOI":"10.1109\/JIOT.2023.3253777"},{"issue":"7","key":"667_CR4","doi-asserted-by":"publisher","first-page":"4968","DOI":"10.1109\/TII.2020.3016320","volume":"17","author":"Y Dai","year":"2020","unstructured":"Dai Y, Zhang K, Maharjan S, Zhang Y (2020) Deep reinforcement learning for stochastic computation offloading in digital twin networks. IEEE Trans Ind Inform 17(7):4968\u20134977","journal-title":"IEEE Trans Ind Inform"},{"issue":"4","key":"667_CR5","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1007\/s10922-020-09517-0","volume":"28","author":"A Clemm","year":"2020","unstructured":"Clemm A, Zhani MF, Boutaba R (2020) Network management 2030: Operations and control of network 2030 services. J Netw Syst Manag 28(4):721\u2013750","journal-title":"J Netw Syst Manag"},{"issue":"2","key":"667_CR6","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1109\/MCOM.001.2000343","volume":"59","author":"HX Nguyen","year":"2021","unstructured":"Nguyen HX, Trestian R, To D, Tatipamula M (2021) Digital twin for 5g and beyond. IEEE Commun Mag 59(2):10\u201315","journal-title":"IEEE Commun Mag"},{"key":"667_CR7","unstructured":"Almasan P, Ferriol-Galm\u00e9s M, Paillisse J, Su\u00e1rez-Varela J, Perino D, L\u00f3pez D, Perales AAP, Harvey P, Ciavaglia L, Wong L, et\u00a0al (2022) Digital twin network: Opportunities and challenges. arXiv preprint arXiv:2201.01144"},{"issue":"1","key":"667_CR8","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1109\/MCOM.001.21143","volume":"60","author":"LU Khan","year":"2022","unstructured":"Khan LU, Saad W, Niyato D, Han Z, Hong CS (2022) Digital-twin-enabled 6g: Vision, architectural trends, and future directions. IEEE Commun Mag 60(1):74\u201380","journal-title":"IEEE Commun Mag"},{"issue":"3","key":"667_CR9","first-page":"569","volume":"47","author":"S Tao","year":"2021","unstructured":"Tao S, Cheng Z, Xiao-Dong D, Lu L, Dan-Yang C, Hong-Wei Y, Yan-Hong Z, Chao L, Qin L, Xiao W et al (2021) Digital twin network (dtn): concepts, architecture, and key technologies. Acta Autom Sin 47(3):569\u2013582","journal-title":"Acta Autom Sin"},{"key":"667_CR10","unstructured":"Grieves M (2014) Digital Twin: Manufacturing Excellence through Virtual Factory Replication. https:\/\/www.3ds.com\/fileadmin\/PRODUCTS-SERVICES\/DELMIA\/PDF\/Whitepaper\/DELMIA-APRISO-Digital-Twin-Whitepaper.pdf. Accessed 7 Jan 2024"},{"key":"667_CR11","first-page":"85","volume-title":"Digital twin: Mitigating unpredictable, undesirable emergent behavior in complex systems","author":"M Grieves","year":"2017","unstructured":"Grieves M, Vickers J (2017) Digital twin: Mitigating unpredictable, undesirable emergent behavior in complex systems. New Find Approaches, Transdiscipl Perspect Complex Syst, pp 85\u2013113"},{"issue":"1","key":"667_CR12","first-page":"1","volume":"24","author":"F Tao","year":"2018","unstructured":"Tao F, Liu W, Liu J, Liu X, Liu Q, Qu T, Hu T, Zhang Z, Xiang F, Xu W et al (2018) Digital twin and its potential application exploration. Comput Integr Manuf Syst 24(1):1\u201318","journal-title":"Comput Integr Manuf Syst"},{"issue":"1","key":"667_CR13","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/s10586-019-02928-y","volume":"23","author":"A Jyoti","year":"2020","unstructured":"Jyoti A, Shrimali M (2020) Dynamic provisioning of resources based on load balancing and service broker policy in cloud computing. Clust Comput 23(1):377\u2013395","journal-title":"Clust Comput"},{"key":"667_CR14","doi-asserted-by":"publisher","first-page":"18285","DOI":"10.1007\/s00521-020-04955-y","volume":"32","author":"M Kumar","year":"2020","unstructured":"Kumar M, Sharma SC, Goel S, Mishra SK, Husain A (2020) Autonomic cloud resource provisioning and scheduling using meta-heuristic algorithm. Neural Comput & Applic 32:18285\u201318303","journal-title":"Neural Comput & Applic"},{"issue":"5","key":"667_CR15","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1109\/MNET.011.1900587","volume":"34","author":"L Zhao","year":"2020","unstructured":"Zhao L, Han G, Li Z, Shu L (2020) Intelligent digital twin-based software-defined vehicular networks. IEEE Netw 34(5):178\u2013184","journal-title":"IEEE Netw"},{"issue":"9","key":"667_CR16","doi-asserted-by":"publisher","first-page":"6611","DOI":"10.1109\/JIOT.2021.3113577","volume":"9","author":"P Krishnan","year":"2021","unstructured":"Krishnan P, Jain K, Buyya R, Vijayakumar P, Nayyar A, Bilal M, Song H (2021) Mud-based behavioral profiling security framework for software-defined iot networks. IEEE Internet Things J 9(9):6611\u20136622","journal-title":"IEEE Internet Things J"},{"issue":"2","key":"667_CR17","doi-asserted-by":"publisher","first-page":"1405","DOI":"10.1109\/TII.2021.3088407","volume":"18","author":"K Zhang","year":"2021","unstructured":"Zhang K, Cao J, Zhang Y (2021) Adaptive digital twin and multiagent deep reinforcement learning for vehicular edge computing and networks. IEEE Trans Ind Inform 18(2):1405\u20131413","journal-title":"IEEE Trans Ind Inform"},{"key":"667_CR18","unstructured":"Hexiong C, Jiaping W, Yunkai W, Wei G, Feilu H, Zhengxiong M, Ning Y (2022) Variable granularity digital twin construction technology for software defined network. Appl Res Comput\/Jisuanji Yingyong Yanjiu 39(10):3101-3107"},{"issue":"9","key":"667_CR19","doi-asserted-by":"publisher","first-page":"9850","DOI":"10.1109\/TPEL.2020.2971775","volume":"35","author":"M Milton","year":"2020","unstructured":"Milton M, De La OC, Ginn HL, Benigni A (2020) Controller-embeddable probabilistic real-time digital twins for power electronic converter diagnostics. IEEE Trans Power Electron 35(9):9850\u20139864","journal-title":"IEEE Trans Power Electron"},{"key":"667_CR20","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.apmt.2018.11.003","volume":"14","author":"T Mukherjee","year":"2019","unstructured":"Mukherjee T, DebRoy T (2019) A digital twin for rapid qualification of 3d printed metallic components. Appl Mater Today 14:59\u201365","journal-title":"Appl Mater Today"},{"key":"667_CR21","doi-asserted-by":"crossref","unstructured":"Schluse M, Priggemeyer M, Atorf L, Rossmann J (2018) Experimentable digital twins\u2014streamlining simulation-based systems engineering for industry 4.0. IEEE Trans Ind Inform 14(4):1722\u20131731","DOI":"10.1109\/TII.2018.2804917"},{"key":"667_CR22","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.cosrev.2016.12.001","volume":"24","author":"HI Christensen","year":"2017","unstructured":"Christensen HI, Khan A, Pokutta S, Tetali P (2017) Approximation and online algorithms for multidimensional bin packing: A survey. Comput Sci Rev 24:63\u201379","journal-title":"Comput Sci Rev"},{"key":"667_CR23","unstructured":"Christensen HI, Khan A, Pokutta S, Tetali P (2016) Multidimensional bin packing and other related problems: a survey. https:\/\/tetali.math.gatech.edu\/PUBLIS\/CKPT.pdf. Accessed 2 Jan 2024"},{"issue":"1\u20132","key":"667_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3233\/FI-2013-822","volume":"124","author":"M Hidalgo-Herrero","year":"2013","unstructured":"Hidalgo-Herrero M, Rabanal P, Rodriguez I, Rubio F (2013) Comparing problem solving strategies for np-hard optimization problems. Fundam Informaticae 124(1\u20132):1\u201325","journal-title":"Fundam Informaticae"},{"key":"667_CR25","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.advengsoft.2016.01.008","volume":"95","author":"S Mirjalili","year":"2016","unstructured":"Mirjalili S, Lewis A (2016) The whale optimization algorithm. Adv Eng Softw 95:51\u201367","journal-title":"Adv Eng Softw"},{"issue":"3","key":"667_CR26","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1109\/TIP.2010.2076294","volume":"20","author":"MV Afonso","year":"2010","unstructured":"Afonso MV, Bioucas-Dias JM, Figueiredo MA (2010) An augmented lagrangian approach to the constrained optimization formulation of imaging inverse problems. IEEE Trans Image Process 20(3):681\u2013695","journal-title":"IEEE Trans Image Process"},{"issue":"1","key":"667_CR27","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s10589-020-00204-z","volume":"77","author":"G Cocchi","year":"2020","unstructured":"Cocchi G, Lapucci M (2020) An augmented lagrangian algorithm for multi-objective optimization. Comput Optim Appl 77(1):29\u201356","journal-title":"Comput Optim Appl"},{"key":"667_CR28","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.advengsoft.2019.03.008","volume":"132","author":"A Bahreininejad","year":"2019","unstructured":"Bahreininejad A (2019) Improving the performance of water cycle algorithm using augmented lagrangian method. Adv Eng Softw 132:55\u201364","journal-title":"Adv Eng Softw"},{"key":"667_CR29","unstructured":"Microsoft (2019) Azure vm packing trace. https:\/\/github.com\/Azure\/AzurePublicDataset. Accessed 16 Jan 2024"},{"key":"667_CR30","unstructured":"Fujimoto RM, Perumalla K, Park A, Wu H, Ammar MH, Riley GF (2003) Large-scale network simulation: how big? how fast? In: 11th IEEE\/ACM International Symposium on Modeling, Analysis and Simulation of Computer Telecommunications Systems, 2003. MASCOTS 2003. IEEE, pp 116\u2013123"},{"key":"667_CR31","doi-asserted-by":"publisher","first-page":"133577","DOI":"10.1109\/ACCESS.2020.3010313","volume":"8","author":"Z Wang","year":"2020","unstructured":"Wang Z, Ding H, Li B, Bao L, Yang Z (2020) An energy efficient routing protocol based on improved artificial bee colony algorithm for wireless sensor networks. IEEE Access 8:133577\u2013133596","journal-title":"IEEE Access"},{"key":"667_CR32","doi-asserted-by":"publisher","first-page":"5277","DOI":"10.1007\/s00500-020-05527-x","volume":"25","author":"W Deng","year":"2021","unstructured":"Deng W, Shang S, Cai X, Zhao H, Song Y, Xu J (2021) An improved differential evolution algorithm and its application in optimization problem. Soft Comput 25:5277\u20135298","journal-title":"Soft Comput"},{"key":"667_CR33","first-page":"43","volume-title":"Genetic algorithm","author":"S Mirjalili","year":"2019","unstructured":"Mirjalili S, Mirjalili S (2019) Genetic algorithm. Theory Appl, Evol Algoritm Neural Netw, pp 43\u201355"},{"issue":"2","key":"667_CR34","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s12293-016-0212-3","volume":"10","author":"GG Wang","year":"2018","unstructured":"Wang GG (2018) Moth search algorithm: a bio-inspired metaheuristic algorithm for global optimization problems. Memetic Comput 10(2):151\u2013164","journal-title":"Memetic Comput"},{"key":"667_CR35","doi-asserted-by":"publisher","unstructured":"Zhang Y, Wang S, Ji G, et al (2015) A comprehensive survey on particle swarm optimization algorithm and its applications. Math Probl Eng 2015:1-38. https:\/\/doi.org\/10.1155\/2015\/931256","DOI":"10.1155\/2015\/931256"}],"container-title":["Journal of Cloud Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13677-024-00667-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s13677-024-00667-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13677-024-00667-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,25]],"date-time":"2024-05-25T06:03:31Z","timestamp":1716617011000},"score":1,"resource":{"primary":{"URL":"https:\/\/journalofcloudcomputing.springeropen.com\/articles\/10.1186\/s13677-024-00667-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,25]]},"references-count":35,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2024,12]]}},"alternative-id":["667"],"URL":"https:\/\/doi.org\/10.1186\/s13677-024-00667-z","relation":{},"ISSN":["2192-113X"],"issn-type":[{"type":"electronic","value":"2192-113X"}],"subject":[],"published":{"date-parts":[[2024,5,25]]},"assertion":[{"value":"15 March 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 May 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 May 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"The authors declare no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"110"}}