{"id":"https://openalex.org/W4220797509","doi":"https://doi.org/10.23919/icact53585.2022.9728920","title":"End-to-End Routing in SDN Controllers Using Max-Flow Min-Cut Route Selection Algorithm","display_name":"End-to-End Routing in SDN Controllers Using Max-Flow Min-Cut Route Selection Algorithm","publication_year":2022,"publication_date":"2022-02-13","ids":{"openalex":"https://openalex.org/W4220797509","doi":"https://doi.org/10.23919/icact53585.2022.9728920"},"language":"en","primary_location":{"id":"doi:10.23919/icact53585.2022.9728920","is_oa":false,"landing_page_url":"https://doi.org/10.23919/icact53585.2022.9728920","pdf_url":null,"source":{"id":"https://openalex.org/S4363608017","display_name":"2022 24th International Conference on Advanced Communication Technology (ICACT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 24th International Conference on Advanced Communication Technology (ICACT)","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/A5083869325","display_name":"Nada Alzaben","orcid":"https://orcid.org/0000-0003-4778-4730"},"institutions":[{"id":"https://openalex.org/I178169726","display_name":"Southern Methodist University","ror":"https://ror.org/042tdr378","country_code":"US","type":"education","lineage":["https://openalex.org/I178169726"]},{"id":"https://openalex.org/I106778892","display_name":"Princess Nourah bint Abdulrahman University","ror":"https://ror.org/05b0cyh02","country_code":"SA","type":"education","lineage":["https://openalex.org/I106778892"]}],"countries":["SA","US"],"is_corresponding":true,"raw_author_name":"Nada Alzaben","raw_affiliation_strings":["Princess Nourah Bint Abdulrahman University Riyadh, Saudi Arabia, Southern Methodist University,College of Computer Science and Information,Dept. of Computer Science,Dallas,USA","Dept. of Computer Science, College of Computer Science and Information, Princess Nourah Bint Abdulrahman University Riyadh, Saudi Arabia, Southern Methodist University, Dallas, USA"],"affiliations":[{"raw_affiliation_string":"Princess Nourah Bint Abdulrahman University Riyadh, Saudi Arabia, Southern Methodist University,College of Computer Science and Information,Dept. of Computer Science,Dallas,USA","institution_ids":["https://openalex.org/I106778892"]},{"raw_affiliation_string":"Dept. of Computer Science, College of Computer Science and Information, Princess Nourah Bint Abdulrahman University Riyadh, Saudi Arabia, Southern Methodist University, Dallas, USA","institution_ids":["https://openalex.org/I106778892","https://openalex.org/I178169726"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111964903","display_name":"Daniel W. Engels","orcid":null},"institutions":[{"id":"https://openalex.org/I178169726","display_name":"Southern Methodist University","ror":"https://ror.org/042tdr378","country_code":"US","type":"education","lineage":["https://openalex.org/I178169726"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Daniel W. Engels","raw_affiliation_strings":["Southern Methodist University,AT&T Center for Virtualization,Dallas,USA"],"affiliations":[{"raw_affiliation_string":"Southern Methodist University,AT&T Center for Virtualization,Dallas,USA","institution_ids":["https://openalex.org/I178169726"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5083869325"],"corresponding_institution_ids":["https://openalex.org/I106778892","https://openalex.org/I178169726"],"apc_list":null,"apc_paid":null,"fwci":0.2162,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.24944383,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"461","last_page":"467"},"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.996999979019165,"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.9952999949455261,"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.7037662267684937},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.6468607187271118},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5867774486541748},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5621800422668457},{"id":"https://openalex.org/keywords/throughput","display_name":"Throughput","score":0.5604340434074402},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5165295004844666},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.5115512013435364},{"id":"https://openalex.org/keywords/suurballes-algorithm","display_name":"Suurballe's algorithm","score":0.5022068023681641},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.45341405272483826},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.43982017040252686},{"id":"https://openalex.org/keywords/distance-vector-routing-protocol","display_name":"Distance-vector routing protocol","score":0.4245883524417877},{"id":"https://openalex.org/keywords/selection-algorithm","display_name":"Selection algorithm","score":0.42049640417099},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.41778290271759033},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.4069719910621643},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.29452794790267944},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.18215897679328918},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16881683468818665},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.13836899399757385}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7037662267684937},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.6468607187271118},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5867774486541748},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5621800422668457},{"id":"https://openalex.org/C157764524","wikidata":"https://www.wikidata.org/wiki/Q1383412","display_name":"Throughput","level":3,"score":0.5604340434074402},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5165295004844666},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.5115512013435364},{"id":"https://openalex.org/C98779529","wikidata":"https://www.wikidata.org/wiki/Q7650417","display_name":"Suurballe's algorithm","level":5,"score":0.5022068023681641},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.45341405272483826},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.43982017040252686},{"id":"https://openalex.org/C202385902","wikidata":"https://www.wikidata.org/wiki/Q1229441","display_name":"Distance-vector routing protocol","level":5,"score":0.4245883524417877},{"id":"https://openalex.org/C2775973920","wikidata":"https://www.wikidata.org/wiki/Q3252726","display_name":"Selection algorithm","level":3,"score":0.42049640417099},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.41778290271759033},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.4069719910621643},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.29452794790267944},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.18215897679328918},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16881683468818665},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.13836899399757385},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.23919/icact53585.2022.9728920","is_oa":false,"landing_page_url":"https://doi.org/10.23919/icact53585.2022.9728920","pdf_url":null,"source":{"id":"https://openalex.org/S4363608017","display_name":"2022 24th International Conference on Advanced Communication Technology (ICACT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 24th International Conference on Advanced Communication Technology (ICACT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/7","display_name":"Affordable and clean energy","score":0.8999999761581421}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1965800821","https://openalex.org/W1965968818","https://openalex.org/W1986647006","https://openalex.org/W2007572995","https://openalex.org/W2014352548","https://openalex.org/W2040340473","https://openalex.org/W2069354103","https://openalex.org/W2092330486","https://openalex.org/W2110722699","https://openalex.org/W2115883396","https://openalex.org/W2120608001","https://openalex.org/W2139433454","https://openalex.org/W2143828836","https://openalex.org/W2146320425","https://openalex.org/W2150093579","https://openalex.org/W2227557434","https://openalex.org/W2509829918","https://openalex.org/W2557996778","https://openalex.org/W2642006005","https://openalex.org/W2735268167","https://openalex.org/W2980285097","https://openalex.org/W4213060883","https://openalex.org/W4252723988","https://openalex.org/W6610028881"],"related_works":["https://openalex.org/W2314157120","https://openalex.org/W2382831994","https://openalex.org/W1817053572","https://openalex.org/W2371042914","https://openalex.org/W2376231728","https://openalex.org/W3015233512","https://openalex.org/W2339073167","https://openalex.org/W2978166001","https://openalex.org/W2089521921","https://openalex.org/W2064062094"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"present":[4],"a":[5],"novel":[6],"max-flow":[7,51,73],"min-cut":[8,52,74],"based":[9,75],"algorithm":[10,48,53,76],"to":[11,54,60,110,130],"solve":[12],"the":[13,18,50,64,78,83,90,96,104,111],"flow":[14,65],"routing":[15,66],"problem":[16],"in":[17,32,58,63,118],"Software":[19],"Defined":[20],"Network":[21],"Controller.":[22],"Routing":[23],"using":[24],"traditional":[25],"shortest":[26],"path":[27],"first":[28],"algorithms":[29],"often":[30],"results":[31],"bottlenecks":[33,57],"that":[34,71],"cause":[35],"performance":[36,80],"degradation":[37],"including":[38],"higher":[39],"energy":[40],"use,":[41],"reduced":[42],"throughput,":[43],"and":[44,102],"increased":[45],"slowdown.":[46],"Our":[47,68],"uses":[49],"identify":[55],"potential":[56],"order":[59],"avoid":[61],"them":[62],"decisions.":[67],"simulations":[69],"show":[70],"our":[72,124],"improves":[77],"network":[79],"by":[81,87,93,100,107],"minimizing":[82,89,95],"mean":[84,91,105],"wait":[85],"time":[86,99],"15.1%,":[88],"slowdown":[92],"6.1%,":[94],"maximum":[97],"completion":[98],"9.6%,":[101],"maximize":[103,131],"throughput":[106],"18.3%":[108],"compared":[109],"Shortest":[112],"Path":[113],"algorithm.":[114],"Explicitly":[115],"considering":[116],"congestion":[117],"determining":[119],"routes,":[120],"such":[121],"as":[122],"with":[123],"Max-Flow":[125],"Min-Cut":[126],"algorithm,":[127],"is":[128],"necessary":[129],"performance.":[132]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}