乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,12]],"date-time":"2025-04-12T05:48:53Z","timestamp":1744436933901,"version":"3.37.3"},"reference-count":46,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2018,3,1]],"date-time":"2018-03-01T00:00:00Z","timestamp":1519862400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Basic Research Program of China (973 Program)","doi-asserted-by":"crossref","award":["2013CB329104"],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61372124","61427801"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Postgraduate Research & Practice Innovation Program of Jiangsu Province","award":["KYCX17_0784"]},{"DOI":"10.13039\/501100000266","name":"U.K. EPSRC","doi-asserted-by":"publisher","award":["EP\/N007840\/1"],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Netw. Serv. Manage."],"published-print":{"date-parts":[[2018,3]]},"DOI":"10.1109\/tnsm.2017.2778106","type":"journal-article","created":{"date-parts":[[2017,11,28]],"date-time":"2017-11-28T19:08:44Z","timestamp":1511896124000},"page":"356-371","source":"Crossref","is-referenced-by-count":74,"title":["A Novel Optimal Mapping Algorithm With Less Computational Complexity for Virtual Network Embedding"],"prefix":"10.1109","volume":"15","author":[{"given":"Haotong","family":"Cao","sequence":"first","affiliation":[]},{"given":"Yongxu","family":"Zhu","sequence":"additional","affiliation":[]},{"given":"Gan","family":"Zheng","sequence":"additional","affiliation":[]},{"given":"Longxiang","family":"Yang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/CompComm.2016.7925131"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2016.2582179"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2016.2558598"},{"journal-title":"Introduction to Algorithms","year":"2001","author":"cormen","key":"ref32"},{"journal-title":"Theory of Linear and Integer Programming","year":"1998","author":"schrijiver","key":"ref31"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2016.7537178"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2015.2417652"},{"journal-title":"IBM IBM ILOG Optimization Products","year":"2016","key":"ref36"},{"journal-title":"GLPK(GNU Linear Programming Kit)","year":"2016","key":"ref35"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2016.2574239"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1355734.1355737"},{"key":"ref40","first-page":"1","article-title":"ALEVIN—A framework to develop, compare, and analyze virtual network embedding algorithms","volume":"37","author":"fischer","year":"2011","journal-title":"Electron Commun EASST"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/1592648.1592662"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1971162.1971168"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5061987"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2011.2159308"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2008.1056"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2012.030912.120082"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2013.2286156"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOMW.2012.6193473"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2013.092813.130397"},{"journal-title":"Wirelss Local Area Network","year":"2012","author":"molisch","key":"ref28"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2005.1577741"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1997.646131"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2009.10.017"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/SURV.2013.013013.00155"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2012.6295722"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1198255.1198265"},{"journal-title":"Theoretical approaches to node assignment","year":"2002","author":"andersen","key":"ref8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/CC.2016.7513202"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2009.5183468"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2006.322"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2005.136"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2015.2513070"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2015.2459073"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2014.2352118"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2013.6566805"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2014.2312928"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/49.12889"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2013.013013.110202"},{"journal-title":"Simulation Platform for Scotfield Cao","year":"2016","key":"ref41"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ECTICON.2011.5947831"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2015.2507134"},{"article-title":"Approximation algorithms for disjoint path problems","year":"1996","author":"kleinberg","key":"ref26"},{"key":"ref43","volume":"182","author":"jain","year":"1991","journal-title":"The Art of Computer Systems Performance Analysis"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2016.2533625"}],"container-title":["IEEE Transactions on Network and Service Management"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4275028\/8310716\/08122008.pdf?arnumber=8122008","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:22:11Z","timestamp":1642004531000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8122008\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3]]},"references-count":46,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tnsm.2017.2778106","relation":{},"ISSN":["1932-4537"],"issn-type":[{"type":"print","value":"1932-4537"}],"subject":[],"published":{"date-parts":[[2018,3]]}}}