{"id":"https://openalex.org/W2959629243","doi":"https://doi.org/10.1109/icc.2019.8761398","title":"Rate-Based Dynamic Shortest Path Algorithm for Efficiently Routing Multiple Flows in SDN","display_name":"Rate-Based Dynamic Shortest Path Algorithm for Efficiently Routing Multiple Flows in SDN","publication_year":2019,"publication_date":"2019-05-01","ids":{"openalex":"https://openalex.org/W2959629243","doi":"https://doi.org/10.1109/icc.2019.8761398","mag":"2959629243"},"language":"en","primary_location":{"id":"doi:10.1109/icc.2019.8761398","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2019.8761398","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ICC 2019 - 2019 IEEE International Conference on Communications (ICC)","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/A5090489906","display_name":"Erdal Akin","orcid":"https://orcid.org/0000-0002-2223-3927"},"institutions":[{"id":"https://openalex.org/I45438204","display_name":"The University of Texas at San Antonio","ror":"https://ror.org/01kd65564","country_code":"US","type":"education","lineage":["https://openalex.org/I45438204"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Erdal Akin","raw_affiliation_strings":["University of Texas at San Antonio, Texas, USA"],"affiliations":[{"raw_affiliation_string":"University of Texas at San Antonio, Texas, USA","institution_ids":["https://openalex.org/I45438204"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5011209223","display_name":"Turgay Korkmaz","orcid":"https://orcid.org/0000-0002-5529-673X"},"institutions":[{"id":"https://openalex.org/I45438204","display_name":"The University of Texas at San Antonio","ror":"https://ror.org/01kd65564","country_code":"US","type":"education","lineage":["https://openalex.org/I45438204"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Turgay Korkmaz","raw_affiliation_strings":["University of Texas at San Antonio, Texas, USA"],"affiliations":[{"raw_affiliation_string":"University of Texas at San Antonio, Texas, USA","institution_ids":["https://openalex.org/I45438204"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5090489906"],"corresponding_institution_ids":["https://openalex.org/I45438204"],"apc_list":null,"apc_paid":null,"fwci":1.2379,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.81366663,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"9","issue":null,"first_page":"1","last_page":"7"},"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/T10138","display_name":"Network Traffic and Congestion Control","score":0.9983999729156494,"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/T11598","display_name":"Internet Traffic Analysis and Secure E-voting","score":0.9968000054359436,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/computer-science","display_name":"Computer science","score":0.7780395746231079},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5567265152931213},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.5516822338104248},{"id":"https://openalex.org/keywords/load-balancing","display_name":"Load balancing (electrical power)","score":0.5423179268836975},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5416345000267029},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.5291847586631775},{"id":"https://openalex.org/keywords/throughput","display_name":"Throughput","score":0.5165532827377319},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5073966383934021},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5020666122436523},{"id":"https://openalex.org/keywords/bandwidth","display_name":"Bandwidth (computing)","score":0.4946911036968231},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4425508677959442},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.373569130897522},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3542678952217102},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.33534491062164307},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.2019755244255066},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.16538488864898682},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.13895031809806824}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7780395746231079},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5567265152931213},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.5516822338104248},{"id":"https://openalex.org/C138959212","wikidata":"https://www.wikidata.org/wiki/Q1806783","display_name":"Load balancing (electrical power)","level":3,"score":0.5423179268836975},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5416345000267029},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.5291847586631775},{"id":"https://openalex.org/C157764524","wikidata":"https://www.wikidata.org/wiki/Q1383412","display_name":"Throughput","level":3,"score":0.5165532827377319},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5073966383934021},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5020666122436523},{"id":"https://openalex.org/C2776257435","wikidata":"https://www.wikidata.org/wiki/Q1576430","display_name":"Bandwidth (computing)","level":2,"score":0.4946911036968231},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4425508677959442},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.373569130897522},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3542678952217102},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.33534491062164307},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.2019755244255066},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.16538488864898682},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13895031809806824},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icc.2019.8761398","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2019.8761398","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ICC 2019 - 2019 IEEE International Conference on Communications (ICC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","score":0.4099999964237213,"display_name":"Industry, innovation and infrastructure"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":38,"referenced_works":["https://openalex.org/W637957720","https://openalex.org/W1557080096","https://openalex.org/W1591562949","https://openalex.org/W1698388015","https://openalex.org/W1948092788","https://openalex.org/W1966838648","https://openalex.org/W2001532889","https://openalex.org/W2019062750","https://openalex.org/W2042420160","https://openalex.org/W2074762809","https://openalex.org/W2110722699","https://openalex.org/W2114525688","https://openalex.org/W2120608001","https://openalex.org/W2122625530","https://openalex.org/W2126822952","https://openalex.org/W2131629857","https://openalex.org/W2132324770","https://openalex.org/W2139433454","https://openalex.org/W2145563843","https://openalex.org/W2169246522","https://openalex.org/W2243986870","https://openalex.org/W2275530856","https://openalex.org/W2338293612","https://openalex.org/W2465793152","https://openalex.org/W2559050918","https://openalex.org/W2597902214","https://openalex.org/W2598905024","https://openalex.org/W2599377167","https://openalex.org/W2599557761","https://openalex.org/W2753412869","https://openalex.org/W2766534375","https://openalex.org/W3100695898","https://openalex.org/W4213060235","https://openalex.org/W4254522945","https://openalex.org/W6669268651","https://openalex.org/W6677240351","https://openalex.org/W6680936655","https://openalex.org/W6730569170"],"related_works":["https://openalex.org/W2555559350","https://openalex.org/W1971663816","https://openalex.org/W2113362813","https://openalex.org/W2108305519","https://openalex.org/W1242343826","https://openalex.org/W2001312276","https://openalex.org/W2949702215","https://openalex.org/W4241849776","https://openalex.org/W3035942111","https://openalex.org/W2351097701"],"abstract_inverted_index":{"Efficient":[0],"routing":[1,34],"necessitates":[2],"the":[3,31,38,48,62,65,71,132],"underlying":[4],"path":[5,11],"selection":[6],"algorithms":[7],"to":[8,102],"find":[9,103],"a":[10,20,52,97,112],"that":[12,106],"can":[13,107],"satisfy":[14,108],"certain":[15],"Quality-of-Service":[16],"(QoS)":[17],"requirements":[18,110],"of":[19,33,111,115,134],"given":[21,113],"flow":[22],"while":[23,118],"maximizing":[24,86],"throughput":[25,87,121],"and":[26,56,74,88,122],"minimizing":[27,89],"maximum":[28,90],"link-load.":[29,91],"In":[30,92],"case":[32],"multiple":[35,43,104],"flows":[36,117],"at":[37],"same":[39],"time,":[40],"finding":[41],"such":[42],"paths":[44,105],"even":[45],"with":[46],"just":[47],"bandwidth":[49,109],"constraint":[50],"is":[51],"well-known":[53],"NP-hard":[54],"problem":[55],"has":[57],"been":[58],"widely":[59],"studied":[60],"in":[61,85,125],"literature":[63],"as":[64],"Unsplittable":[66],"Flow":[67],"Problem":[68],"(UFP).":[69],"Unfortunately,":[70],"existing":[72],"approximation":[73],"heuristic":[75,100,136],"solutions":[76],"suffer":[77],"from":[78],"excessive":[79],"computation":[80],"time":[81],"or":[82],"low":[83],"performance":[84],"this":[93],"paper,":[94],"we":[95],"propose":[96],"new":[98],"effective":[99],"solution":[101],"set":[114],"unsplittable":[116],"providing":[119],"better":[120],"load":[123],"balancing":[124],"Software":[126],"Defined":[127],"Networks":[128],"(SDN).":[129],"We":[130],"demonstrate":[131],"efficiency":[133],"our":[135],"using":[137],"simulations.":[138]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}