{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T14:53:39Z","timestamp":1772722419550,"version":"3.50.1"},"reference-count":51,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-1647084"],"award-info":[{"award-number":["CNS-1647084"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-1647182"],"award-info":[{"award-number":["CNS-1647182"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Coulter Foundation Translational Partnership Program"},{"DOI":"10.13039\/501100002261","name":"Russian Foundation for Basic Research","doi-asserted-by":"publisher","award":["16-07-00218a"],"award-info":[{"award-number":["16-07-00218a"]}],"id":[{"id":"10.13039\/501100002261","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003443","name":"Ministry of Education and Science of the Russian Federation","doi-asserted-by":"publisher","award":["2.974.2017\/4.6"],"award-info":[{"award-number":["2.974.2017\/4.6"]}],"id":[{"id":"10.13039\/501100003443","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Netw. Serv. Manage."],"published-print":{"date-parts":[[2019,3]]},"DOI":"10.1109\/tnsm.2018.2865204","type":"journal-article","created":{"date-parts":[[2018,8,17]],"date-time":"2018-08-17T20:12:21Z","timestamp":1534536741000},"page":"127-142","source":"Crossref","is-referenced-by-count":19,"title":["A Constrained Shortest Path Scheme for Virtual Network Service Management"],"prefix":"10.1109","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8948-2370","authenticated-orcid":false,"given":"Dmitrii","family":"Chemodanov","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7798-4584","authenticated-orcid":false,"given":"Flavio","family":"Esposito","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7666-5389","authenticated-orcid":false,"given":"Prasad","family":"Calyam","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6948-4988","authenticated-orcid":false,"given":"Andrei","family":"Sukhov","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1090\/qam\/102435"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2015.06.012"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/1355734.1355737"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.endm.2016.03.028"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795290477"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2006.03.020"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1186\/1869-0238-4-6"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/1592648.1592662"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2008.4536207"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2006.322"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/2999572.2999585"},{"key":"ref27","author":"bazaraa","year":"2011","journal-title":"Linear Programming and Network Flows"},{"key":"ref29","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1145\/2829988.2787497","article-title":"Central control over distributed routing","volume":"45","author":"vissicchio","year":"2015","journal-title":"ACM SIGCOMM Comput Commun Rev"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.bjp.2013.12.037"},{"key":"ref1","year":"2018","journal-title":"Vmware cloud vservices"},{"key":"ref20","first-page":"1228","article-title":"QoS routing for supporting resource reservation","volume":"14","author":"wang","year":"1996","journal-title":"IEEE J Sel Areas Commun"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2012.6195833"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2014.2375826"},{"key":"ref24","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1016\/j.jnca.2007.11.004","article-title":"Multi-constraint QoS routing using a new single mixed metrics","volume":"31","author":"khadivi","year":"2008","journal-title":"J Netw Comput Appl"},{"key":"ref23","year":"2018","journal-title":"Neighborhood Method Prototype"},{"key":"ref26","article-title":"The design and evaluation of routing algorithms for real-time channels","author":"widyono","year":"1994"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2001.916277"},{"key":"ref50","year":"2018","journal-title":"IBM CPLEX Solver"},{"key":"ref51","year":"2018","journal-title":"Open Vswitch"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2004.836112"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2010.05.017"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/LANMAN.2016.7548863"},{"key":"ref12","article-title":"Coexistence of QoS and best effort flows-routing and scheduling analysis","author":"nahrstedt","year":"1998","journal-title":"Proc IEEE Tyrrhenian Int Workshop Digit Commun"},{"key":"ref13","first-page":"844","article-title":"Heuristic algorithms for multi-constrained quality of service routing","author":"yuan","year":"2001","journal-title":"Proc IEEE InfoCom"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230140109"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2534169.2486012"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/2534169.2486019"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2015.2459073"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2015.11.005"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2011.2159308"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/SURV.2013.013013.00155"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2522968.2522974"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2016.2598420"},{"key":"ref5","first-page":"1","article-title":"CATENA: A distributed architecture for robust service function chain instantiation with guarantees","author":"esposito","year":"2017","journal-title":"Proc IEEE NETSOFT"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2012.07.008"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2016.2633579"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOMW.2010.5700172"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP.2015.36"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/49.12889"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/MASCOT.2001.948886"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/1060289.1060313"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/316194.316229"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(85)90084-0"},{"key":"ref41","article-title":"A constrained shortest path scheme for virtual network service management","author":"chemodanov","year":"2018","journal-title":"arXiv 1808 03031"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/1355734.1355746"},{"key":"ref43","year":"2018","journal-title":"The Floodlight SDN Controller"}],"container-title":["IEEE Transactions on Network and Service Management"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/4275028\/8664201\/8436010-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4275028\/8664201\/08436010.pdf?arnumber=8436010","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T20:52:44Z","timestamp":1657745564000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8436010\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3]]},"references-count":51,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tnsm.2018.2865204","relation":{},"ISSN":["1932-4537","2373-7379"],"issn-type":[{"value":"1932-4537","type":"electronic"},{"value":"2373-7379","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,3]]}}}