{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T23:43:28Z","timestamp":1775087008517,"version":"3.50.1"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2022,11,17]],"date-time":"2022-11-17T00:00:00Z","timestamp":1668643200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,11,17]],"date-time":"2022-11-17T00:00:00Z","timestamp":1668643200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"the State Grid Jiangxi Information & Telecommunication Company Project \u201dResearch on de-boundary security protection technology based on zero trust framework\u201d","award":["Grant 52183520007V"],"award-info":[{"award-number":["Grant 52183520007V"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2023,4]]},"DOI":"10.1007\/s11227-022-04947-w","type":"journal-article","created":{"date-parts":[[2022,11,17]],"date-time":"2022-11-17T21:03:01Z","timestamp":1668718981000},"page":"6849-6870","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Virtual network function deployment algorithm based on graph convolution deep reinforcement learning"],"prefix":"10.1007","volume":"79","author":[{"given":"Rixuan","family":"Qiu","sequence":"first","affiliation":[]},{"given":"Jiawen","family":"Bao","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1723-1959","authenticated-orcid":false,"given":"Yuancheng","family":"Li","sequence":"additional","affiliation":[]},{"given":"Xin","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Liang","family":"Liang","sequence":"additional","affiliation":[]},{"given":"Hui","family":"Tian","sequence":"additional","affiliation":[]},{"given":"Yanting","family":"Zeng","sequence":"additional","affiliation":[]},{"given":"Jie","family":"Shi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,11,17]]},"reference":[{"key":"4947_CR1","unstructured":"Network Functions Virtualisation (NFV); Architectural Framework, document ETSI GS NFV 002 (V1.2.1), 2014."},{"issue":"2","key":"4947_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3379444","volume":"53","author":"I Alam","year":"2020","unstructured":"Alam I et al (2020) A survey of network virtualization techniques for Internet of Things using SDN and NFV. ACM Comput Surv 53(2):1\u201335","journal-title":"ACM Comput Surv"},{"issue":"1","key":"4947_CR3","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1109\/COMST.2015.2477041","volume":"18","author":"R Mijumbi","year":"2015","unstructured":"Mijumbi R et al (2015) Network function virtualization: state-of-the-art and research challenges. IEEE Commun Surv Tutorials 18(1):236\u2013262","journal-title":"IEEE Commun Surv Tutorials"},{"issue":"3","key":"4947_CR4","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1109\/TNSM.2016.2598420","volume":"13","author":"JG Herrera","year":"2016","unstructured":"Herrera JG, Botero JF (2016) Resource allocation in NFV: a comprehensive survey. IEEE Trans Netw Service Manag 13(3):518\u2013532","journal-title":"IEEE Trans Netw Service Manag"},{"issue":"2","key":"4947_CR5","doi-asserted-by":"publisher","first-page":"1409","DOI":"10.1109\/COMST.2018.2884835","volume":"21","author":"A Laghrissi","year":"2019","unstructured":"Laghrissi A, Taleb T (2019) \"A survey on the placement of virtual resources and virtual network functions. IEEE Commun Surv Tuts 21(2):1409\u20131434","journal-title":"IEEE Commun Surv Tuts"},{"issue":"2","key":"4947_CR6","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1145\/1355734.1355737","volume":"38","author":"M Yu","year":"2008","unstructured":"Yu M, Yi Y, Rexford J, Chiang M (2008) \u201cRethinking virtual network embedding: substrate support for path splitting and migration.\u201d ACM SIGCOMM Comput Commun Rev 38(2):17\u201329","journal-title":"ACM SIGCOMM Comput Commun Rev"},{"issue":"2","key":"4947_CR7","doi-asserted-by":"publisher","first-page":"821","DOI":"10.1109\/TNSM.2020.2978910","volume":"17","author":"M Wang","year":"2020","unstructured":"Wang M, Cheng B, Chen J (2020) Joint availability guarantee andresource optimization of virtual network function placement in datacenter networks. IEEE Trans Netw Service Manag 17(2):821\u2013834","journal-title":"IEEE Trans Netw Service Manag"},{"key":"4947_CR8","first-page":"267","volume":"20","author":"P Jin","year":"2020","unstructured":"Jin P, Fei X, Zhang Q, Liu F, Li B (2020) \u201cLatency-aware VNF chaindeployment with efficient resource reuse at network edge.\u201d Proc IEEE Int Conf Comput Commun (INFOCOM) 20:267\u2013276","journal-title":"Proc IEEE Int Conf Comput Commun (INFOCOM)"},{"key":"4947_CR9","doi-asserted-by":"crossref","unstructured":"Zheng Z et al. (2019) \u201cOctans: Optimal placement of service function chainsin many-core systems,\u201d in Procceeding IEEE Internationsl Conference Computer Communication (INFOCOM), pp. 307\u2013315.","DOI":"10.1109\/INFOCOM.2019.8737544"},{"key":"4947_CR10","doi-asserted-by":"crossref","unstructured":"Soualah O, Fajjari I, Aitsaadi N, an Mellouk A (2014) \u201cA reliable virtual network embedding algorithm based on game theory within cloud\u2019s backbone,\u201d in Procceedings IEEE International Conference Communication (ICC), pp. 2975\u20132981.","DOI":"10.1109\/ICC.2014.6883777"},{"key":"4947_CR11","doi-asserted-by":"crossref","unstructured":"Gong L, Wen Y, Zhu Z, and Lee T (2014) \u201cToward profit-seeking virtual network embedding algorithm via global resource capacity,\u201d in Procceedings IEEE INFOCOM-IEEE Conference Computer Communication, pp. 1\u20139.","DOI":"10.1109\/INFOCOM.2014.6847918"},{"issue":"5","key":"4947_CR12","doi-asserted-by":"publisher","first-page":"3885","DOI":"10.1109\/JIOT.2020.3025500","volume":"8","author":"CA Ouedraogo","year":"2021","unstructured":"Ouedraogo CA, Medjiah S, Chassot C, Drira K, Aguilar J (2021) A cost-effective approach for end-to-end QoS management in NFV enabled IoT platforms. IEEE Internet Things J 8(5):3885\u20133903","journal-title":"IEEE Internet Things J"},{"key":"4947_CR13","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1109\/TCC.2020.3020269","volume":"25","author":"PK Thiruvasagam","year":"2020","unstructured":"Thiruvasagam PK, Kotagi VJ, Murthy SR (2020) \u201cA reliability-aware, delay guaranteed, and resource efficient placement of service functionchains in softwarized 5G networks. IEEE Trans Cloud Comput, Earlyaccess 25:51. https:\/\/doi.org\/10.1109\/TCC.2020.3020269","journal-title":"IEEE Trans Cloud Comput, Earlyaccess"},{"key":"4947_CR14","doi-asserted-by":"crossref","unstructured":"Zheng D, Peng C, Guler E, Luo G, Tian L, and Cao X (2019) \u201cHybridservice chain deployment in networks with unique function,\u201d in Proccceedings IEEE International Conference Communication (ICC), pp. 1\u20136.","DOI":"10.1109\/ICC.2019.8761210"},{"issue":"2","key":"4947_CR15","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1145\/1971162.1971168","volume":"41","author":"X Cheng","year":"2011","unstructured":"Cheng X et al (2011) Virtual network embedding through topology-aware node ranking. ACM SIGCOMM Comput Commun Rev 41(2):38\u201347","journal-title":"ACM SIGCOMM Comput Commun Rev"},{"key":"4947_CR16","volume-title":"\u201cThe pagerank citation ranking: bringing order to the Web","author":"L Page","year":"1999","unstructured":"Page L, Brin S, Motwani R, Winograd T (1999) \u201cThe pagerank citation ranking: bringing order to the Web. Stanford InfoLab"},{"key":"4947_CR17","doi-asserted-by":"crossref","unstructured":"Zhang Q, Liu F, and Zeng C (2019) \u201cAdaptive interference-aware VNF placement for service-customized 5G network slices,\u201d in Procceeding IEEE International Conference Computer Communication (INFOCOM), pp. 2449\u20132457.","DOI":"10.1109\/INFOCOM.2019.8737660"},{"issue":"3","key":"4947_CR18","doi-asserted-by":"publisher","first-page":"1389","DOI":"10.1109\/TNSM.2020.2990815","volume":"17","author":"O Houidi","year":"2020","unstructured":"Houidi O, Soualah O, Louati W, Zeghlache D (2020) Dynamic VNF forwarding graph extension algorithms. IEEE Trans Netw Service Manag 17(3):1389\u20131402","journal-title":"IEEE Trans Netw Service Manag"},{"key":"4947_CR19","doi-asserted-by":"crossref","unstructured":"Deudon M, Cournut P, Lacoste A, Adulyasak Y, and Rousseau L-M (2018) \"Learning heuristics for the TSP by policy gradient,\" in Procceedings International Conference Integration Constraint Programming, Artificial Intelligence, Operations Research Amsterdam, The Netherlands: Springer, 2018, pp. 170\u2013181.","DOI":"10.1007\/978-3-319-93031-2_12"},{"key":"4947_CR20","unstructured":"Mirhoseini A et al. (2017) \"Device placement optimization with reinforcement learning,\" in Procceedings 34th International Conference Machine Learning, vol. 70, 2017, pp. 2430\u20132439."},{"key":"4947_CR21","unstructured":"Nazari M, Oroojlooy A, Snyder L, and Tak\u00e1c M (2018) \"Reinforcement learning for solving the vehicle routing problem,\" in Procceedigs Advances Neural Information Processing System, pp. 9839\u20139849."},{"key":"4947_CR22","volume-title":"Reinforcement learning: an introduction","author":"RS Sutton","year":"2018","unstructured":"Sutton RS, Barto AG (2018) Reinforcement learning: an introduction. MIT Press"},{"key":"4947_CR23","first-page":"1","volume":"21","author":"Y Xiao","year":"2019","unstructured":"Xiao Y et al (2019) NFVdeep: adaptive online service function chain deployment with deep reinforcement learning. Proc Int Symp Qual Serv (IWQoS) 21:1\u201321","journal-title":"Proc Int Symp Qual Serv (IWQoS)"},{"issue":"2","key":"4947_CR24","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1109\/JSAC.2019.2959183","volume":"38","author":"R Solozabal","year":"2020","unstructured":"Solozabal R, Ceberio J, Sanchoyerto A, Zabala L, Blanco B, Liberal F (2020) Virtual network function placement optimization with deepreinforcement learning. IEEE J Sel Areas Commun 38(2):292\u2013303","journal-title":"IEEE J Sel Areas Commun"},{"issue":"1","key":"4947_CR25","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1109\/TWC.2019.2946797","volume":"19","author":"X Fu","year":"2020","unstructured":"Fu X, Yu FR, Wang J, Qi Q, Liao J (2020) Dynamic service functionchain embedding for NFV-enabled IoT: a deep reinforcement learningapproach. IEEE Trans Wireless Commun 19(1):507\u2013519","journal-title":"IEEE Trans Wireless Commun"},{"key":"4947_CR26","unstructured":"Kipf TN and Welling M (2016) \u201cSemi-supervised classification with graphconvolutional networks,\u201d arXiv preprint arXiv:1609.02907"},{"issue":"3104\u20133112","key":"4947_CR27","first-page":"2014","volume":"20","author":"S Ilya","year":"2014","unstructured":"Ilya S, Oriol V, Quoc VL (2014) Sequence to sequence learning with neuralnetworks. Adv Neural Inf Process Syst 20(3104\u20133112):2014","journal-title":"Adv Neural Inf Process Syst"},{"key":"4947_CR28","unstructured":"Oriol V, Samy B, and Manjunath K (2016) Order matters: Sequence to sequence forsets."},{"key":"4947_CR29","unstructured":"Mnih V et al. (2016) \u201cAsynchronous methods for deep reinforcement learning,\u201d In Procceedings International Conference Machine Learning, 2016, pp. 1928\u20131937."},{"key":"4947_CR30","doi-asserted-by":"crossref","unstructured":"Gong L, Wen Y, Zhu Z, and Lee T (2014) \u201cToward profit-seeking virtualnetwork embedding algorithm via global resource capacity,\u201d in Procceedings IEEE INFOCOM, pp. 1\u20139.","DOI":"10.1109\/INFOCOM.2014.6847918"},{"issue":"1","key":"4947_CR31","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1109\/TNET.2011.2159308","volume":"20","author":"M Chowdhury","year":"2012","unstructured":"Chowdhury M, Rahman MR, Boutaba R (2012) Vineyard: Virtual network embedding algorithms with coordinated node and link mapping. IEEE\/ACM Trans Netw 20(1):206\u2013219","journal-title":"IEEE\/ACM Trans Netw"},{"issue":"2","key":"4947_CR32","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1109\/TCYB.2016.2645123","volume":"48","author":"S Haeri","year":"2018","unstructured":"Haeri S, Trajkovic L (2018) Virtual network embedding via Monte Carlo tree search. IEEE Trans Cybern 48(2):510\u2013521","journal-title":"IEEE Trans Cybern"},{"issue":"6","key":"4947_CR33","doi-asserted-by":"publisher","first-page":"1040","DOI":"10.1109\/JSAC.2020.2986662","volume":"38","author":"Z Yan","year":"2020","unstructured":"Yan Z, Ge J, Wu Y, Li L, Li T (2020) Automatic virtual networkembedding: a deep reinforcement learning approach with graph convolutionalnetworks. IEEE J Sel Areas Commun 38(6):1040\u20131057","journal-title":"IEEE J Sel Areas Commun"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-022-04947-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-022-04947-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-022-04947-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,2]],"date-time":"2023-03-02T19:19:26Z","timestamp":1677784766000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-022-04947-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,17]]},"references-count":33,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2023,4]]}},"alternative-id":["4947"],"URL":"https:\/\/doi.org\/10.1007\/s11227-022-04947-w","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,11,17]]},"assertion":[{"value":"9 November 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 November 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose. The authors have no competing interests to declare that are relevant to the content of this article. All authors certify that they have no affiliations with or involvement in any organization or entity with any financial interest or non-financial interest in the subject matter or materials discussed in this manuscript. The authors have no financial or proprietary interests in any material discussed in this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}