{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T09:36:45Z","timestamp":1766137005287,"version":"build-2065373602"},"reference-count":24,"publisher":"MDPI AG","issue":"5","license":[{"start":{"date-parts":[[2018,4,25]],"date-time":"2018-04-25T00:00:00Z","timestamp":1524614400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Science Foundation of China","doi-asserted-by":"publisher","award":["61562089"],"award-info":[{"award-number":["61562089"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>For embedding virtual networks into a large scale substrate network, a massive amount of time is needed to search the resource space even if the scale of the virtual network is small. The complexity of searching the candidate resource will be reduced if candidates in substrate network can be located in a group of particularly matched areas, in which the resource distribution and communication structure of the substrate network exhibit a maximal similarity with the objective virtual network. This work proposes to discover the optimally suitable resource in a substrate network corresponding to the objective virtual network through comparison of their graph entropies. Aiming for this, the substrate network is divided into substructures referring to the importance of nodes in it, and the entropies of these substructures are calculated. The virtual network will be embedded preferentially into the substructure with the closest entropy if the substrate resource satisfies the demand of the virtual network. The experimental results validate that the efficiency of virtual network embedding can be improved through our proposal. Simultaneously, the quality of embedding has been guaranteed without significant degradation.<\/jats:p>","DOI":"10.3390\/e20050315","type":"journal-article","created":{"date-parts":[[2018,4,25]],"date-time":"2018-04-25T11:15:39Z","timestamp":1524654939000},"page":"315","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Virtual Network Embedding Based on Graph Entropy"],"prefix":"10.3390","volume":"20","author":[{"given":"Jingjing","family":"Zhang","sequence":"first","affiliation":[{"name":"School of Information, Yunnan University of Finance and Economics, Kunming 650221, China"}]},{"given":"Chenggui","family":"Zhao","sequence":"additional","affiliation":[{"name":"School of Information, Yunnan University of Finance and Economics, Kunming 650221, China"}]},{"given":"Honggang","family":"Wu","sequence":"additional","affiliation":[{"name":"School of Continuing Education, Yunnan University of Finance and Economics, Kunming 650221, China"}]},{"given":"Minghui","family":"Lin","sequence":"additional","affiliation":[{"name":"School of Information, Yunnan University of Finance and Economics, Kunming 650221, China"}]},{"given":"Ren","family":"Duan","sequence":"additional","affiliation":[{"name":"School of Information, Yunnan University of Finance and Economics, Kunming 650221, China"}]}],"member":"1968","published-online":{"date-parts":[[2018,4,25]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"1888","DOI":"10.1109\/SURV.2013.013013.00155","article-title":"Virtual Network Embedding: A Survey","volume":"15","author":"Fischer","year":"2013","journal-title":"IEEE Commun. Surv. Tutor."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Chowdhury, N., Rahman, M.R., and Boutaba, R. (2009, January 19\u201325). Virtual network embedding with coordinated node and link mapping. Proceedings of the IEEE INFOCOM, Rio de Janeiro, Brazil.","DOI":"10.1109\/INFCOM.2009.5061987"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"1012","DOI":"10.1109\/TNET.2014.2312928","article-title":"Decomposition approaches for virtual network embedding with one-shot node and link mapping","volume":"23","author":"Jarray","year":"2015","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1109\/LCOMM.2015.2442575","article-title":"Optimization model and algorithm for energy efficient virtual node embedding","volume":"19","author":"Chen","year":"2015","journal-title":"IEEE Commun. Lett."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1145\/1355734.1355737","article-title":"Rethinking virtual network embedding: Substrate support for path splitting and migration","volume":"38","author":"Yu","year":"2008","journal-title":"ACM SIGCOMM Comput. Commun. Rev."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Lischka, J., and Karl, H. (2009, January 17). A virtual network mapping algorithm based on subgraph isomorphism detection. Proceedings of the 1st ACM workshop on Virtualized Infrastructure Systems and Architectures (VISA \u201909), Barcelona, Spain.","DOI":"10.1145\/1592648.1592662"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1145\/1971162.1971168","article-title":"Virtual network embedding through topology-aware node ranking","volume":"41","author":"Cheng","year":"2011","journal-title":"ACM SIGCOMM Comput. Commun. Rev."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1016\/j.jnca.2015.06.012","article-title":"Distributed and scalable embedding of virtual networks","volume":"56","author":"Beck","year":"2015","journal-title":"J. Netw. Comput. Appl."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"816","DOI":"10.1109\/TPDS.2013.64","article-title":"Virtual Network Embedding with Opportunistic Resource Sharing","volume":"25","author":"Zhang","year":"2014","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.ins.2010.08.041","article-title":"A history of graph entropy measures","volume":"181","author":"Dehmer","year":"2011","journal-title":"Inf. Sci."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"559","DOI":"10.3390\/e14030559","article-title":"Entropy and the complexity of graphs revisited","volume":"14","author":"Mowshowitz","year":"2012","journal-title":"Entropy"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/BF02477860","article-title":"Life information theory and topology","volume":"17","author":"Rashevsky","year":"1955","journal-title":"Bull. Math. Biophys."},{"key":"ref_13","first-page":"129","article-title":"A note on the information content of graphs","volume":"18","author":"Trucco","year":"1956","journal-title":"Bull. Math. Biol."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1007\/BF02476673","article-title":"Entropy and the complexity of graphs IV: Entropy measures and graphical structure","volume":"30","author":"Mowshowitz","year":"1968","journal-title":"Bull. Math. Biophys."},{"key":"ref_15","unstructured":"K\u00f6rner, J. (1971, January 19\u201325). Coding of an information source having ambiguous alphabet and the entropy of graphs. Proceedings of the 6th Prague Conference on Information Theory, Prague, Czech Republic."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1016\/j.amc.2007.12.010","article-title":"Information processing in complex networks: Graph entropy and information functionals","volume":"201","author":"Dehmer","year":"2008","journal-title":"Appl. Math. Comput."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"825","DOI":"10.1080\/01969720802435925","article-title":"A novel method for measuring the structural information content of networks","volume":"39","author":"Dehmer","year":"2008","journal-title":"Cybern. Syst."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1021\/ci60022a011","article-title":"Generalization of the graph center concept, and derived topological centric indexes","volume":"20","author":"Bonchev","year":"1980","journal-title":"J. Chem. Inf. Comput. Sci."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"961","DOI":"10.1089\/cmb.2007.0041","article-title":"The chronic fatigue syndrome: A comparative pathway analysis","volume":"14","year":"2007","journal-title":"J. Comput. Biol. A J. Comput. Mol. Cell Biol."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Emmert-Streib, F., and Dehmer, M. (2007, January 10\u201312). Gobal information processing in gene networks: Fault tolerance. Proceedings of the 2nd Bio-Inspired Models of Network, Information and Computing Systems (Bionetics 2007), Budapest, Hungary.","DOI":"10.1109\/BIMNICS.2007.4610138"},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Dehmer, M., Chen, Z., Li, X., and Shi, Y. (2016). Mathematical Foundations and Applications of Graph Entropy, Wiley-Blackwell.","DOI":"10.1002\/9783527693245"},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Beck, M.T., Linnhoff-Popien, C., and Fischer, A. (2014, January 17\u201319). A simulation framework for Virtual Network Embedding algorithms. Proceedings of the 2014 16th International Telecommunications Network Strategy and Planning Symposium, Funchal, Portugal.","DOI":"10.1109\/NETWKS.2014.6959238"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"892","DOI":"10.1109\/TC.1985.6312192","article-title":"Fat-trees: Universal networks for hardware-efficient supercomputing","volume":"C-34","author":"Leiserson","year":"2012","journal-title":"IEEE Trans. Comput."},{"key":"ref_24","unstructured":"(2017, April 01). On-Line Data. Available online: https:\/\/scholar.google.com."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/20\/5\/315\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T15:02:07Z","timestamp":1760194927000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/20\/5\/315"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4,25]]},"references-count":24,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2018,5]]}},"alternative-id":["e20050315"],"URL":"https:\/\/doi.org\/10.3390\/e20050315","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2018,4,25]]}}}