{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T14:43:38Z","timestamp":1775745818546,"version":"3.50.1"},"reference-count":30,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,5,2]],"date-time":"2022-05-02T00:00:00Z","timestamp":1651449600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,5,2]],"date-time":"2022-05-02T00:00:00Z","timestamp":1651449600000},"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","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,5,2]]},"DOI":"10.1109\/infocom48880.2022.9796690","type":"proceedings-article","created":{"date-parts":[[2022,6,20]],"date-time":"2022-06-20T21:18:49Z","timestamp":1655759929000},"page":"950-959","source":"Crossref","is-referenced-by-count":19,"title":["Provably Efficient Algorithms for Traffic-sensitive SFC Placement and Flow Routing"],"prefix":"10.1109","author":[{"given":"Yingling","family":"Mao","sequence":"first","affiliation":[{"name":"Stony Brook University,Dept. of Electrical and Computer Eng.,New York,USA"}]},{"given":"Xiaojun","family":"Shang","sequence":"additional","affiliation":[{"name":"Stony Brook University,Dept. of Electrical and Computer Eng.,New York,USA"}]},{"given":"Yuanyuan","family":"Yang","sequence":"additional","affiliation":[{"name":"Stony Brook University,Dept. of Electrical and Computer Eng.,New York,USA"}]}],"member":"263","reference":[{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/SWAT.1974.4"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2015.7218511"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/3337821.3337850"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM41043.2020.9155345"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2017.8056993"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2019.2946347"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2020.3047391"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2018.2802518"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2017.8057036"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2018.8485943"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM41043.2020.9155364"},{"key":"ref28","first-page":"99","article-title":"A review and evaluations of shortest path algorithms","volume":"2","author":"magzhan","year":"2013","journal-title":"International Journal of Scientific and Technology Research"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/JSYST.2019.2936519"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.09.032"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1145\/2829988.2787484","article-title":"Congestion control for large-scale RDMA deployments","volume":"45","author":"zhu","year":"2015","journal-title":"ACM SIGCOMM Computer Communication Review"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2020.2983918"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2011.111002"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2018.2880992"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/CNSM.2015.7367338"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/INM.2015.7140281"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/CloudNet.2014.6968961"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/CloudNet.2015.7335301"},{"key":"ref1","article-title":"Network Functions Virtualization-Introductory White Paper","year":"2012","journal-title":"SDN and OpenFlow World Congress"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM41043.2020.9155394"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2019.02.030"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2018.8486021"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM41043.2020.9155341"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM41043.2020.9155529"},{"key":"ref26","article-title":"Near-optimal bin packing algorithms","author":"johnson","year":"1973","journal-title":"Ph D Massachusetts Institute of Technology"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM41043.2020.9155263"}],"event":{"name":"IEEE INFOCOM 2022 - IEEE Conference on Computer Communications","location":"London, United Kingdom","start":{"date-parts":[[2022,5,2]]},"end":{"date-parts":[[2022,5,5]]}},"container-title":["IEEE INFOCOM 2022 - IEEE Conference on Computer Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9796607\/9796652\/09796690.pdf?arnumber=9796690","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,18]],"date-time":"2022-07-18T20:46:43Z","timestamp":1658177203000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9796690\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,2]]},"references-count":30,"URL":"https:\/\/doi.org\/10.1109\/infocom48880.2022.9796690","relation":{},"subject":[],"published":{"date-parts":[[2022,5,2]]}}}