{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,27]],"date-time":"2026-08-27T15:24:13Z","timestamp":1787844253386,"version":"build-2784847793"},"reference-count":44,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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 1824440"],"award-info":[{"award-number":["CNS 1824440"]}],"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 1828363"],"award-info":[{"award-number":["CNS 1828363"]}],"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 1757533"],"award-info":[{"award-number":["CNS 1757533"]}],"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 1629746"],"award-info":[{"award-number":["CNS 1629746"]}],"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 1651947"],"award-info":[{"award-number":["CNS 1651947"]}],"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 1564128"],"award-info":[{"award-number":["CNS 1564128"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Netw. Sci. Eng."],"published-print":{"date-parts":[[2021,1,1]]},"DOI":"10.1109\/tnse.2020.3038783","type":"journal-article","created":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:52:52Z","timestamp":1605649972000},"page":"389-399","source":"Crossref","is-referenced-by-count":19,"title":["Flow Scheduling of Service Chain Processing in a NFV-Based Network"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0578-2016","authenticated-orcid":false,"given":"Yang","family":"Chen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3472-1717","authenticated-orcid":false,"given":"Jie","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","article-title":"Scheduling - Theory, Algorithms, and Systems","author":"pinedo","year":"2008"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2014.2349973"},{"key":"ref33","article-title":"Scheduling: Theory, Algorithms, and Systems","author":"pinedo","year":"2008","journal-title":"Incorporated"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800010110"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/CLOUD.2017.34"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2019.2927070"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ICCCN.2015.7288478"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ICCCN.2016.7568555"},{"key":"ref35","first-page":"227?237","article-title":"The two-machine total completion time flow shop problem","volume":"90","author":"croce","year":"1996","journal-title":"Eur J Oper Res"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-006-8789-x"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2491185.2491203"},{"key":"ref40","doi-asserted-by":"crossref","first-page":"107?113","DOI":"10.1145\/1327452.1327492","article-title":"Simplified data processing on large clusters","volume":"51","author":"dean","year":"2008","journal-title":"Commun ACM"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/3098822.3098827"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2016.2580150"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2019.2927070"},{"key":"ref14","article-title":"Np-completeness and inapproximability of the virtual network embedding problem and its variants","author":"rost","year":"2018","journal-title":"Tech Rep"},{"key":"ref15","article-title":"Virtual network embedding approximations: Leveraging randomized rounding","year":"2018"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/CloudNet.2014.6968961"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2015.7218511"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2016.7524565"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2016.7524563"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2013.36"},{"key":"ref4","article-title":"Service function chaining use cases in mobile networks","author":"haeffner","year":"2015","journal-title":"Internet Eng Task Force"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/2785956.2787479"},{"key":"ref3","article-title":"Service function chaining use cases in data centers","author":"kumar","year":"2015"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2934872.2934875"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2019.2894239"},{"key":"ref5","first-page":"323?336","article-title":"Design and implementation of a consolidated middlebox architecture","author":"sekar","year":"2012","journal-title":"USENIX Symp on Network Systems Design and Implementation"},{"key":"ref8","article-title":"A survey of enterprise middlebox deployments","author":"sherry","year":"2012"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2619239.2626313"},{"key":"ref2","article-title":"Service function chaining problem statement,” draft-ietf-sfc-problem-statement-07","author":"quinn","year":"2014","journal-title":"Work in Progress"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-32942-6_5"},{"key":"ref1","article-title":"Fault tolerance for service function chains","author":"ghaznavi","year":"2020"},{"key":"ref20","article-title":"Stratos: A network-aware orchestration layer for middleboxes in the cloud","author":"gember","year":"2013"},{"key":"ref22","first-page":"459?473","article-title":"Clickos and the art of network function virtualization","author":"martins","year":"2014","journal-title":"Proc 11th USENIX Conf Netw Syst Design Implementation"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/2619239.2626313"},{"key":"ref42","article-title":"Algorithm Design","author":"kleinberg","year":"2005"},{"key":"ref24","first-page":"1?6","article-title":"Multi-objective scheduling of micro-services for optimal service function chains","author":"d","year":"2017","journal-title":"Proc"},{"key":"ref41","article-title":"Ryu component-based software defined networking framework","year":"0"},{"key":"ref23","first-page":"1112?1118","article-title":"Joint optimization of function mapping and preemptive scheduling for service chains in network function virtualization","volume":"108","author":"h","year":"2020","journal-title":"Future Gener Comput Syst"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/2785956.2787472"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/2619239.2626309"},{"key":"ref43","article-title":"Scheduling: Theory, Algorithms, and Systems","author":"pinedo","year":"2016"},{"key":"ref25","first-page":"1","article-title":"Queues don’t matter when you can jump them!","author":"grosvenor","year":"2015","journal-title":"Proc 12th USENIX Conf Netw Syst Design Implementation"}],"container-title":["IEEE Transactions on Network Science and Engineering"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/6488902\/9380808\/9262033-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6488902\/9380808\/09262033.pdf?arnumber=9262033","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:53:36Z","timestamp":1652194416000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9262033\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,1]]},"references-count":44,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tnse.2020.3038783","relation":{},"ISSN":["2327-4697","2334-329X"],"issn-type":[{"value":"2327-4697","type":"electronic"},{"value":"2334-329X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1,1]]}}}