{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T16:25:42Z","timestamp":1781022342563,"version":"3.54.1"},"reference-count":26,"publisher":"Wiley","issue":"8","license":[{"start":{"date-parts":[[2012,1,27]],"date-time":"2012-01-27T00:00:00Z","timestamp":1327622400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int J Communication"],"published-print":{"date-parts":[[2013,8]]},"abstract":"<jats:title>SUMMARY<\/jats:title><jats:p>Virtual network (VN) embedding is a major challenge in network virtualization. In this paper, we aim to increase the acceptance ratio of VNs and the revenue of infrastructure providers by optimizing VN embedding costs. We first establish two models for VN embedding: an integer linear programming model for a substrate network that does not support path splitting and a mixed integer programming model when path splitting is supported. Then we propose a unified enhanced particle swarm optimization\u2010based VN embedding algorithm, called VNE\u2010UEPSO, to solve these two models irrespective of the support for path splitting. In VNE\u2010UEPSO, the parameters and operations of the particles are well redefined according to the VN embedding context. To reduce the time complexity of the link mapping stage, we use shortest path algorithm for link mapping when path splitting is unsupported and propose greedy k\u2010shortest paths algorithm for the other case. Furthermore, a large to large and small to small preferred node mapping strategy is proposed to achieve better convergence and load balance of the substrate network. The simulation results show that our algorithm significantly outperforms previous approaches in terms of the VN acceptance ratio and long\u2010term average revenue. Copyright \u00a9 2012 John Wiley &amp; Sons, Ltd.<\/jats:p>","DOI":"10.1002\/dac.1399","type":"journal-article","created":{"date-parts":[[2012,1,27]],"date-time":"2012-01-27T06:56:51Z","timestamp":1327647411000},"page":"1054-1073","source":"Crossref","is-referenced-by-count":107,"title":["A unified enhanced particle swarm optimization\u2010based virtual network embedding algorithm"],"prefix":"10.1002","volume":"26","author":[{"given":"Zhongbao","family":"Zhang","sequence":"first","affiliation":[{"name":"State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications 10 Xi Tu Cheng Road Beijing China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiang","family":"Cheng","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications 10 Xi Tu Cheng Road Beijing China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sen","family":"Su","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications 10 Xi Tu Cheng Road Beijing China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yiwen","family":"Wang","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications 10 Xi Tu Cheng Road Beijing China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kai","family":"Shuang","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications 10 Xi Tu Cheng Road Beijing China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yan","family":"Luo","sequence":"additional","affiliation":[{"name":"Electrical and Computer Engineering University of Massachusetts Lowell One University Ave Lowell MA 01854 USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"311","published-online":{"date-parts":[[2012,1,27]]},"reference":[{"key":"e_1_2_9_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1198255.1198265"},{"key":"e_1_2_9_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2005.136"},{"key":"e_1_2_9_4_1","doi-asserted-by":"crossref","unstructured":"TurnerJ TaylorD.Diversifying the internet.IEEE Global Telecommunications Conference 2005.","DOI":"10.1109\/GLOCOM.2005.1577741"},{"key":"e_1_2_9_5_1","unstructured":"Global Environment for Network Innovations. National Science Foundation https:\/\/2.zoppoz.workers.dev:443\/http\/www.geni.net\/ Aug2005. URLhttps:\/\/2.zoppoz.workers.dev:443\/http\/www.geni.net."},{"key":"e_1_2_9_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2009.5183468"},{"key":"e_1_2_9_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1355734.1355737"},{"key":"e_1_2_9_8_1","doi-asserted-by":"crossref","unstructured":"ZhuY AmmarM.Algorithms for assigning substrate network resources to virtual network components.Proc. IEEE INFOCOM 2006.","DOI":"10.1109\/INFOCOM.2006.322"},{"key":"e_1_2_9_9_1","unstructured":"LuJ TurnerJ.Efficient mapping of virtual networks onto a shared substrate.Technical Report WUCSE\u20102006 Department of Computer Science and Engineering Washington University in St. Louis 2006."},{"key":"e_1_2_9_10_1","doi-asserted-by":"crossref","unstructured":"HouidiI LouatiW ZeghlacheD.A distributed virtual network mapping algorithm.Proceedings of IEEE ICC 2008;5634\u20135640.","DOI":"10.1109\/ICC.2008.1056"},{"key":"e_1_2_9_11_1","doi-asserted-by":"crossref","unstructured":"FanJ AmmarM.Dynamic topology configuration in service overlay networks: a study of reconfiguration policies.Proc. IEEE INFOCOM 2006.","DOI":"10.1109\/INFOCOM.2006.139"},{"key":"e_1_2_9_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1971162.1971168"},{"key":"e_1_2_9_13_1","doi-asserted-by":"crossref","unstructured":"ChowdhuryN RahmanM BoutabaR.Virtual network embedding with coordinated node and link mapping.IEEE INFOCOM 2009.","DOI":"10.1109\/INFCOM.2009.5061987"},{"key":"e_1_2_9_14_1","volume-title":"Theory of linear and integer programming","author":"Schrijver A","year":"1998"},{"key":"e_1_2_9_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78295-7_2"},{"key":"e_1_2_9_16_1","volume-title":"Handbook of Genetic Algorithms","author":"Davis L","year":"1991"},{"key":"e_1_2_9_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01009452"},{"issue":"2","key":"e_1_2_9_18_1","first-page":"129","article-title":"Evolutionary programming techniques for constrained optimization problems","volume":"1","author":"Kim J","year":"2002","journal-title":"Evolutionary Computation, IEEE Transactions on"},{"key":"e_1_2_9_19_1","doi-asserted-by":"crossref","unstructured":"KennedyJ EberhartR.et al.Particle swarm optimization.Proceedings of IEEE International Conference on Neural Networks vol.4 Perth Australia 1995;1942\u20131948.","DOI":"10.1109\/ICNN.1995.488968"},{"key":"e_1_2_9_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPWRS.2007.907445"},{"key":"e_1_2_9_21_1","doi-asserted-by":"crossref","unstructured":"KennedyJ EberhartR.A discrete binary version of the particle swarm algorithm.IEEE International Conference on Systems Man and Cybernetics Vol.5 Orlando 1997;4104\u20134108.","DOI":"10.1109\/ICSMC.1997.637339"},{"key":"e_1_2_9_22_1","first-page":"1583","volume-title":"Machine Learning and Cybernetics, 2003 International Conference on","author":"Wang K","year":"2004"},{"key":"e_1_2_9_23_1","doi-asserted-by":"crossref","unstructured":"EppsteinD.Finding the k shortest paths.Proceedings of the IEEE Symposium on Foundations of Computer Science Santa Fe 1994;154\u2013165.","DOI":"10.1109\/SFCS.1994.365697"},{"key":"e_1_2_9_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1328911.1328924"},{"key":"e_1_2_9_25_1","doi-asserted-by":"crossref","unstructured":"HeJ Zhang-ShenR LiY LeeC RexfordJ ChiangM.DaVinci: dynamically adaptive virtual networks for a customized Internet.Proceedings of the 2008 ACM CONEXT Conference ACM 2008;1\u201312.","DOI":"10.1145\/1544012.1544027"},{"key":"e_1_2_9_26_1","doi-asserted-by":"crossref","unstructured":"LischkaJ KarlH.A virtual network mapping algorithm based on subgraph isomorphism detection.Proceedings of the 1st ACM Workshop on Virtualized Infrastructure Systems and Architectures ACM 2009;81\u201388.","DOI":"10.1145\/1592648.1592662"},{"key":"e_1_2_9_27_1","unstructured":"CordellaL FoggiaP SansoneC VentoM.An improved algorithm for matching large graphs.3rd IAPR\u2010TC15 Workshop on Graph\u2010based Representations in Pattern Recognition 2001;149\u2013159."}],"container-title":["International Journal of Communication Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fdac.1399","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/dac.1399","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T09:27:28Z","timestamp":1742376448000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/onlinelibrary.wiley.com\/doi\/10.1002\/dac.1399"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,1,27]]},"references-count":26,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2013,8]]}},"alternative-id":["10.1002\/dac.1399"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1002\/dac.1399","archive":["Portico"],"relation":{},"ISSN":["1074-5351","1099-1131"],"issn-type":[{"value":"1074-5351","type":"print"},{"value":"1099-1131","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,1,27]]}}}