{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T16:29:39Z","timestamp":1775579379580,"version":"3.50.1"},"reference-count":48,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Netw. Serv. Manage."],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1109\/tnsm.2019.2946949","type":"journal-article","created":{"date-parts":[[2019,10,11]],"date-time":"2019-10-11T19:52:47Z","timestamp":1570823567000},"page":"1552-1566","source":"Crossref","is-referenced-by-count":13,"title":["Probabilistic Virtual Link Embedding Under Demand Uncertainty"],"prefix":"10.1109","volume":"16","author":[{"given":"Fatemeh","family":"Hosseini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"James","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3783-4346","authenticated-orcid":false,"given":"Majid","family":"Ghaderi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","first-page":"749","article-title":"A simple polynomial time framework for reduced-path decomposition in multipath routing","author":"mirrokni","year":"2004","journal-title":"Proc IEEE InfoCom"},{"key":"ref38","author":"wainwright","year":"2015","journal-title":"Basic tail and concentration bounds"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/1232919.1232925"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2017.04.045"},{"key":"ref31","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/j.jnca.2017.07.014","article-title":"A fast robust optimization-based heuristic for the deployment of green virtual network functions","volume":"95","author":"marotta","year":"2017","journal-title":"Netw Comput Appl"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/NETSOFT.2019.8806703"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/1028788.1028805"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP.2003.1249760"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/2890955.2890968"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/2486001.2486012"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/110845239"},{"key":"ref40","year":"2019","journal-title":"Artelys Knitro"},{"key":"ref11","first-page":"370","article-title":"Virtual network embedding approximations: Leveraging randomized rounding","author":"rost","year":"2018","journal-title":"Proc IFIP Netw"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5935254"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2014.34"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s11107-011-0341-z"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2015.09.036"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2016.7524611"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2014.7037088"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s10922-016-9376-x"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/1355734.1355737"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2016.2598420"},{"key":"ref4","first-page":"105","article-title":"Introducing the virtual network mapping problem with delay, routing and location constraints","author":"inf\u00fchr","year":"2011","journal-title":"Proc INOC"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOMW.2019.8845171"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/CC.2016.7513202"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2006.322"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2019.8737498"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2012.030912.120082"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5061987"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1971162.1971168"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/SURV.2013.013013.00155"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2011.2159308"},{"key":"ref1","first-page":"55","article-title":"Charting the complexity landscape of virtual network embeddings","author":"rost","year":"2018","journal-title":"Proc IFIP Netw"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1126\/science.286.5439.509"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/IWQoS.2002.1006582"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.17.11.712"},{"key":"ref48","year":"2019","journal-title":"The CAIDA Anonymized OC48 Internet Traces Dataset"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2017.2782006"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2013.09.028"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/2805789.2805792"},{"key":"ref42","year":"2019","journal-title":"Gurobi Optimization"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1030.0065"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-002-0339-5"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1515\/9781400831050"},{"key":"ref44","year":"2019","journal-title":"AMPL"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/CNSM.2016.7818395"},{"key":"ref43","first-page":"99","article-title":"Local allocation of end-to-end quality-of-service in high-speed networks","author":"nagarajan","year":"1993","journal-title":"Proc IFIP Workshop Perform Eval Commun Syst"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2012.10.036"}],"container-title":["IEEE Transactions on Network and Service Management"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4275028\/8930332\/08865665.pdf?arnumber=8865665","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T21:06:20Z","timestamp":1657746380000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8865665\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12]]},"references-count":48,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tnsm.2019.2946949","relation":{},"ISSN":["1932-4537","2373-7379"],"issn-type":[{"value":"1932-4537","type":"electronic"},{"value":"2373-7379","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,12]]}}}