{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T15:04:26Z","timestamp":1749567866800},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,6]]},"DOI":"10.1109\/iccw.2013.6649237","type":"proceedings-article","created":{"date-parts":[[2013,11,1]],"date-time":"2013-11-01T20:36:40Z","timestamp":1383338200000},"page":"246-250","source":"Crossref","is-referenced-by-count":2,"title":["A novel method of virtual network embedding based on topology convergence-degree"],"prefix":"10.1109","author":[{"family":"Hongyan Cui","sequence":"first","affiliation":[]},{"family":"Shaohua Tang","sequence":"additional","affiliation":[]},{"family":"Xu Huang","sequence":"additional","affiliation":[]},{"family":"Jianya Chen","sequence":"additional","affiliation":[]},{"family":"Yunjie Liu","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/SURV.2011.122811.00060"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOMW.2007.4437786"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/ICCW.2009.5207979"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2008.1056"},{"key":"14","first-page":"149","article-title":"An improved algorithm for matching large graphs [A]","author":"cordella","year":"2001","journal-title":"Proceedings of the 3rd IAPR-TC15 Workshop on Graph-Based Representations in Pattern Recognition [C]"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1631\/jzus.C1100003"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1145\/1971162.1971168"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2009.5183468"},{"key":"2","article-title":"Time sharing in large fast computers","author":"strachey","year":"1959","journal-title":"Proc Int Conf Inform Processing"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1996.493353"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1145\/1592648.1592662"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2011.2159308"},{"journal-title":"Theoretical approaches to node assignment","year":"2002","author":"andersen","key":"6"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1145\/1971162.1971173"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2009.10.017"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1145\/1355734.1355737"},{"key":"8","article-title":"Game theory based bandwidth allocation scheme for network virtualization","author":"zhou","year":"2010","journal-title":"IEEE GLOBECOM"}],"event":{"name":"2013 ICC - 2013 IEEE International Conference on Communication Workshop (ICC)","start":{"date-parts":[[2013,6,9]]},"location":"Budapest, Hungary","end":{"date-parts":[[2013,6,13]]}},"container-title":["2013 IEEE International Conference on Communications Workshops (ICC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6637583\/6649166\/06649237.pdf?arnumber=6649237","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,22]],"date-time":"2017-03-22T22:06:53Z","timestamp":1490220413000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6649237\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/iccw.2013.6649237","relation":{},"subject":[],"published":{"date-parts":[[2013,6]]}}}