{"id":"https://openalex.org/W3049676628","doi":"https://doi.org/10.1109/netsoft48620.2020.9165364","title":"Shortest Path Tour Problem Based Integer Linear Programming for Service Chaining in NFV Networks","display_name":"Shortest Path Tour Problem Based Integer Linear Programming for Service Chaining in NFV Networks","publication_year":2020,"publication_date":"2020-06-01","ids":{"openalex":"https://openalex.org/W3049676628","doi":"https://doi.org/10.1109/netsoft48620.2020.9165364","mag":"3049676628"},"language":"en","primary_location":{"id":"doi:10.1109/netsoft48620.2020.9165364","is_oa":false,"landing_page_url":"https://doi.org/10.1109/netsoft48620.2020.9165364","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 6th IEEE Conference on Network Softwarization (NetSoft)","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/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":true,"raw_author_name":"Masahiro Sasabe","raw_affiliation_strings":["Graduate School of Science and Technology, Nara Institute of Science and Technology, 8916-5 Takayama-cho, Ikoma, Nara, Japan"],"affiliations":[{"raw_affiliation_string":"Graduate School of Science and Technology, Nara Institute of Science and Technology, 8916-5 Takayama-cho, Ikoma, 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":["Graduate School of Science and Technology, Nara Institute of Science and Technology, 8916-5 Takayama-cho, Ikoma, Nara, Japan"],"affiliations":[{"raw_affiliation_string":"Graduate School of Science and Technology, Nara Institute of Science and Technology, 8916-5 Takayama-cho, Ikoma, Nara, Japan","institution_ids":["https://openalex.org/I75917431"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5059574438"],"corresponding_institution_ids":["https://openalex.org/I75917431"],"apc_list":null,"apc_paid":null,"fwci":0.7709,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.74374769,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"69","issue":null,"first_page":"114","last_page":"121"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10714","display_name":"Software-Defined Networks and 5G","score":0.9998000264167786,"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":0.9998000264167786,"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.9884999990463257,"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/T10917","display_name":"Smart Grid Security and Resilience","score":0.9793000221252441,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/chaining","display_name":"Chaining","score":0.7886354923248291},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.7534076571464539},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6645826101303101},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5769316554069519},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.558679461479187},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5364663600921631},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4809255301952362},{"id":"https://openalex.org/keywords/service","display_name":"Service (business)","score":0.4708611071109772},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.4201134741306305},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.286659836769104},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2416623830795288},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.20842978358268738},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17324283719062805},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.1446509063243866},{"id":"https://openalex.org/keywords/business","display_name":"Business","score":0.07352951169013977}],"concepts":[{"id":"https://openalex.org/C49020025","wikidata":"https://www.wikidata.org/wiki/Q1059099","display_name":"Chaining","level":2,"score":0.7886354923248291},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.7534076571464539},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6645826101303101},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5769316554069519},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.558679461479187},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5364663600921631},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4809255301952362},{"id":"https://openalex.org/C2780378061","wikidata":"https://www.wikidata.org/wiki/Q25351891","display_name":"Service (business)","level":2,"score":0.4708611071109772},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.4201134741306305},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.286659836769104},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2416623830795288},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.20842978358268738},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17324283719062805},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.1446509063243866},{"id":"https://openalex.org/C144133560","wikidata":"https://www.wikidata.org/wiki/Q4830453","display_name":"Business","level":0,"score":0.07352951169013977},{"id":"https://openalex.org/C162853370","wikidata":"https://www.wikidata.org/wiki/Q39809","display_name":"Marketing","level":1,"score":0.0},{"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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/netsoft48620.2020.9165364","is_oa":false,"landing_page_url":"https://doi.org/10.1109/netsoft48620.2020.9165364","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 6th IEEE Conference on Network Softwarization (NetSoft)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","score":0.41999998688697815,"id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W2008006577","https://openalex.org/W2098432798","https://openalex.org/W2159637648","https://openalex.org/W2336786694","https://openalex.org/W2500898769","https://openalex.org/W2543929814","https://openalex.org/W2581172747","https://openalex.org/W2590714684","https://openalex.org/W2754446034","https://openalex.org/W2754790691","https://openalex.org/W2788163338","https://openalex.org/W2791363235","https://openalex.org/W2804263917","https://openalex.org/W2886002802","https://openalex.org/W2909366371","https://openalex.org/W2943618428","https://openalex.org/W2961581281","https://openalex.org/W2967858304","https://openalex.org/W3099148196","https://openalex.org/W6758398314"],"related_works":["https://openalex.org/W3209137076","https://openalex.org/W4223969905","https://openalex.org/W2374560440","https://openalex.org/W1490490684","https://openalex.org/W4221129498","https://openalex.org/W2887026015","https://openalex.org/W2361442013","https://openalex.org/W2373384475","https://openalex.org/W4310124294","https://openalex.org/W143403600"],"abstract_inverted_index":{"Network":[0],"functions":[1,18,31],"virtualization":[2],"(NFV)":[3],"is":[4,66,129],"a":[5,37,45,50,54,67],"new":[6],"paradigm":[7],"to":[8,76,115],"achieve":[9],"flexible":[10],"and":[11,22,61,87],"agile":[12],"network":[13,17,30,39],"services":[14],"by":[15],"decoupling":[16],"from":[19,84],"proprietary":[20],"hardware":[21,27],"running":[23],"them":[24],"on":[25],"generic":[26],"as":[28,44,140],"virtual":[29],"(VNFs).":[32],"In":[33],"the":[34,71,85,90,94,97,101,109,116,123,130,136,152,163],"NFV":[35],"network,":[36],"certain":[38],"service":[40,51,62,72,80,110,137],"can":[41,155],"be":[42],"modeled":[43],"sequence":[46,68],"of":[47,69,125],"VNFs,":[48],"called":[49],"chain.":[52],"Given":[53],"connection":[55],"request":[56],"(origin":[57],"node,":[58,60],"destination":[59,91],"chain":[63],"requirement,":[64],"which":[65,82],"functions),":[70],"chaining":[73,111,138],"problem":[74,112,120,139],"aims":[75],"find":[77],"an":[78,141],"appropriate":[79],"path,":[81],"starts":[83],"origin":[86],"ends":[88],"with":[89],"while":[92],"executing":[93],"VNFs":[95],"at":[96],"intermediate":[98],"nodes":[99],"in":[100],"required":[102],"order.":[103],"Some":[104],"existing":[105,164],"work":[106,132],"noticed":[107],"that":[108,133],"was":[113],"similar":[114],"shortest":[117],"path":[118],"tour":[119],"(SPTP).":[121],"To":[122],"best":[124],"our":[126],"knowledge,":[127],"this":[128],"first":[131],"exactly":[134],"formulates":[135],"SPTP-based":[142,153],"integer":[143],"linear":[144],"program":[145],"(ILP).":[146],"Through":[147],"numerical":[148],"results,":[149],"we":[150],"show":[151],"ILP":[154],"support":[156],"1.30-1.77":[157],"times":[158],"larger":[159],"scale":[160],"systems":[161],"than":[162],"ILP.":[165]},"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}