{"id":"https://openalex.org/W4220786970","doi":"https://doi.org/10.23919/icact53585.2022.9728780","title":"End-to-End Routing Algorithm Based on Max-Flow Min-Cut in SDN Controllers","display_name":"End-to-End Routing Algorithm Based on Max-Flow Min-Cut in SDN Controllers","publication_year":2022,"publication_date":"2022-02-13","ids":{"openalex":"https://openalex.org/W4220786970","doi":"https://doi.org/10.23919/icact53585.2022.9728780"},"language":"en","primary_location":{"id":"doi:10.23919/icact53585.2022.9728780","is_oa":false,"landing_page_url":"https://doi.org/10.23919/icact53585.2022.9728780","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/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"],"is_corresponding":true,"raw_author_name":"Nada Alzaben","raw_affiliation_strings":["Princess Nourah Bint Abdulrahman University,College of Computer Science and Information,Dept. of Computer Science,Riyadh,Saudi Arabia","Southern Methodist University and a lecturer in the Department of Computer Science at Princess, Nourah bint Abdulrahman University, Riyadh, Saudi Arabia","Dept. of Computer Science, College of Computer Science and Information, Princess Nourah Bint Abdulrahman University, Riyadh, Saudi Arabia"],"affiliations":[{"raw_affiliation_string":"Princess Nourah Bint Abdulrahman University,College of Computer Science and Information,Dept. of Computer Science,Riyadh,Saudi Arabia","institution_ids":["https://openalex.org/I106778892"]},{"raw_affiliation_string":"Southern Methodist University and a lecturer in the Department of Computer Science at Princess, Nourah bint Abdulrahman University, Riyadh, Saudi Arabia","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","institution_ids":["https://openalex.org/I106778892"]}]},{"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,TX 75205"],"affiliations":[{"raw_affiliation_string":"Southern Methodist University,AT&T Center for Virtualization,Dallas,USA,TX 75205","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"],"apc_list":null,"apc_paid":null,"fwci":0.8648,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.6429366,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1405","last_page":"1413"},"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/T11598","display_name":"Internet Traffic Analysis and Secure E-voting","score":0.9961000084877014,"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"}},{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.9944000244140625,"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/computer-science","display_name":"Computer science","score":0.7090964317321777},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.6912478804588318},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6778781414031982},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5763326287269592},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.5338270664215088},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.5273417234420776},{"id":"https://openalex.org/keywords/selection-algorithm","display_name":"Selection algorithm","score":0.518059253692627},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5102481842041016},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4576900899410248},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.4484272003173828},{"id":"https://openalex.org/keywords/software-defined-networking","display_name":"Software-defined networking","score":0.44777461886405945},{"id":"https://openalex.org/keywords/throughput","display_name":"Throughput","score":0.44200438261032104},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.43282973766326904},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.42532455921173096},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.41416144371032715},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.41180071234703064},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.32562464475631714},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.27329021692276},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.21818485856056213},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.21358132362365723},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1692677140235901},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.0813102126121521},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.07002222537994385}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7090964317321777},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.6912478804588318},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6778781414031982},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5763326287269592},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.5338270664215088},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.5273417234420776},{"id":"https://openalex.org/C2775973920","wikidata":"https://www.wikidata.org/wiki/Q3252726","display_name":"Selection algorithm","level":3,"score":0.518059253692627},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5102481842041016},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4576900899410248},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.4484272003173828},{"id":"https://openalex.org/C77270119","wikidata":"https://www.wikidata.org/wiki/Q1655198","display_name":"Software-defined networking","level":2,"score":0.44777461886405945},{"id":"https://openalex.org/C157764524","wikidata":"https://www.wikidata.org/wiki/Q1383412","display_name":"Throughput","level":3,"score":0.44200438261032104},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.43282973766326904},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.42532455921173096},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.41416144371032715},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.41180071234703064},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.32562464475631714},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.27329021692276},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.21818485856056213},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.21358132362365723},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1692677140235901},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.0813102126121521},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07002222537994385},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"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/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.23919/icact53585.2022.9728780","is_oa":false,"landing_page_url":"https://doi.org/10.23919/icact53585.2022.9728780","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":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":45,"referenced_works":["https://openalex.org/W1501728955","https://openalex.org/W1552631569","https://openalex.org/W1965800821","https://openalex.org/W1965968818","https://openalex.org/W1969888266","https://openalex.org/W1973378440","https://openalex.org/W1986647006","https://openalex.org/W2000082826","https://openalex.org/W2006509256","https://openalex.org/W2007572995","https://openalex.org/W2011482408","https://openalex.org/W2014352548","https://openalex.org/W2040340473","https://openalex.org/W2069354103","https://openalex.org/W2082233540","https://openalex.org/W2092330486","https://openalex.org/W2095234341","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/W2147118406","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/W2784163843","https://openalex.org/W2804068220","https://openalex.org/W2980285097","https://openalex.org/W3097984811","https://openalex.org/W3135276716","https://openalex.org/W3209505979","https://openalex.org/W4213060235","https://openalex.org/W4213060883","https://openalex.org/W4231734403","https://openalex.org/W4252723988","https://openalex.org/W6610028881","https://openalex.org/W6632894899","https://openalex.org/W6674130342","https://openalex.org/W6729800543","https://openalex.org/W6751775837"],"related_works":["https://openalex.org/W2381419702","https://openalex.org/W1562631103","https://openalex.org/W2367161887","https://openalex.org/W2886722595","https://openalex.org/W2348177054","https://openalex.org/W4253588386","https://openalex.org/W2810620529","https://openalex.org/W2170980056","https://openalex.org/W4285816407","https://openalex.org/W2578319993"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"present":[4],"seven":[5],"novel":[6],"Max-Flow":[7],"Min-Cut":[8],"(MFMC)":[9],"based":[10],"algorithms":[11,25,55],"that":[12,103],"solve":[13],"the":[14,19,31,37,47,52,73,84,104,112,120,128],"flow":[15,40],"routing":[16,139],"problem":[17],"in":[18,83,138],"Software":[20],"Defined":[21],"Network":[22],"Controller.":[23],"Our":[24,54,78],"identify":[26],"potential":[27],"traffic":[28],"bottlenecks":[29,38],"using":[30,88],"MFMC":[32,89],"cut,":[33],"and":[34,90,126],"they":[35],"avoid":[36],"during":[39],"route":[41],"construction":[42],"through":[43],"their":[44],"choice":[45],"of":[46,75],"cut":[48,76],"edge":[49,60,65,69,93],"added":[50],"to":[51,96],"route.":[53],"utilize":[56],"either":[57],"a":[58,62],"random":[59],"selection,":[61,66],"shortest":[63,91,98],"path":[64,92,99],"or":[67],"an":[68],"capacity-based":[70],"selection":[71,94],"from":[72],"set":[74],"edges.":[77],"simulation":[79],"results":[80],"show":[81],"improvement":[82],"network":[85,142],"performance":[86,143],"when":[87],"compared":[95],"simple":[97],"first":[100],"algorithms,":[101],"such":[102],"mean":[105,113,129],"wait":[106],"time":[107,123],"is":[108,115,144],"reduced":[109,116],"by":[110,117,124,131,134],"15.1%,":[111],"slowdown":[114],"5.1%,":[118],"reducing":[119],"maximum":[121],"completion":[122],"9.6%,":[125],"increasing":[127],"throughput":[130],"18.3%.":[132],"Therefore,":[133],"explicitly":[135],"considering":[136],"congestion":[137],"decisions,":[140],"better":[141],"achieved.":[145]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}