{"id":"https://openalex.org/W3111506026","doi":"https://doi.org/10.1109/tnsm.2020.3044329","title":"Capacitated Shortest Path Tour Problem-Based Integer Linear Programming for Service Chaining and Function Placement in NFV Networks","display_name":"Capacitated Shortest Path Tour Problem-Based Integer Linear Programming for Service Chaining and Function Placement in NFV Networks","publication_year":2020,"publication_date":"2020-12-14","ids":{"openalex":"https://openalex.org/W3111506026","doi":"https://doi.org/10.1109/tnsm.2020.3044329","mag":"3111506026"},"language":"en","primary_location":{"id":"doi:10.1109/tnsm.2020.3044329","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tnsm.2020.3044329","pdf_url":null,"source":{"id":"https://openalex.org/S173527311","display_name":"IEEE Transactions on Network and Service Management","issn_l":"1932-4537","issn":["1932-4537","2373-7379"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Network and Service Management","raw_type":"journal-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/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":["Division of Information Science, Nara Institute of Science and Technology, Nara, Japan"],"raw_orcid":"https://orcid.org/0000-0002-1200-9112","affiliations":[{"raw_affiliation_string":"Division of Information Science, Nara Institute of Science and Technology, Nara, Japan","institution_ids":["https://openalex.org/I75917431"]}]},{"author_position":"last","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":["Division of Information Science, Nara Institute of Science and Technology, Nara, Japan"],"raw_orcid":"https://orcid.org/0000-0002-7861-1771","affiliations":[{"raw_affiliation_string":"Division of Information Science, Nara Institute of Science and Technology, Nara, Japan","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":3.7279,"has_fulltext":false,"cited_by_count":32,"citation_normalized_percentile":{"value":0.93639452,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":95,"max":99},"biblio":{"volume":"18","issue":"1","first_page":"104","last_page":"117"},"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/T10847","display_name":"Advanced Optical Network Technologies","score":0.9959999918937683,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.9876000285148621,"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.9349538087844849},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8071725368499756},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6131784319877625},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5497239232063293},{"id":"https://openalex.org/keywords/network-service","display_name":"Network service","score":0.518281877040863},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5090376734733582},{"id":"https://openalex.org/keywords/virtual-network","display_name":"Virtual network","score":0.4874468147754669},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.4833357036113739},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4544140100479126},{"id":"https://openalex.org/keywords/service","display_name":"Service (business)","score":0.4491986632347107},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.43684515357017517},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4307236671447754},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.4155328869819641},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.4121176600456238},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.25456488132476807},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2485470175743103},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.23528781533241272},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09889847040176392},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.08983689546585083}],"concepts":[{"id":"https://openalex.org/C49020025","wikidata":"https://www.wikidata.org/wiki/Q1059099","display_name":"Chaining","level":2,"score":0.9349538087844849},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8071725368499756},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6131784319877625},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5497239232063293},{"id":"https://openalex.org/C2779618445","wikidata":"https://www.wikidata.org/wiki/Q1640628","display_name":"Network service","level":2,"score":0.518281877040863},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5090376734733582},{"id":"https://openalex.org/C2776874963","wikidata":"https://www.wikidata.org/wiki/Q4112081","display_name":"Virtual network","level":2,"score":0.4874468147754669},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.4833357036113739},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4544140100479126},{"id":"https://openalex.org/C2780378061","wikidata":"https://www.wikidata.org/wiki/Q25351891","display_name":"Service (business)","level":2,"score":0.4491986632347107},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.43684515357017517},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4307236671447754},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.4155328869819641},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.4121176600456238},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.25456488132476807},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2485470175743103},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.23528781533241272},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09889847040176392},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08983689546585083},{"id":"https://openalex.org/C542102704","wikidata":"https://www.wikidata.org/wiki/Q183257","display_name":"Psychotherapist","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/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/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tnsm.2020.3044329","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tnsm.2020.3044329","pdf_url":null,"source":{"id":"https://openalex.org/S173527311","display_name":"IEEE Transactions on Network and Service Management","issn_l":"1932-4537","issn":["1932-4537","2373-7379"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Network and Service Management","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9","score":0.4399999976158142}],"awards":[{"id":"https://openalex.org/G3987346505","display_name":"Selfish yet Optimal Service Chaining in NFV Networks","funder_award_id":"19K11942","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":36,"referenced_works":["https://openalex.org/W2008006577","https://openalex.org/W2058845836","https://openalex.org/W2089194229","https://openalex.org/W2098432798","https://openalex.org/W2115826669","https://openalex.org/W2159637648","https://openalex.org/W2289096564","https://openalex.org/W2336786694","https://openalex.org/W2374516805","https://openalex.org/W2500898769","https://openalex.org/W2581172747","https://openalex.org/W2590487735","https://openalex.org/W2590714684","https://openalex.org/W2754446034","https://openalex.org/W2754790691","https://openalex.org/W2766814683","https://openalex.org/W2781790117","https://openalex.org/W2788163338","https://openalex.org/W2791363235","https://openalex.org/W2804263917","https://openalex.org/W2886002802","https://openalex.org/W2890719226","https://openalex.org/W2909366371","https://openalex.org/W2912325271","https://openalex.org/W2914391504","https://openalex.org/W2943618428","https://openalex.org/W2961581281","https://openalex.org/W2962802879","https://openalex.org/W2967858304","https://openalex.org/W2970007378","https://openalex.org/W3008779020","https://openalex.org/W3009644581","https://openalex.org/W3049676628","https://openalex.org/W3099148196","https://openalex.org/W3100859211","https://openalex.org/W4293179730"],"related_works":["https://openalex.org/W2364921833","https://openalex.org/W2385146268","https://openalex.org/W2031095783","https://openalex.org/W4385872024","https://openalex.org/W4237424888","https://openalex.org/W2793920318","https://openalex.org/W2380500715","https://openalex.org/W2155192218","https://openalex.org/W2109471565","https://openalex.org/W3111506026"],"abstract_inverted_index":{"Network":[0],"functions":[1,18,31],"virtualization":[2],"(NFV)":[3],"is":[4],"a":[5,37,44,49,53,60,207],"new":[6],"paradigm":[7],"to":[8,67,77,211],"achieve":[9],"flexible":[10],"and":[11,22,59,73,112,119,140,184,215,222],"agile":[12],"network":[13,17,30,38,123],"services":[14],"by":[15,147,192],"decoupling":[16],"from":[19],"proprietary":[20],"hardware":[21,27],"running":[23],"them":[24],"on":[25,104],"generic":[26],"as":[28,43,164,167],"virtual":[29],"(VNFs).":[32],"In":[33,100],"the":[34,70,85,90,96,105,108,113,121,137,148,153,157,168,176,181,189,199,213,217,227],"NFV":[35],"network,":[36,127],"service":[39,50,71,81,97,109,138,158,182,200,220],"can":[40,160,187,225],"be":[41],"modeled":[42],"sequence":[45,61],"of":[46,62,89],"VNFs,":[47],"called":[48,125],"chain.":[51],"Given":[52],"connection":[54],"request":[55],"(e.g.,":[56,87],"origin,":[57],"destination,":[58],"required":[63],"functions),":[64],"we":[65,128,151,172,205],"have":[66],"solve":[68,212],"both":[69,180],"chaining":[72,110,139,159,183,221],"function":[74,141,185,223],"placement":[75,186,224],"problems":[76],"find":[78],"an":[79],"appropriate":[80],"path":[82,92,115],"that":[83,175,196],"optimizes":[84],"objective":[86],"minimization":[88],"total":[91,190],"delay)":[93],"while":[94],"satisfying":[95],"chain":[98],"requirements.":[99],"this":[101],"article,":[102],"focusing":[103],"similarity":[106],"between":[107],"problem":[111,117],"shortest":[114],"tour":[116],"(SPTP)":[118],"developing":[120],"novel":[122],"model":[124],"augmented":[126],"formulate":[129],"capacitated":[130],"SPTP-based":[131],"integer":[132],"linear":[133],"programs":[134],"(ILPs)":[135],"for":[136,156,179,198,219],"placement.":[142],"Through":[143],"numerical":[144],"results":[145],"obtained":[146],"existing":[149,169],"solver,":[150],"show":[152,216],"proposed":[154,177],"ILP":[155,178],"support":[161],"1.22-1.90":[162],"times":[163],"large-scale":[165],"systems":[166],"ILP.":[170],"Furthermore,":[171],"also":[173],"demonstrate":[174],"shorten":[188],"delay":[191],"15.8%":[193],"compared":[194],"with":[195,230],"only":[197],"chaining.":[201],"For":[202],"further":[203],"scalability,":[204],"propose":[206],"shortest-path-based":[208],"heuristic":[209,218],"algorithm":[210],"ILPs":[214],"calculate":[226],"optimal":[228],"solution":[229],"high":[231],"accuracy":[232],"in":[233],"strongly":[234],"polynomial":[235],"time.":[236]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":13},{"year":2021,"cited_by_count":5}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}