{"id":"https://openalex.org/W2600805517","doi":"https://doi.org/10.1109/isspit.2016.7886047","title":"A greedy power-aware routing algorithm for software-defined networks","display_name":"A greedy power-aware routing algorithm for software-defined networks","publication_year":2016,"publication_date":"2016-12-01","ids":{"openalex":"https://openalex.org/W2600805517","doi":"https://doi.org/10.1109/isspit.2016.7886047","mag":"2600805517"},"language":"en","primary_location":{"id":"doi:10.1109/isspit.2016.7886047","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isspit.2016.7886047","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)","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/A5030761904","display_name":"Mohamad Khattar Awad","orcid":"https://orcid.org/0000-0003-2081-8160"},"institutions":[{"id":"https://openalex.org/I36721946","display_name":"Kuwait University","ror":"https://ror.org/021e5j056","country_code":"KW","type":"education","lineage":["https://openalex.org/I36721946"]}],"countries":["KW"],"is_corresponding":false,"raw_author_name":"Mohamad Khattar Awad","raw_affiliation_strings":["Computer Engineering Department, College of Computing Sciences and Engineering, Kuwait University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Engineering Department, College of Computing Sciences and Engineering, Kuwait University","institution_ids":["https://openalex.org/I36721946"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5085667721","display_name":"Yousef Rafique","orcid":"https://orcid.org/0000-0002-0008-5329"},"institutions":[{"id":"https://openalex.org/I36721946","display_name":"Kuwait University","ror":"https://ror.org/021e5j056","country_code":"KW","type":"education","lineage":["https://openalex.org/I36721946"]}],"countries":["KW"],"is_corresponding":false,"raw_author_name":"Yousef Rafique","raw_affiliation_strings":["Computer Engineering Department, College of Computing Sciences and Engineering, Kuwait University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Engineering Department, College of Computing Sciences and Engineering, Kuwait University","institution_ids":["https://openalex.org/I36721946"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5044062680","display_name":"Sarah Alhadlaq","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sarah Alhadlaq","raw_affiliation_strings":["Ministry of Electricity and Water, Information Technology Department, Kuwait"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ministry of Electricity and Water, Information Technology Department, Kuwait","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5054666855","display_name":"Dunya Hassoun","orcid":null},"institutions":[{"id":"https://openalex.org/I67042835","display_name":"Australian University, Kuwait","ror":"https://ror.org/02029th93","country_code":"KW","type":"education","lineage":["https://openalex.org/I67042835"]}],"countries":["KW"],"is_corresponding":false,"raw_author_name":"Dunya Hassoun","raw_affiliation_strings":["Australian College of Kuwait, Information Technology Department, Kuwait"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Australian College of Kuwait, Information Technology Department, Kuwait","institution_ids":["https://openalex.org/I67042835"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5017400892","display_name":"Asmaa Alabdulhadi","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Asmaa Alabdulhadi","raw_affiliation_strings":["Information Technology Department, Ministry of Higher Education, Kuwait"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Information Technology Department, Ministry of Higher Education, Kuwait","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008780728","display_name":"Sheikha Thani","orcid":null},"institutions":[{"id":"https://openalex.org/I143601524","display_name":"Public Authority for Applied Education and Training","ror":"https://ror.org/024242h31","country_code":"KW","type":"education","lineage":["https://openalex.org/I143601524"]}],"countries":["KW"],"is_corresponding":false,"raw_author_name":"Sheikha Thani","raw_affiliation_strings":["The Public Authority for Civil Information, Information Technology Department, Kuwait"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Public Authority for Civil Information, Information Technology Department, Kuwait","institution_ids":["https://openalex.org/I143601524"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"268","last_page":"273"},"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/T10847","display_name":"Advanced Optical Network Technologies","score":0.9970999956130981,"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.9860000014305115,"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.7031407356262207},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.6240924000740051},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.6059406995773315},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.5661171674728394},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.5568726658821106},{"id":"https://openalex.org/keywords/software-defined-networking","display_name":"Software-defined networking","score":0.5378749370574951},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5099474191665649},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.49194642901420593},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4900883436203003},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4786352217197418},{"id":"https://openalex.org/keywords/routing-table","display_name":"Routing table","score":0.4599994122982025},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4541435241699219},{"id":"https://openalex.org/keywords/destination-sequenced-distance-vector-routing","display_name":"Destination-Sequenced Distance Vector routing","score":0.44907480478286743},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.4305807948112488},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.42542409896850586},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.41978222131729126},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.4154934883117676},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3689451217651367},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.3164697289466858},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.23100054264068604},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18878665566444397},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.10226428508758545},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.10060438513755798},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.08264091610908508}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7031407356262207},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.6240924000740051},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.6059406995773315},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.5661171674728394},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.5568726658821106},{"id":"https://openalex.org/C77270119","wikidata":"https://www.wikidata.org/wiki/Q1655198","display_name":"Software-defined networking","level":2,"score":0.5378749370574951},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5099474191665649},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.49194642901420593},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4900883436203003},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4786352217197418},{"id":"https://openalex.org/C184896649","wikidata":"https://www.wikidata.org/wiki/Q290066","display_name":"Routing table","level":4,"score":0.4599994122982025},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4541435241699219},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.44907480478286743},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.4305807948112488},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.42542409896850586},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.41978222131729126},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.4154934883117676},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3689451217651367},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.3164697289466858},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23100054264068604},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18878665566444397},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.10226428508758545},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.10060438513755798},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.08264091610908508},{"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/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isspit.2016.7886047","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isspit.2016.7886047","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Affordable and clean energy","score":0.8899999856948853,"id":"https://metadata.un.org/sdg/7"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320321818","display_name":"Kuwait Foundation for the Advancement of Sciences","ror":"https://ror.org/03xr9q522"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1972264275","https://openalex.org/W1973273253","https://openalex.org/W1993210075","https://openalex.org/W2028377472","https://openalex.org/W2067551786","https://openalex.org/W2072334177","https://openalex.org/W2104589727","https://openalex.org/W2150093579","https://openalex.org/W2167603807","https://openalex.org/W2216269735","https://openalex.org/W2308845060","https://openalex.org/W2557890845"],"related_works":["https://openalex.org/W2349715051","https://openalex.org/W2386369498","https://openalex.org/W4385819622","https://openalex.org/W2347665962","https://openalex.org/W2555559350","https://openalex.org/W2162880363","https://openalex.org/W2351097701","https://openalex.org/W2317653264","https://openalex.org/W2120750391","https://openalex.org/W2509718831"],"abstract_inverted_index":{"We":[0],"consider":[1],"the":[2,6,33,37,45,52,60,66,99,120],"problem":[3,79,84],"of":[4,17,48,62,68,101],"minimizing":[5],"routing":[7,27,38,42],"power":[8,39,76,127],"consumption":[9,40],"in":[10,75,129,147],"software-defined":[11,18],"networks.":[12],"The":[13,140],"network":[14,131],"is":[15,80,152],"composed":[16],"networking":[19],"(SDN)":[20],"nodes":[21],"and":[22,65,85,104,110],"a":[23,81,93,135],"central":[24,34],"controller":[25,35],"where":[26],"decisions":[28],"are":[29,142],"centralized.":[30],"More":[31],"specifically,":[32],"minimizes":[36],"by":[41,107],"flows":[43,109],"on":[44,113],"minimum":[46],"number":[47,61,100],"active":[49,102],"links":[50,64,103],"with":[51,144],"lowest":[53],"discrete":[54],"link":[55,69,105],"rates.":[56],"Thus,":[57],"it":[58],"maximizes":[59],"inactive":[63],"level":[67],"rates,":[70],"which":[71],"reflects":[72],"significant":[73],"saving":[74,128],"consumption.":[77],"This":[78],"mixed-integer":[82],"programming":[83],"known":[86],"to":[87,97,125,134],"be":[88],"NP-hard.":[89],"Therefore,":[90],"we":[91],"propose":[92],"low-complexity":[94],"greedy":[95],"heuristic":[96],"minimize":[98],"rates":[106],"rerouting":[108],"aggregating":[111],"them":[112],"common":[114],"links.":[115],"Numerical":[116],"results":[117],"show":[118],"that":[119,151],"proposed":[121],"algorithm":[122],"achieves":[123],"17.18%":[124],"32.97%":[126],"real":[130],"topologies":[132],"relative":[133],"base":[136],"shortest":[137],"path":[138,149],"algorithm.":[139],"savings":[141],"achieved":[143],"minimal":[145],"increase":[146],"average":[148],"length":[150],"less":[153],"than":[154],"0.2":[155],"hops.":[156]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":1}],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2025-10-10T00:00:00"}