{"id":"https://openalex.org/W2962802879","doi":"https://doi.org/10.1109/infocom.2018.8485996","title":"Shortest Path and Maximum Flow Problems Under Service Function Chaining Constraints","display_name":"Shortest Path and Maximum Flow Problems Under Service Function Chaining Constraints","publication_year":2018,"publication_date":"2018-04-01","ids":{"openalex":"https://openalex.org/W2962802879","doi":"https://doi.org/10.1109/infocom.2018.8485996","mag":"2962802879"},"language":"en","primary_location":{"id":"doi:10.1109/infocom.2018.8485996","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom.2018.8485996","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2018 - IEEE Conference on Computer Communications","raw_type":"proceedings-article"},"type":"conference-paper","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/A5005228371","display_name":"Gamal Sallam","orcid":"https://orcid.org/0000-0002-8806-6201"},"institutions":[{"id":"https://openalex.org/I84392919","display_name":"Temple University","ror":"https://ror.org/00kx1jb78","country_code":"US","type":"education","lineage":["https://openalex.org/I84392919"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Gamal Sallam","raw_affiliation_strings":["Department of Computer and Information Sciences, Temple University, Philadelphia, PA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Sciences, Temple University, Philadelphia, PA","institution_ids":["https://openalex.org/I84392919"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101803495","display_name":"Gagan Gupta","orcid":"https://orcid.org/0000-0001-7845-2056"},"institutions":[{"id":"https://openalex.org/I1283103587","display_name":"AT&T (United States)","ror":"https://ror.org/02bbd5539","country_code":"US","type":"company","lineage":["https://openalex.org/I1283103587"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Gagan R. Gupta","raw_affiliation_strings":["AT&T Labs"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"AT&T Labs","institution_ids":["https://openalex.org/I1283103587"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100365103","display_name":"Bin Li","orcid":"https://orcid.org/0000-0001-6002-677X"},"institutions":[{"id":"https://openalex.org/I17626003","display_name":"University of Rhode Island","ror":"https://ror.org/013ckk937","country_code":"US","type":"education","lineage":["https://openalex.org/I17626003"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Bin Li","raw_affiliation_strings":["Department of Electrical, Computer and Biomedical Engineering, University of Rhode Island, Kingston, Rhode Island"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical, Computer and Biomedical Engineering, University of Rhode Island, Kingston, Rhode Island","institution_ids":["https://openalex.org/I17626003"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5040279482","display_name":"Bo Ji","orcid":"https://orcid.org/0000-0003-0149-7509"},"institutions":[{"id":"https://openalex.org/I84392919","display_name":"Temple University","ror":"https://ror.org/00kx1jb78","country_code":"US","type":"education","lineage":["https://openalex.org/I84392919"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Bo Ji","raw_affiliation_strings":["Department of Computer and Information Sciences, Temple University, Philadelphia, PA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Sciences, Temple University, Philadelphia, PA","institution_ids":["https://openalex.org/I84392919"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":12.4399,"has_fulltext":false,"cited_by_count":84,"citation_normalized_percentile":{"value":0.99399145,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"2132","last_page":"2140"},"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.9871000051498413,"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.9857000112533569,"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/shortest-path-problem","display_name":"Shortest path problem","score":0.6837162971496582},{"id":"https://openalex.org/keywords/chaining","display_name":"Chaining","score":0.6797041893005371},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6610099077224731},{"id":"https://openalex.org/keywords/virtual-network","display_name":"Virtual network","score":0.650154709815979},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5421574711799622},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.508714497089386},{"id":"https://openalex.org/keywords/multi-commodity-flow-problem","display_name":"Multi-commodity flow problem","score":0.49955248832702637},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.4883372485637665},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4559110403060913},{"id":"https://openalex.org/keywords/minimum-cost-flow-problem","display_name":"Minimum-cost flow problem","score":0.45273181796073914},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.43610507249832153},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.4354764223098755},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.43298378586769104},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.31179141998291016},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.303012490272522},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2892618775367737},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.22401201725006104},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.22094544768333435},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21967440843582153}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6837162971496582},{"id":"https://openalex.org/C49020025","wikidata":"https://www.wikidata.org/wiki/Q1059099","display_name":"Chaining","level":2,"score":0.6797041893005371},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6610099077224731},{"id":"https://openalex.org/C2776874963","wikidata":"https://www.wikidata.org/wiki/Q4112081","display_name":"Virtual network","level":2,"score":0.650154709815979},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5421574711799622},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.508714497089386},{"id":"https://openalex.org/C170334043","wikidata":"https://www.wikidata.org/wiki/Q6934437","display_name":"Multi-commodity flow problem","level":3,"score":0.49955248832702637},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.4883372485637665},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4559110403060913},{"id":"https://openalex.org/C99545648","wikidata":"https://www.wikidata.org/wiki/Q2897180","display_name":"Minimum-cost flow problem","level":3,"score":0.45273181796073914},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.43610507249832153},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.4354764223098755},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.43298378586769104},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.31179141998291016},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.303012490272522},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2892618775367737},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.22401201725006104},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.22094544768333435},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21967440843582153},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/infocom.2018.8485996","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom.2018.8485996","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2018 - IEEE Conference on Computer Communications","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1575554886","https://openalex.org/W2002531683","https://openalex.org/W2018377390","https://openalex.org/W2020899710","https://openalex.org/W2059186030","https://openalex.org/W2150865801","https://openalex.org/W2473012137","https://openalex.org/W2492309821","https://openalex.org/W2497414020","https://openalex.org/W2512567073","https://openalex.org/W2559326926","https://openalex.org/W2586118222","https://openalex.org/W2590487735","https://openalex.org/W2761021290","https://openalex.org/W2762042916","https://openalex.org/W2762629425","https://openalex.org/W2789180991","https://openalex.org/W2963127770","https://openalex.org/W4213060883","https://openalex.org/W4252735936","https://openalex.org/W6748634989"],"related_works":["https://openalex.org/W3035974271","https://openalex.org/W3141113327","https://openalex.org/W3161514703","https://openalex.org/W1994440468","https://openalex.org/W2080904092","https://openalex.org/W2098682899","https://openalex.org/W2764325809","https://openalex.org/W1518391446","https://openalex.org/W4206915070","https://openalex.org/W2182648737"],"abstract_inverted_index":{"With":[0],"the":[1,30,36,58,62,109,118,122,134,138,147,163,173,178,192,219],"advent":[2],"of":[3,45,75,84,104,126,137,172,181,184,212],"Network":[4,9,18],"Function":[5,53],"Virtualization":[6],"(NFV),":[7],"Physical":[8],"Functions":[10,19],"(PNFs)":[11],"are":[12,22,88],"gradually":[13],"being":[14],"replaced":[15],"by":[16],"Virtual":[17],"(VNFs)":[20],"that":[21,87,121,218],"hosted":[23],"on":[24,29],"general":[25],"purpose":[26],"servers.":[27],"Depending":[28],"call":[31],"flows":[32],"for":[33,61,162,208],"specific":[34],"services,":[35],"packets":[37],"need":[38],"to":[39,95,116,128,156,176,238],"pass":[40],"through":[41],"an":[42,81,97,227],"ordered":[43],"set":[44],"network":[46,85,140,174],"functions":[47],"(physical":[48],"or":[49],"virtual)":[50],"called":[51],"Service":[52],"Chains":[54],"(SFC)":[55],"before":[56],"reaching":[57],"destination.":[59],"Conceivably":[60],"next":[63],"few":[64],"years":[65],"during":[66],"this":[67,91,151],"transition,":[68],"these":[69],"networks":[70],"would":[71],"have":[72],"a":[73,170,198,205,209],"mix":[74,83],"PNFs":[76],"and":[77,203,225],"VNFs,":[78],"which":[79],"brings":[80],"interesting":[82],"problems":[86],"studied":[89],"in":[90],"paper:":[92],"(1)":[93],"How":[94,115],"find":[96],"SFC-constrained":[98,111,164,193],"shortest":[99,165,186],"path":[100,166,187],"between":[101],"any":[102,185],"pair":[103],"nodes?":[105],"(2)":[106],"What":[107],"is":[108,131,223],"achievable":[110],"maximum":[112,135,194],"flow?":[113],"(3)":[114],"place":[117],"VNFs":[119,220],"such":[120,158],"cost":[123],"(the":[124],"number":[125],"nodes":[127],"be":[129,143],"virtualized)":[130],"minimized,":[132],"while":[133],"flow":[136,195,201],"original":[139],"can":[141],"still":[142],"achieved":[144],"even":[145],"under":[146],"SFC":[148],"constraint?":[149],"In":[150],"work,":[152],"we":[153,168,190,216,235],"will":[154],"try":[155],"address":[157],"emerging":[159],"questions.":[160],"First,":[161],"problem,":[167,202],"propose":[169],"transformation":[171],"graph":[175],"minimize":[177],"computational":[179],"complexity":[180],"subsequent":[182],"applications":[183],"algorithm.":[188],"Second,":[189],"formulate":[191],"problem":[196,222],"as":[197],"fractional":[199],"multicommodity":[200],"develop":[204],"combinatorial":[206],"algorithm":[207],"special":[210],"case":[211],"practical":[213],"interest.":[214],"Third,":[215],"prove":[217],"placement":[221],"NP-hard":[224],"present":[226],"alternative":[228],"Integer":[229],"Linear":[230],"Programming":[231],"(ILP)":[232],"formulation.":[233],"Finally,":[234],"conduct":[236],"simulations":[237],"elucidate":[239],"our":[240],"theoretical":[241],"results.":[242]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":10},{"year":2021,"cited_by_count":19},{"year":2020,"cited_by_count":20},{"year":2019,"cited_by_count":13},{"year":2018,"cited_by_count":3}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}