{"id":"https://openalex.org/W2917655796","doi":"https://doi.org/10.1109/glocom.2018.8647684","title":"Reliable Shortest Path Routing with Applications to Wireless Software-Defined Networking","display_name":"Reliable Shortest Path Routing with Applications to Wireless Software-Defined Networking","publication_year":2018,"publication_date":"2018-12-01","ids":{"openalex":"https://openalex.org/W2917655796","doi":"https://doi.org/10.1109/glocom.2018.8647684","mag":"2917655796"},"language":"en","primary_location":{"id":"doi:10.1109/glocom.2018.8647684","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2018.8647684","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE Global Communications Conference (GLOBECOM)","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/A5100460460","display_name":"Weijia Wang","orcid":"https://orcid.org/0000-0001-9643-6703"},"institutions":[{"id":"https://openalex.org/I36258959","display_name":"University of California, San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Weijia Wang","raw_affiliation_strings":["Electrical and Computer Engineering, University of California San Diego"],"affiliations":[{"raw_affiliation_string":"Electrical and Computer Engineering, University of California San Diego","institution_ids":["https://openalex.org/I36258959"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5044640162","display_name":"Chang\u2010Heng Wang","orcid":"https://orcid.org/0000-0001-6876-3272"},"institutions":[{"id":"https://openalex.org/I36258959","display_name":"University of California, San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Chang-Heng Wang","raw_affiliation_strings":["Electrical and Computer Engineering, University of California San Diego"],"affiliations":[{"raw_affiliation_string":"Electrical and Computer Engineering, University of California San Diego","institution_ids":["https://openalex.org/I36258959"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5059310658","display_name":"Tara Javidi","orcid":"https://orcid.org/0000-0001-7112-1043"},"institutions":[{"id":"https://openalex.org/I36258959","display_name":"University of California, San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Tara Javidi","raw_affiliation_strings":["Electrical and Computer Engineering, University of California San Diego"],"affiliations":[{"raw_affiliation_string":"Electrical and Computer Engineering, University of California San Diego","institution_ids":["https://openalex.org/I36258959"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5100460460"],"corresponding_institution_ids":["https://openalex.org/I36258959"],"apc_list":null,"apc_paid":null,"fwci":0.1845,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.58961689,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"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.9991999864578247,"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.9991999864578247,"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/T11392","display_name":"Energy Harvesting in Wireless Networks","score":0.9990000128746033,"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/T10148","display_name":"Advanced MIMO Systems Optimization","score":0.9976000189781189,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.7720147371292114},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7700725793838501},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.7684962153434753},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.7241858243942261},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6024437546730042},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5732353925704956},{"id":"https://openalex.org/keywords/lagrange-multiplier","display_name":"Lagrange multiplier","score":0.5270982980728149},{"id":"https://openalex.org/keywords/private-network-to-network-interface","display_name":"Private Network-to-Network Interface","score":0.4961174428462982},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.45084691047668457},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.4457630217075348},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.4407652020454407},{"id":"https://openalex.org/keywords/wireless-network","display_name":"Wireless network","score":0.4367932975292206},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.36595046520233154},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.31936702132225037},{"id":"https://openalex.org/keywords/wireless","display_name":"Wireless","score":0.3019474744796753},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.23990347981452942},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.14706939458847046},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.1243293285369873},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.10451200604438782}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.7720147371292114},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7700725793838501},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.7684962153434753},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.7241858243942261},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6024437546730042},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5732353925704956},{"id":"https://openalex.org/C73684929","wikidata":"https://www.wikidata.org/wiki/Q598870","display_name":"Lagrange multiplier","level":2,"score":0.5270982980728149},{"id":"https://openalex.org/C204348804","wikidata":"https://www.wikidata.org/wiki/Q3888133","display_name":"Private Network-to-Network Interface","level":5,"score":0.4961174428462982},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.45084691047668457},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.4457630217075348},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.4407652020454407},{"id":"https://openalex.org/C108037233","wikidata":"https://www.wikidata.org/wiki/Q11375","display_name":"Wireless network","level":3,"score":0.4367932975292206},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36595046520233154},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.31936702132225037},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.3019474744796753},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.23990347981452942},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.14706939458847046},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.1243293285369873},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.10451200604438782},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/glocom.2018.8647684","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2018.8647684","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE Global Communications Conference (GLOBECOM)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W7992011","https://openalex.org/W1486973518","https://openalex.org/W1964443412","https://openalex.org/W2084718899","https://openalex.org/W2106841911","https://openalex.org/W2125618481","https://openalex.org/W2140556610","https://openalex.org/W2399306297","https://openalex.org/W2563056823","https://openalex.org/W2734758221","https://openalex.org/W4246153096"],"related_works":["https://openalex.org/W2368964068","https://openalex.org/W189149726","https://openalex.org/W2767202586","https://openalex.org/W2523719706","https://openalex.org/W2161960576","https://openalex.org/W2357391150","https://openalex.org/W4285183212","https://openalex.org/W2358094779","https://openalex.org/W2186932829","https://openalex.org/W2170980056"],"abstract_inverted_index":{"This":[0,50],"paper":[1],"considers":[2],"centralized":[3],"routing":[4,58],"over":[5],"a":[6,18,30,45,70,141,167],"network":[7],"in":[8,29,53,76,157],"which":[9,77],"the":[10,22,27,34,39,42,54,91,102,117,126,131,135,147,158,161],"cost":[11,36,43,113,120],"of":[12,41,56,93,110],"each":[13],"edge":[14],"is":[15,24,74],"modeled":[16],"as":[17,114],"random":[19],"variable":[20],"and":[21,128,139],"objective":[23],"to":[25,44,101,145],"route":[26],"packets":[28],"manner":[31],"that":[32,104],"minimizes":[33],"expected":[35,118],"while":[37],"constraining":[38],"variance":[40],"pre-":[46],"determined":[47],"upper":[48],"bound.":[49],"problem":[51],"arises":[52],"context":[55],"flow-based":[57],"for":[59],"wireless":[60],"Software-Defined":[61],"Networks":[62],"(SDN).":[63],"A":[64],"Randomized":[65],"Dijkstra-based":[66],"Algorithm":[67],"(RDBR)":[68],"with":[69,85,134],"Lagrangian":[71],"Relaxation":[72],"Cost":[73],"proposed":[75,155],"two":[78,106],"distinct":[79],"shortest":[80,94],"paths":[81,107],"are":[82,109],"utilized":[83],"randomly":[84],"an":[86],"optimized":[87],"randomization":[88],"factor.":[89],"Here":[90],"notion":[92],"path":[95],"identified":[96],"by":[97,116],"Dijkstra's":[98],"algorithm":[99],"refers":[100],"property":[103],"these":[105],"both":[108],"minimum":[111],"regularized":[112],"defined":[115],"total":[119],"plus":[121],"weighted":[122],"variance.":[123],"We":[124],"prove":[125],"existence":[127],"optimality":[129],"when":[130],"weight":[132],"coincides":[133],"optimal":[136,148],"Lagrange":[137],"multiplier":[138],"propose":[140],"sub-gradient":[142],"descent":[143],"method":[144],"compute":[146],"multiplier.":[149],"Numerical":[150],"comparisons":[151],"against":[152],"other":[153],"previously":[154],"solutions":[156],"literature":[159],"illustrate":[160],"performance":[162],"improvements":[163],"under":[164],"RDBR":[165],"at":[166],"significantly":[168],"lower":[169],"or":[170],"comparable":[171],"computational":[172],"complexity.":[173]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}