{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,23]],"date-time":"2025-04-23T05:30:57Z","timestamp":1745386257078,"version":"3.37.3"},"reference-count":53,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2024,4,1]],"date-time":"2024-04-01T00:00:00Z","timestamp":1711929600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science (JSPS) Research Activity Startup","doi-asserted-by":"publisher","award":["21K21288"],"award-info":[{"award-number":["21K21288"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"JSPS KAKENHI","doi-asserted-by":"publisher","award":["22H03586"],"award-info":[{"award-number":["22H03586"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006091","name":"Support Center for Advanced Telecommunications Technology Research","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100006091","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Netw. Serv. Manage."],"published-print":{"date-parts":[[2024,4]]},"DOI":"10.1109\/tnsm.2024.3351737","type":"journal-article","created":{"date-parts":[[2024,1,9]],"date-time":"2024-01-09T20:28:34Z","timestamp":1704832114000},"page":"1344-1358","source":"Crossref","is-referenced-by-count":2,"title":["Capacitated Shortest Path Tour-Based Service Chaining Adaptive to Changes of Service Demand and Network Topology"],"prefix":"10.1109","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7861-1771","authenticated-orcid":false,"given":"Takanori","family":"Hara","sequence":"first","affiliation":[{"name":"Division of Information Science, Nara Institute of Science and Technology, Ikoma, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1200-9112","authenticated-orcid":false,"given":"Masahiro","family":"Sasabe","sequence":"additional","affiliation":[{"name":"Faculty of Informatics, Kansai University, Takatsuki, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.23919\/CNSM55787.2022.9965166"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2020.3017001"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2016.09.001"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2018.01.021"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2015.2499271"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.2018.1700467"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2020.2986592"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.23919\/APNOMS50412.2020.9236954"},{"key":"ref9","article-title":"Reinforcement learning of graph neural networks for service function chaining","author":"Heo","year":"2020","journal-title":"arXiv:2011.08406"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICTC49870.2020.9289378"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/HPSR48589.2020.9098994"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060599"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICCCN.2017.8038463"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2020.3044329"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s10922-022-09715-y"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1186\/s13174-018-0087-2"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.2200\/s01045ed1v01y202009aim046"},{"key":"ref18","article-title":"Semi-supervised classification with graph convolutional networks","author":"Kipf","year":"2017","journal-title":"arXiv:1609.02907"},{"key":"ref19","first-page":"13333","article-title":"Diffusion improves graph learning","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"32","author":"Klicpera"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/tkde.2020.2981333"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.aiopen.2021.01.001"},{"key":"ref22","article-title":"Neural message passing for quantum chemistry","author":"Gilmer","year":"2017","journal-title":"arXiv:1704.01212"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1002\/ett.3477"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/55482.55502"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.2003.1248656"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2018.2833815"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2934725"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2020.3017792"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2019.01.036"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2019.2912717"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2019.2959183"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2021.108474"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2019.2959181"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2018.8485996"},{"key":"ref35","first-page":"1","article-title":"The shortest path tour problem: Problem definition, modeling, and optimization","volume-title":"Proc. INOC","author":"Festa"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2020.3025298"},{"key":"ref37","article-title":"Deep reinforcement learning meets graph neural networks: Exploring a routing optimization use case","author":"Almasan","year":"2020","journal-title":"arXiv:1910.07421"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/tnn.1998.712192"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1512\/iumj.1957.6.56038"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1126\/science.153.3731.34"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2017.2743240"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2013.6638312"},{"article-title":"The PageRank citation ranking: Bringing order to the Web","year":"1999","author":"Page","key":"ref43"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0708838104"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v30i1.10295"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2007.11.001"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/DNSR.2004.1344743"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TCC.2019.2914387"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2011.111002"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.5555\/3454287.3455008"},{"key":"ref51","first-page":"1","article-title":"Fast graph representation learning with PyTorch geometric","volume-title":"Proc. ICLR Workshop Represent. Learn. Graphs Manifolds","author":"Fey"},{"key":"ref52","article-title":"Adam: A method for stochastic optimization","author":"Kingma","year":"2017","journal-title":"arXiv:1412.6980"},{"volume-title":"IBM ILOG CPLEX optimizer","year":"2023","key":"ref53"}],"container-title":["IEEE Transactions on Network and Service Management"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4275028\/10499985\/10384810.pdf?arnumber=10384810","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,16]],"date-time":"2024-04-16T05:07:27Z","timestamp":1713244047000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10384810\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4]]},"references-count":53,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tnsm.2024.3351737","relation":{},"ISSN":["1932-4537","2373-7379"],"issn-type":[{"type":"electronic","value":"1932-4537"},{"type":"electronic","value":"2373-7379"}],"subject":[],"published":{"date-parts":[[2024,4]]}}}