{"id":"https://openalex.org/W4401508593","doi":"https://doi.org/10.1109/infocom52122.2024.10621340","title":"Approximation Algorithms for Minimizing Congestion in Demand-Aware Networks","display_name":"Approximation Algorithms for Minimizing Congestion in Demand-Aware Networks","publication_year":2024,"publication_date":"2024-05-20","ids":{"openalex":"https://openalex.org/W4401508593","doi":"https://doi.org/10.1109/infocom52122.2024.10621340"},"language":"en","primary_location":{"id":"doi:10.1109/infocom52122.2024.10621340","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom52122.2024.10621340","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2024 - IEEE Conference on Computer Communications","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/A5081411512","display_name":"Wenkai Dai","orcid":"https://orcid.org/0000-0002-2153-4250"},"institutions":[{"id":"https://openalex.org/I129774422","display_name":"University of Vienna","ror":"https://ror.org/03prydq77","country_code":"AT","type":"education","lineage":["https://openalex.org/I129774422"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"Wenkai Dai","raw_affiliation_strings":["University of Vienna,Faculty of Computer Science and UniVie Doctoral School Computer Science DoCS,Austria"],"affiliations":[{"raw_affiliation_string":"University of Vienna,Faculty of Computer Science and UniVie Doctoral School Computer Science DoCS,Austria","institution_ids":["https://openalex.org/I129774422"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049161363","display_name":"Michael Dinitz","orcid":"https://orcid.org/0000-0002-2632-966X"},"institutions":[{"id":"https://openalex.org/I145311948","display_name":"Johns Hopkins University","ror":"https://ror.org/00za53h95","country_code":"US","type":"education","lineage":["https://openalex.org/I145311948"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Michael Dinitz","raw_affiliation_strings":["Johns Hopkins University,Department of Computer Science,USA"],"affiliations":[{"raw_affiliation_string":"Johns Hopkins University,Department of Computer Science,USA","institution_ids":["https://openalex.org/I145311948"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5085843145","display_name":"Klaus-Tycho Foerster","orcid":"https://orcid.org/0000-0003-4635-4480"},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Klaus-Tycho Foerster","raw_affiliation_strings":["TU Dortmund,Department of Computer Science,Germany"],"affiliations":[{"raw_affiliation_string":"TU Dortmund,Department of Computer Science,Germany","institution_ids":["https://openalex.org/I200332995"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5112349323","display_name":"Long Luo","orcid":null},"institutions":[{"id":"https://openalex.org/I150229711","display_name":"University of Electronic Science and Technology of China","ror":"https://ror.org/04qr3zq92","country_code":"CN","type":"education","lineage":["https://openalex.org/I150229711"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Long Luo","raw_affiliation_strings":["University of Electronic Science and Technology of China,P.R. China"],"affiliations":[{"raw_affiliation_string":"University of Electronic Science and Technology of China,P.R. China","institution_ids":["https://openalex.org/I150229711"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066080641","display_name":"Stefan Schmid","orcid":"https://orcid.org/0000-0002-7798-1711"},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Stefan Schmid","raw_affiliation_strings":["TU Berlin,Germany"],"affiliations":[{"raw_affiliation_string":"TU Berlin,Germany","institution_ids":["https://openalex.org/I4577782"]}]}],"institutions":[],"countries_distinct_count":4,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5081411512"],"corresponding_institution_ids":["https://openalex.org/I129774422"],"apc_list":null,"apc_paid":null,"fwci":0.6674,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.69174064,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1461","last_page":"1470"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11409","display_name":"Advanced Wireless Network Optimization","score":0.9965000152587891,"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"}},"topics":[{"id":"https://openalex.org/T11409","display_name":"Advanced Wireless Network Optimization","score":0.9965000152587891,"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/T10101","display_name":"Cloud Computing and Resource Management","score":0.9962999820709229,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T11478","display_name":"Caching and Content Delivery","score":0.9947999715805054,"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.723333477973938},{"id":"https://openalex.org/keywords/network-congestion","display_name":"Network congestion","score":0.5503060221672058},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5025687217712402},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41600751876831055},{"id":"https://openalex.org/keywords/algorithm-design","display_name":"Algorithm design","score":0.413704514503479},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3608061671257019},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.34365421533584595},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.2775552272796631},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1273917853832245}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.723333477973938},{"id":"https://openalex.org/C195563490","wikidata":"https://www.wikidata.org/wiki/Q180368","display_name":"Network congestion","level":3,"score":0.5503060221672058},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5025687217712402},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41600751876831055},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.413704514503479},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3608061671257019},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.34365421533584595},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.2775552272796631},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1273917853832245},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/infocom52122.2024.10621340","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom52122.2024.10621340","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2024 - IEEE Conference on Computer Communications","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"},{"id":"https://openalex.org/F4320334678","display_name":"European Research Council","ror":"https://ror.org/0472cxd90"},{"id":"https://openalex.org/F4320337504","display_name":"Research and Development","ror":"https://ror.org/027s68j25"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":65,"referenced_works":["https://openalex.org/W1515075899","https://openalex.org/W1522033472","https://openalex.org/W1595563493","https://openalex.org/W2011039300","https://openalex.org/W2062832101","https://openalex.org/W2130531694","https://openalex.org/W2168595508","https://openalex.org/W2315437335","https://openalex.org/W2466928157","https://openalex.org/W2486960733","https://openalex.org/W2506642202","https://openalex.org/W2530249205","https://openalex.org/W2559629050","https://openalex.org/W2743429249","https://openalex.org/W2744073496","https://openalex.org/W2763269482","https://openalex.org/W2810723790","https://openalex.org/W2895885627","https://openalex.org/W2919562786","https://openalex.org/W2949666640","https://openalex.org/W2962819996","https://openalex.org/W2964058648","https://openalex.org/W2997806297","https://openalex.org/W3000369292","https://openalex.org/W3001053786","https://openalex.org/W3003736296","https://openalex.org/W3008830959","https://openalex.org/W3008905547","https://openalex.org/W3009595907","https://openalex.org/W3046344355","https://openalex.org/W3046430097","https://openalex.org/W3047390477","https://openalex.org/W3092568455","https://openalex.org/W3134611145","https://openalex.org/W3144786718","https://openalex.org/W3161518659","https://openalex.org/W3174005996","https://openalex.org/W3203638966","https://openalex.org/W4205585032","https://openalex.org/W4206034011","https://openalex.org/W4221155774","https://openalex.org/W4224211790","https://openalex.org/W4231891315","https://openalex.org/W4232284301","https://openalex.org/W4234682775","https://openalex.org/W4251897646","https://openalex.org/W4256632036","https://openalex.org/W4284899720","https://openalex.org/W4287728668","https://openalex.org/W4290990894","https://openalex.org/W4297816311","https://openalex.org/W4309046071","https://openalex.org/W4367047476","https://openalex.org/W4382197640","https://openalex.org/W4382199207","https://openalex.org/W4386243269","https://openalex.org/W4389104860","https://openalex.org/W4401508593","https://openalex.org/W6682220054","https://openalex.org/W6684402220","https://openalex.org/W6760882819","https://openalex.org/W6779769511","https://openalex.org/W6810374806","https://openalex.org/W6846351657","https://openalex.org/W6947828671"],"related_works":["https://openalex.org/W2892220642","https://openalex.org/W2024471263","https://openalex.org/W2034785493","https://openalex.org/W2182424533","https://openalex.org/W2369428326","https://openalex.org/W2560201450","https://openalex.org/W2375991383","https://openalex.org/W3122413977","https://openalex.org/W1976909470","https://openalex.org/W2153680687"],"abstract_inverted_index":{"Emerging":[0],"reconfigurable":[1],"optical":[2],"communication":[3],"technologies":[4],"allow":[5],"to":[6,33,198],"enhance":[7],"datacenter":[8],"topologies":[9],"with":[10],"demand-aware":[11,31,58],"links":[12],"optimized":[13],"towards":[14],"traffic":[15],"patterns.":[16],"This":[17],"paper":[18],"studies":[19],"the":[20,70,120,145,167],"algorithmic":[21],"problem":[22,71,146],"of":[23,98,122,137],"jointly":[24],"optimizing":[25],"topology":[26],"and":[27,44,59,64,89,95,105,131,185],"routing":[28,47],"in":[29,194],"such":[30],"networks":[32],"minimize":[34],"congestion,":[35],"along":[36],"two":[37],"dimensions:":[38],"(1)":[39],"splittable":[40,63],"or":[41,54],"unsplittable":[42,88],"flows,":[43],"(2)":[45],"whether":[46,51],"is":[48,72,119,179],"segregated,":[49],"i.e.,":[50],"routes":[52],"can":[53],"cannot":[55,147],"combine":[56],"both":[57],"demand-oblivious":[60],"(static)":[61],"links.For":[62],"segregated":[65,90],"routing,":[66,91,133],"we":[67,92],"show":[68,190],"that":[69,128],"generally":[73],"2-approximable,":[74],"but":[75,178],"APX-hard":[76],"even":[77,134],"for":[78,113,135,175,181],"uniform":[79,176,186],"demands":[80,136],"induced":[81],"by":[82],"a":[83,138,182,191],"bipartite":[84],"demand":[85],"graph.":[86],"For":[87],"establish":[93],"upper":[94],"lower":[96],"bounds":[97],"O":[99],"(log":[100,107],"m/":[101,108],"log":[102,103,109,110],"m)":[104],"\u03a9":[106],"m),":[111],"respectively,":[112],"polynomial-time":[114],"approximation":[115],"algorithms,":[116],"where":[117,158],"m":[118],"number":[121],"static":[123],"links.":[124],"We":[125],"further":[126],"reveal":[127],"under":[129],"un-/splittable":[130],"non-segregated":[132],"single":[139,183],"source":[140],"(resp.,":[141,162,169],"d":[142],"estina":[143],"tion),":[144],"be":[148],"approximated":[149],"better":[150],"than":[151],"$\\Omega":[152],"\\left({\\frac{{{c_{\\max":[153],"}}}}{{{c_{\\min":[154],"}}}}}\\right)$":[155],"unless":[156],"P=NP,":[157],"c<inf":[159,163],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[160,164],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">max</inf>":[161],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">min</inf>)":[165],"denotes":[166],"maximum":[168],"minimum)":[170],"capacity.":[171],"It":[172],"remains":[173],"NP-hard":[174],"capacities,":[177],"tractable":[180],"commodity":[184],"capacities.Our":[187],"trace-driven":[188],"simulations":[189],"significant":[192],"reduction":[193],"network":[195],"congestion":[196],"compared":[197],"existing":[199],"solutions.":[200]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2}],"updated_date":"2025-12-21T23:12:01.093139","created_date":"2025-10-10T00:00:00"}