{"id":"https://openalex.org/W4365420697","doi":"https://doi.org/10.1109/tnet.2023.3264632","title":"Optimal Oblivious Routing With Concave Objectives for Structured Networks","display_name":"Optimal Oblivious Routing With Concave Objectives for Structured Networks","publication_year":2023,"publication_date":"2023-04-12","ids":{"openalex":"https://openalex.org/W4365420697","doi":"https://doi.org/10.1109/tnet.2023.3264632"},"language":"en","primary_location":{"id":"doi:10.1109/tnet.2023.3264632","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tnet.2023.3264632","pdf_url":null,"source":{"id":"https://openalex.org/S62238642","display_name":"IEEE/ACM Transactions on Networking","issn_l":"1063-6692","issn":["1063-6692","1558-2566"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE/ACM Transactions on Networking","raw_type":"journal-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/A5038832299","display_name":"Kanatip Chitavisutthivong","orcid":"https://orcid.org/0000-0001-5471-2271"},"institutions":[{"id":"https://openalex.org/I4210153049","display_name":"Vidyasirimedhi Institute of Science and Technology","ror":"https://ror.org/053jehz60","country_code":"TH","type":"education","lineage":["https://openalex.org/I4210153049"]}],"countries":["TH"],"is_corresponding":false,"raw_author_name":"Kanatip Chitavisutthivong","raw_affiliation_strings":["School of Information Science and Technology, Vidyasirimedhi Institute of Science and Technology, Rayong, Thailand"],"raw_orcid":"https://orcid.org/0000-0001-5471-2271","affiliations":[{"raw_affiliation_string":"School of Information Science and Technology, Vidyasirimedhi Institute of Science and Technology, Rayong, Thailand","institution_ids":["https://openalex.org/I4210153049"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5022960783","display_name":"Sucha Supittayapornpong","orcid":"https://orcid.org/0000-0001-8016-4918"},"institutions":[{"id":"https://openalex.org/I4210153049","display_name":"Vidyasirimedhi Institute of Science and Technology","ror":"https://ror.org/053jehz60","country_code":"TH","type":"education","lineage":["https://openalex.org/I4210153049"]}],"countries":["TH"],"is_corresponding":false,"raw_author_name":"Sucha Supittayapornpong","raw_affiliation_strings":["School of Information Science and Technology, Vidyasirimedhi Institute of Science and Technology, Rayong, Thailand"],"raw_orcid":"https://orcid.org/0000-0001-8016-4918","affiliations":[{"raw_affiliation_string":"School of Information Science and Technology, Vidyasirimedhi Institute of Science and Technology, Rayong, Thailand","institution_ids":["https://openalex.org/I4210153049"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5046149377","display_name":"Pooria Namyar","orcid":"https://orcid.org/0000-0001-7704-5440"},"institutions":[{"id":"https://openalex.org/I1174212","display_name":"University of Southern California","ror":"https://ror.org/03taz7m60","country_code":"US","type":"education","lineage":["https://openalex.org/I1174212"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Pooria Namyar","raw_affiliation_strings":["Department of Electrical Engineering, University of Southern California, Los Angeles, CA, USA"],"raw_orcid":"https://orcid.org/0000-0001-7704-5440","affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, University of Southern California, Los Angeles, CA, USA","institution_ids":["https://openalex.org/I1174212"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100432821","display_name":"Mingyang Zhang","orcid":"https://orcid.org/0000-0002-9768-516X"},"institutions":[{"id":"https://openalex.org/I1174212","display_name":"University of Southern California","ror":"https://ror.org/03taz7m60","country_code":"US","type":"education","lineage":["https://openalex.org/I1174212"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mingyang Zhang","raw_affiliation_strings":["Department of Computer Science, University of Southern California, Los Angeles, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Southern California, Los Angeles, CA, USA","institution_ids":["https://openalex.org/I1174212"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5035157838","display_name":"Minlan Yu","orcid":"https://orcid.org/0000-0002-2381-0212"},"institutions":[{"id":"https://openalex.org/I136199984","display_name":"Harvard University","ror":"https://ror.org/03vek6s52","country_code":"US","type":"education","lineage":["https://openalex.org/I136199984"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Minlan Yu","raw_affiliation_strings":["Department of Computer Science, Harvard University, Cambridge, MA, USA"],"raw_orcid":"https://orcid.org/0000-0002-2381-0212","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Harvard University, Cambridge, MA, USA","institution_ids":["https://openalex.org/I136199984"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5042326103","display_name":"Ramesh Govindan","orcid":"https://orcid.org/0000-0001-8311-8853"},"institutions":[{"id":"https://openalex.org/I1174212","display_name":"University of Southern California","ror":"https://ror.org/03taz7m60","country_code":"US","type":"education","lineage":["https://openalex.org/I1174212"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ramesh Govindan","raw_affiliation_strings":["Department of Computer Science, University of Southern California, Los Angeles, CA, USA"],"raw_orcid":"https://orcid.org/0000-0001-8311-8853","affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Southern California, Los Angeles, CA, USA","institution_ids":["https://openalex.org/I1174212"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.5703,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.67778168,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":"31","issue":"6","first_page":"2669","last_page":"2681"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9839000105857849,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9801999926567078,"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/network-topology","display_name":"Network topology","score":0.6770151853561401},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6158701181411743},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.5129094123840332},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.471798837184906},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4602431654930115},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4492564797401428},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.42321404814720154},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3686296343803406},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32924216985702515},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.28736692667007446}],"concepts":[{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.6770151853561401},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6158701181411743},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5129094123840332},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.471798837184906},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4602431654930115},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4492564797401428},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.42321404814720154},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3686296343803406},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32924216985702515},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28736692667007446},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","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.1109/tnet.2023.3264632","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tnet.2023.3264632","pdf_url":null,"source":{"id":"https://openalex.org/S62238642","display_name":"IEEE/ACM Transactions on Networking","issn_l":"1063-6692","issn":["1063-6692","1558-2566"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE/ACM Transactions on Networking","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":42,"referenced_works":["https://openalex.org/W639949082","https://openalex.org/W1501204926","https://openalex.org/W1562069137","https://openalex.org/W1971443646","https://openalex.org/W1987497363","https://openalex.org/W1988294273","https://openalex.org/W1990600049","https://openalex.org/W2038423000","https://openalex.org/W2082353536","https://openalex.org/W2087178199","https://openalex.org/W2096811399","https://openalex.org/W2105787370","https://openalex.org/W2107997203","https://openalex.org/W2125987572","https://openalex.org/W2126210439","https://openalex.org/W2130531694","https://openalex.org/W2136558412","https://openalex.org/W2143065961","https://openalex.org/W2144056042","https://openalex.org/W2144472425","https://openalex.org/W2145818650","https://openalex.org/W2147524058","https://openalex.org/W2151248167","https://openalex.org/W2155187164","https://openalex.org/W2157420744","https://openalex.org/W2159018180","https://openalex.org/W2164649945","https://openalex.org/W2169528477","https://openalex.org/W2559629050","https://openalex.org/W2953378622","https://openalex.org/W2966999544","https://openalex.org/W3095648786","https://openalex.org/W3192435828","https://openalex.org/W4234682775","https://openalex.org/W4235670058","https://openalex.org/W4237515752","https://openalex.org/W4250589301","https://openalex.org/W4283208531","https://openalex.org/W6637643684","https://openalex.org/W6682220054","https://openalex.org/W6684402220","https://openalex.org/W6759566740"],"related_works":["https://openalex.org/W2389214306","https://openalex.org/W2086397253","https://openalex.org/W2965083567","https://openalex.org/W4235240664","https://openalex.org/W1838576100","https://openalex.org/W2757182831","https://openalex.org/W2133122801","https://openalex.org/W2095886385","https://openalex.org/W3153687528","https://openalex.org/W4287212971"],"abstract_inverted_index":{"Oblivious":[0],"routing":[1,21],"distributes":[2],"traffic":[3,15],"from":[4],"sources":[5],"to":[6,67,78,115,167,196],"destinations":[7],"following":[8],"predefined":[9],"routes":[10],"with":[11,22,190,201],"rules":[12],"independent":[13],"of":[14,56,127,150],"demands.":[16,123],"While":[17],"finding":[18],"optimal":[19,58,70],"oblivious":[20],"a":[23,81,89,191,197],"concave":[24],"objective":[25],"is":[26,35],"intractable":[27],"for":[28,37,140,169,179,186],"general":[29,198],"topologies,":[30],"we":[31,48,136],"show":[32],"that":[33],"it":[34],"tractable":[36],"structured":[38,199],"topologies":[39,189],"often":[40],"used":[41],"in":[42,148],"datacenter":[43],"networks.":[44],"To":[45],"achieve":[46],"this,":[47],"apply":[49],"graph":[50],"automorphism":[51],"and":[52,88,103,131,154,173,205],"prove":[53],"the":[54,57,64,69,106,117,125,128,141,145,164],"existence":[55],"automorphism-invariant":[59,71,97],"solution.":[60,72],"This":[61],"result":[62,119],"reduces":[63],"search":[65],"space":[66],"targeting":[68],"We":[73,143],"design":[74,137],"an":[75,96],"iterative":[76,146],"algorithm":[77,147,161],"obtain":[79],"such":[80],"solution":[82,98],"by":[83],"alternating":[84],"between":[85],"convex":[86,93],"optimization":[87,94],"linear":[90,110],"program.":[91],"The":[92,109,160],"finds":[95],"based":[99],"on":[100],"representative":[101,129],"variables":[102,130],"constraints,":[104],"making":[105],"problem":[107],"tractable.":[108],"program":[111],"generates":[112],"adversarial":[113],"demands":[114],"ensure":[116],"final":[118],"satisfies":[120],"all":[121],"possible":[122],"Since":[124],"construction":[126],"constraints":[132],"are":[133],"combinatorial":[134],"problems,":[135],"polynomial-time":[138],"algorithms":[139],"construction.":[142],"evaluate":[144],"terms":[149],"throughput":[151,165],"performance,":[152],"scalability,":[153],"generality":[155],"over":[156,181],"three":[157,187],"potential":[158],"applications.":[159],"i)":[162],"improves":[163],"up":[166,175],"87.5%":[168],"partially":[170],"deployed":[171],"FatTree":[172],"achieves":[174],"to$2.55\\times":[176],"$throughput":[177],"gain":[178],"DRing":[180],"heuristic":[182],"algorithms,":[183],"ii)":[184],"scales":[185],"considered":[188],"thousand":[192],"switches,":[193],"iii)":[194],"applies":[195],"topology":[200],"non-uniform":[202],"link":[203],"capacity":[204],"server":[206],"distribution.":[207]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3}],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}