{"id":"https://openalex.org/W4281623717","doi":"https://doi.org/10.1109/noms54207.2022.9789758","title":"Lagrangian Heuristics for Capacitated Shortest Path Tour Problem Based Online Service Chaining","display_name":"Lagrangian Heuristics for Capacitated Shortest Path Tour Problem Based Online Service Chaining","publication_year":2022,"publication_date":"2022-04-25","ids":{"openalex":"https://openalex.org/W4281623717","doi":"https://doi.org/10.1109/noms54207.2022.9789758"},"language":"en","primary_location":{"id":"doi:10.1109/noms54207.2022.9789758","is_oa":false,"landing_page_url":"https://doi.org/10.1109/noms54207.2022.9789758","pdf_url":null,"source":{"id":"https://openalex.org/S4363605650","display_name":"NOMS 2022-2022 IEEE/IFIP Network Operations and Management Symposium","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"NOMS 2022-2022 IEEE/IFIP Network Operations and Management Symposium","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5064463101","display_name":"Takanori Hara","orcid":"https://orcid.org/0000-0002-7861-1771"},"institutions":[{"id":"https://openalex.org/I75917431","display_name":"Nara Institute of Science and Technology","ror":"https://ror.org/05bhada84","country_code":"JP","type":"education","lineage":["https://openalex.org/I75917431"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Takanori Hara","raw_affiliation_strings":["Nara Institute of Science and Technology,Graduate School of Science and Technology,Nara,Japan,630-0192"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Nara Institute of Science and Technology,Graduate School of Science and Technology,Nara,Japan,630-0192","institution_ids":["https://openalex.org/I75917431"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5059574438","display_name":"Masahiro Sasabe","orcid":"https://orcid.org/0000-0002-1200-9112"},"institutions":[{"id":"https://openalex.org/I75917431","display_name":"Nara Institute of Science and Technology","ror":"https://ror.org/05bhada84","country_code":"JP","type":"education","lineage":["https://openalex.org/I75917431"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Masahiro Sasabe","raw_affiliation_strings":["Nara Institute of Science and Technology,Graduate School of Science and Technology,Nara,Japan,630-0192"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Nara Institute of Science and Technology,Graduate School of Science and Technology,Nara,Japan,630-0192","institution_ids":["https://openalex.org/I75917431"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I75917431"],"apc_list":null,"apc_paid":null,"fwci":0.856,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.65103734,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"9"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10714","display_name":"Software-Defined Networks and 5G","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10714","display_name":"Software-Defined Networks and 5G","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10400","display_name":"Network Security and Intrusion Detection","score":0.9940000176429749,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9934999942779541,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/chaining","display_name":"Chaining","score":0.8929199576377869},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7767257690429688},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6588727235794067},{"id":"https://openalex.org/keywords/virtual-network","display_name":"Virtual network","score":0.5819282531738281},{"id":"https://openalex.org/keywords/service","display_name":"Service (business)","score":0.5558517575263977},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5548424124717712},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5293344259262085},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5022914409637451},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.49351584911346436},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4604957401752472},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.40505915880203247},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.26107844710350037},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.14790567755699158},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.119835764169693},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.08928173780441284}],"concepts":[{"id":"https://openalex.org/C49020025","wikidata":"https://www.wikidata.org/wiki/Q1059099","display_name":"Chaining","level":2,"score":0.8929199576377869},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7767257690429688},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6588727235794067},{"id":"https://openalex.org/C2776874963","wikidata":"https://www.wikidata.org/wiki/Q4112081","display_name":"Virtual network","level":2,"score":0.5819282531738281},{"id":"https://openalex.org/C2780378061","wikidata":"https://www.wikidata.org/wiki/Q25351891","display_name":"Service (business)","level":2,"score":0.5558517575263977},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5548424124717712},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5293344259262085},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5022914409637451},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.49351584911346436},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4604957401752472},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.40505915880203247},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.26107844710350037},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.14790567755699158},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.119835764169693},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.08928173780441284},{"id":"https://openalex.org/C542102704","wikidata":"https://www.wikidata.org/wiki/Q183257","display_name":"Psychotherapist","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C136264566","wikidata":"https://www.wikidata.org/wiki/Q159810","display_name":"Economy","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/noms54207.2022.9789758","is_oa":false,"landing_page_url":"https://doi.org/10.1109/noms54207.2022.9789758","pdf_url":null,"source":{"id":"https://openalex.org/S4363605650","display_name":"NOMS 2022-2022 IEEE/IFIP Network Operations and Management Symposium","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"NOMS 2022-2022 IEEE/IFIP Network Operations and Management Symposium","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6142334556","display_name":"Network Topology-Aware Service Chaining in NFV Network","funder_award_id":"21K21288","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"}],"funders":[{"id":"https://openalex.org/F4320334764","display_name":"Japan Society for the Promotion of Science","ror":"https://ror.org/00hhkn466"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1963547452","https://openalex.org/W2008006577","https://openalex.org/W2017227260","https://openalex.org/W2058845836","https://openalex.org/W2089194229","https://openalex.org/W2118404561","https://openalex.org/W2159637648","https://openalex.org/W2289096564","https://openalex.org/W2336786694","https://openalex.org/W2500898769","https://openalex.org/W2512567073","https://openalex.org/W2581172747","https://openalex.org/W2590714684","https://openalex.org/W2754446034","https://openalex.org/W2766814683","https://openalex.org/W2787084296","https://openalex.org/W2788163338","https://openalex.org/W2804263917","https://openalex.org/W2886002802","https://openalex.org/W2889809831","https://openalex.org/W2943618428","https://openalex.org/W2962802879","https://openalex.org/W2967858304","https://openalex.org/W3008779020","https://openalex.org/W3080454431","https://openalex.org/W3100859211","https://openalex.org/W3111506026","https://openalex.org/W6654494608"],"related_works":["https://openalex.org/W2903328691","https://openalex.org/W2967858304","https://openalex.org/W2791010391","https://openalex.org/W2889650910","https://openalex.org/W2951557574","https://openalex.org/W4300138531","https://openalex.org/W2620066784","https://openalex.org/W3015273126","https://openalex.org/W2956655210","https://openalex.org/W2538052369"],"abstract_inverted_index":{"Network":[0],"functions":[1,13,24],"virtualization":[2],"(NFV)":[3],"can":[4,33],"flexibly":[5],"deploy":[6],"diverse":[7],"network":[8,12,16,23,31],"services":[9],"by":[10,36],"liberating":[11],"from":[14,57],"traditional":[15],"appliances":[17],"and":[18,100,131,143],"executing":[19],"them":[20],"as":[21,112],"virtual":[22],"(VNFs)":[25],"on":[26],"generic":[27],"hardware.":[28],"A":[29],"certain":[30],"service":[32,38,48,55,97,110,161],"be":[34],"represented":[35],"a":[37,53],"chain,":[39],"which":[40,81],"consists":[41],"of":[42,125,145],"VNFs":[43,66],"in":[44,73],"required":[45,75],"order.":[46],"The":[47],"chaining":[49,98,111],"problem":[50,99,105],"is":[51,121],"finding":[52],"suitable":[54],"path":[56,103],"the":[58,61,65,70,74,78,84,93,96,101,109,113,126,129,154,159,169,174,185],"origin":[59],"to":[60,83,138,152],"destination":[62],"such":[63],"that":[64,168],"are":[67],"executed":[68],"at":[69],"intermediate":[71],"nodes":[72],"order":[76],"under":[77],"resource":[79,146,176],"constraints,":[80],"belongs":[82],"complexity":[85,142],"class":[86],"NP-hard.":[87],"In":[88,135],"our":[89],"previous":[90],"work,":[91],"considering":[92],"similarity":[94],"between":[95],"shortest":[102],"tour":[104],"(SPTP),":[106],"we":[107,148,166],"formulated":[108],"capacitated":[114],"SPTP":[115,127],"(CSPTP)":[116],"based":[117],"ILP,":[118],"where":[119],"CSPTP":[120],"an":[122],"extended":[123],"version":[124],"with":[128,178,184],"node":[130],"link":[132],"capacity":[133],"constraints.":[134],"this":[136],"paper,":[137],"address":[139],"both":[140],"computational":[141],"optimality":[144],"allocation,":[147],"propose":[149],"Lagrangian":[150],"heuristics":[151],"solve":[153],"CSPTP-based":[155],"ILP":[156],"especially":[157],"for":[158],"online":[160],"chaining.":[162],"Through":[163],"simulation":[164],"results,":[165],"show":[167],"proposed":[170],"algorithm":[171],"almost":[172],"achieves":[173],"optimal":[175],"allocation":[177],"much":[179],"smaller":[180],"execution":[181],"time":[182],"compared":[183],"existing":[186],"solver,":[187],"CPLEX.":[188]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":2}],"updated_date":"2026-07-09T07:52:08.696243","created_date":"2025-10-10T00:00:00"}