{"id":"https://openalex.org/W2765816777","doi":"https://doi.org/10.1109/jsac.2017.2760162","title":"Joint Optimization of Service Function Placement and Flow Distribution for Service Function Chaining","display_name":"Joint Optimization of Service Function Placement and Flow Distribution for Service Function Chaining","publication_year":2017,"publication_date":"2017-10-25","ids":{"openalex":"https://openalex.org/W2765816777","doi":"https://doi.org/10.1109/jsac.2017.2760162","mag":"2765816777"},"language":"en","primary_location":{"id":"doi:10.1109/jsac.2017.2760162","is_oa":false,"landing_page_url":"https://doi.org/10.1109/jsac.2017.2760162","pdf_url":null,"source":{"id":"https://openalex.org/S90422530","display_name":"IEEE Journal on Selected Areas in Communications","issn_l":"0733-8716","issn":["0733-8716","1558-0008"],"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 Journal on Selected Areas in Communications","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/A5036773822","display_name":"Insun Jang","orcid":null},"institutions":[{"id":"https://openalex.org/I197347611","display_name":"Korea University","ror":"https://ror.org/047dqcg40","country_code":"KR","type":"education","lineage":["https://openalex.org/I197347611"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Insun Jang","raw_affiliation_strings":["School of Electrical Engineering, Korea University, Seoul, South Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Electrical Engineering, Korea University, Seoul, South Korea","institution_ids":["https://openalex.org/I197347611"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101972427","display_name":"Dongeun Suh","orcid":"https://orcid.org/0000-0003-1012-6160"},"institutions":[{"id":"https://openalex.org/I197347611","display_name":"Korea University","ror":"https://ror.org/047dqcg40","country_code":"KR","type":"education","lineage":["https://openalex.org/I197347611"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Dongeun Suh","raw_affiliation_strings":["School of Electrical Engineering, Korea University, Seoul, South Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Electrical Engineering, Korea University, Seoul, South Korea","institution_ids":["https://openalex.org/I197347611"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5015321839","display_name":"Sangheon Pack","orcid":"https://orcid.org/0000-0002-1085-1568"},"institutions":[{"id":"https://openalex.org/I197347611","display_name":"Korea University","ror":"https://ror.org/047dqcg40","country_code":"KR","type":"education","lineage":["https://openalex.org/I197347611"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Sangheon Pack","raw_affiliation_strings":["School of Electrical Engineering, Korea University, Seoul, South Korea"],"raw_orcid":"https://orcid.org/0000-0002-1085-1568","affiliations":[{"raw_affiliation_string":"School of Electrical Engineering, Korea University, Seoul, South Korea","institution_ids":["https://openalex.org/I197347611"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086721943","display_name":"Gy\u00f6rgy D\u00e1n","orcid":"https://orcid.org/0000-0002-4876-0223"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Gyorgy Dan","raw_affiliation_strings":["School of Electrical Engineering, KTH Royal Institute of Technology, Stockholm, Sweden","School of Electrical Engineering KTH Royal Institute of Technology Stockholm Sweden"],"raw_orcid":"https://orcid.org/0000-0002-4876-0223","affiliations":[{"raw_affiliation_string":"School of Electrical Engineering, KTH Royal Institute of Technology, Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]},{"raw_affiliation_string":"School of Electrical Engineering KTH Royal Institute of Technology Stockholm Sweden","institution_ids":["https://openalex.org/I86987016"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.053,"has_fulltext":false,"cited_by_count":88,"citation_normalized_percentile":{"value":0.95928387,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":"35","issue":"11","first_page":"2532","last_page":"2541"},"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.9998999834060669,"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.9998999834060669,"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.9965999722480774,"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.9914000034332275,"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.8901771306991577},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8049522638320923},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7338142991065979},{"id":"https://openalex.org/keywords/rounding","display_name":"Rounding","score":0.7074836492538452},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5904296040534973},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5781846642494202},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.476802796125412},{"id":"https://openalex.org/keywords/multi-commodity-flow-problem","display_name":"Multi-commodity flow problem","score":0.4445548951625824},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.44327419996261597},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.43768221139907837},{"id":"https://openalex.org/keywords/minimum-cost-flow-problem","display_name":"Minimum-cost flow problem","score":0.42242297530174255},{"id":"https://openalex.org/keywords/flow-routing","display_name":"Flow routing","score":0.4188166856765747},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.4132119119167328},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.28754544258117676},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.2082284688949585},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.10588398575782776}],"concepts":[{"id":"https://openalex.org/C49020025","wikidata":"https://www.wikidata.org/wiki/Q1059099","display_name":"Chaining","level":2,"score":0.8901771306991577},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8049522638320923},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7338142991065979},{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.7074836492538452},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5904296040534973},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5781846642494202},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.476802796125412},{"id":"https://openalex.org/C170334043","wikidata":"https://www.wikidata.org/wiki/Q6934437","display_name":"Multi-commodity flow problem","level":3,"score":0.4445548951625824},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.44327419996261597},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.43768221139907837},{"id":"https://openalex.org/C99545648","wikidata":"https://www.wikidata.org/wiki/Q2897180","display_name":"Minimum-cost flow problem","level":3,"score":0.42242297530174255},{"id":"https://openalex.org/C2779313249","wikidata":"https://www.wikidata.org/wiki/Q7371615","display_name":"Flow routing","level":2,"score":0.4188166856765747},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.4132119119167328},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28754544258117676},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.2082284688949585},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10588398575782776},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C187320778","wikidata":"https://www.wikidata.org/wiki/Q1349130","display_name":"Geotechnical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"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/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/jsac.2017.2760162","is_oa":false,"landing_page_url":"https://doi.org/10.1109/jsac.2017.2760162","pdf_url":null,"source":{"id":"https://openalex.org/S90422530","display_name":"IEEE Journal on Selected Areas in Communications","issn_l":"0733-8716","issn":["0733-8716","1558-0008"],"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 Journal on Selected Areas in Communications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/7","score":0.7599999904632568,"display_name":"Affordable and clean energy"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W1435010830","https://openalex.org/W1516035587","https://openalex.org/W1561366358","https://openalex.org/W1823841943","https://openalex.org/W1991911371","https://openalex.org/W2000238032","https://openalex.org/W2004199070","https://openalex.org/W2043352445","https://openalex.org/W2125560635","https://openalex.org/W2132238781","https://openalex.org/W2136930733","https://openalex.org/W2144127235","https://openalex.org/W2149342630","https://openalex.org/W2153078864","https://openalex.org/W2176566884","https://openalex.org/W2220600512","https://openalex.org/W2288905013","https://openalex.org/W2289096564","https://openalex.org/W2374516805","https://openalex.org/W2462026904","https://openalex.org/W2487114213","https://openalex.org/W2516637237","https://openalex.org/W2538737679","https://openalex.org/W2611147814","https://openalex.org/W2615258659","https://openalex.org/W3101743077","https://openalex.org/W4236127247","https://openalex.org/W4238465620","https://openalex.org/W4244244705","https://openalex.org/W6628561984","https://openalex.org/W6648117026"],"related_works":["https://openalex.org/W3035974271","https://openalex.org/W3141113327","https://openalex.org/W3161514703","https://openalex.org/W2080904092","https://openalex.org/W2098682899","https://openalex.org/W1994440468","https://openalex.org/W1518391446","https://openalex.org/W4206915070","https://openalex.org/W2182648737","https://openalex.org/W2051329268"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"consider":[4],"the":[5,32,39,48,64,82,86,94,97,100,104,110,118,129,134],"problem":[6,29,51,65],"of":[7,85,96,106],"optimal":[8,83],"dynamic":[9],"service":[10,44,135],"function":[11],"(SF)":[12],"placement":[13],"and":[14,36,61,78,103,125,133],"flow":[15,34,112,131],"routing":[16],"in":[17],"a":[18,26,53,70],"SF":[19],"chaining":[20],"(SFC)":[21],"enabled":[22],"network.":[23],"We":[24,46,68],"formulate":[25],"multi-objective":[27,49],"optimization":[28,50],"to":[30,37,80,92,138],"maximize":[31],"acceptable":[33,111,130],"rate":[35,132],"minimize":[38],"energy":[40,98,143],"cost":[41,144],"for":[42],"multiple":[43],"chains.":[45],"transform":[47],"into":[52],"single-objective":[54],"mixed":[55],"integer":[56],"linear":[57,76],"programming":[58],"(MILP)":[59],"problem,":[60],"prove":[62],"that":[63,117],"is":[66],"NP-hard.":[67],"propose":[69],"polynomial":[71],"time":[72],"algorithm":[73,120],"based":[74],"on":[75,109],"relaxation":[77],"rounding":[79],"approximate":[81],"solution":[84],"MILP.":[87],"Extensive":[88],"simulations":[89],"are":[90],"conducted":[91],"evaluate":[93],"effects":[95],"budget,":[99],"network":[101],"topology,":[102],"amount":[105],"server":[107],"resources":[108],"rate.":[113],"The":[114],"results":[115],"demonstrate":[116],"proposed":[119],"can":[121,126],"achieve":[122],"near-optimal":[123],"performance":[124],"significantly":[127],"increase":[128],"capacity":[136],"compared":[137],"other":[139],"algorithms":[140],"under":[141],"an":[142],"budget.":[145]},"counts_by_year":[{"year":2026,"cited_by_count":4},{"year":2025,"cited_by_count":9},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":15},{"year":2022,"cited_by_count":16},{"year":2021,"cited_by_count":19},{"year":2020,"cited_by_count":11},{"year":2019,"cited_by_count":10},{"year":2018,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}
