{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T19:18:03Z","timestamp":1768072683695,"version":"3.49.0"},"reference-count":28,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,5,2]],"date-time":"2022-05-02T00:00:00Z","timestamp":1651449600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,5,2]],"date-time":"2022-05-02T00:00:00Z","timestamp":1651449600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,5,2]]},"DOI":"10.1109\/infocom48880.2022.9796682","type":"proceedings-article","created":{"date-parts":[[2022,6,20]],"date-time":"2022-06-20T21:18:49Z","timestamp":1655759929000},"page":"1988-1997","source":"Crossref","is-referenced-by-count":6,"title":["Optimal Oblivious Routing for Structured Networks"],"prefix":"10.1109","author":[{"given":"Sucha","family":"Supittayapornpong","sequence":"first","affiliation":[{"name":"Vidyasirimedhi Institute of Science and Technology,Thailand"}]},{"given":"Pooria","family":"Namyar","sequence":"additional","affiliation":[{"name":"University of Southern California,United States"}]},{"given":"Mingyang","family":"Zhang","sequence":"additional","affiliation":[{"name":"University of Southern California,United States"}]},{"given":"Minlan","family":"Yu","sequence":"additional","affiliation":[{"name":"Harvard University,United States"}]},{"given":"Ramesh","family":"Govindan","sequence":"additional","affiliation":[{"name":"University of Southern California,United States"}]}],"member":"263","reference":[{"key":"ref10","first-page":"29","article-title":"High throughput data center topology design","author":"singla","year":"0"},{"key":"ref11","first-page":"235","article-title":"Understanding lifecycle management complexity of datacenter topologies","author":"zhang","year":"0"},{"key":"ref12","first-page":"67","article-title":"Spineless data centers","author":"harsh","year":"0"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.17487\/rfc2991"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2008.206"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2007.070607"},{"key":"ref16","first-page":"19","article-title":"Hedera: Dynamic flow scheduling for data center networks","author":"al-fares","year":"2010","journal-title":"Proceedings of the 7th USENIX Conference on Networked Systems Design and Implementation"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/2785956.2787472"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1402958.1402968"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/1592568.1592577"},{"key":"ref28","article-title":"Wcmp: Weighted cost multipathing for improved fairness in data centers","author":"zhou","year":"0"},{"key":"ref4","author":"andreyev","year":"0","journal-title":"Introducing data center fabric the next-generation facebook data center network"},{"key":"ref27","article-title":"Gurobi Optimizer Reference Manual","year":"2021"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2829988.2787508"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.2008.19"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1654059.1654101"},{"key":"ref8","first-page":"225","article-title":"Jellyfish: Networking data centers randomly","author":"singla","year":"0"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2014.34"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1594977.1592576"},{"key":"ref9","first-page":"205","article-title":"Xpander: Towards optimal-performance datacenters","author":"valadarsky","year":"0"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1402958.1402967"},{"key":"ref20","year":"0","journal-title":"Tomahawk4 \/ BCM56990 Series"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/3341302.3342086"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3452296.3472913"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/L-CA.2002.12"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/863955.863991"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2013.09.003"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2016.64"}],"event":{"name":"IEEE INFOCOM 2022 - IEEE Conference on Computer Communications","location":"London, United Kingdom","start":{"date-parts":[[2022,5,2]]},"end":{"date-parts":[[2022,5,5]]}},"container-title":["IEEE INFOCOM 2022 - IEEE Conference on Computer Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9796607\/9796652\/09796682.pdf?arnumber=9796682","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,11]],"date-time":"2022-07-11T20:01:10Z","timestamp":1657569670000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9796682\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,2]]},"references-count":28,"URL":"https:\/\/doi.org\/10.1109\/infocom48880.2022.9796682","relation":{},"subject":[],"published":{"date-parts":[[2022,5,2]]}}}