{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T20:39:04Z","timestamp":1767991144473,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,8,9]],"date-time":"2021-08-09T00:00:00Z","timestamp":1628467200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,8,9]]},"DOI":"10.1145\/3452296.3472898","type":"proceedings-article","created":{"date-parts":[[2021,8,9]],"date-time":"2021-08-09T18:13:15Z","timestamp":1628532795000},"page":"319-348","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["Designing data center networks using bottleneck structures"],"prefix":"10.1145","author":[{"given":"Jordi","family":"Ros-Giralt","sequence":"first","affiliation":[{"name":"Reservoir Labs"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Noah","family":"Amsel","sequence":"additional","affiliation":[{"name":"Reservoir Labs"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sruthi","family":"Yellamraju","sequence":"additional","affiliation":[{"name":"Reservoir Labs"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James","family":"Ezick","sequence":"additional","affiliation":[{"name":"Reservoir Labs"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Richard","family":"Lethin","sequence":"additional","affiliation":[{"name":"Reservoir Labs"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuang","family":"Jiang","sequence":"additional","affiliation":[{"name":"Yale University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aosong","family":"Feng","sequence":"additional","affiliation":[{"name":"Yale University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leandros","family":"Tassiulas","sequence":"additional","affiliation":[{"name":"Yale University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhenguo","family":"Wu","sequence":"additional","affiliation":[{"name":"Columbia University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Min Yee","family":"Teh","sequence":"additional","affiliation":[{"name":"Columbia University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Keren","family":"Bergman","sequence":"additional","affiliation":[{"name":"Columbia University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,8,9]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1402958.1402967"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2619239.2626316"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2018436.2018465"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1879141.1879175"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1672308.1672325"},{"key":"e_1_3_2_2_6_1","volume-title":"Gallager","author":"Bertsekas Dimitri P.","year":"1992","unstructured":"Dimitri P. Bertsekas and Robert G . Gallager . 1992 . Data Networks. Vol. 2 . Prentice-Hall Inc ., Englewood Cliffs, New Jersey 07632. Dimitri P. Bertsekas and Robert G. Gallager. 1992. Data Networks. Vol. 2. Prentice-Hall Inc., Englewood Cliffs, New Jersey 07632."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3012426.3022184"},{"key":"e_1_3_2_2_8_1","volume-title":"Analysis of the increase and decrease algorithms for congestion avoidance in computer networks. Computer Networks and ISDN systems 17, 1","author":"Chiu Dah-Ming","year":"1989","unstructured":"Dah-Ming Chiu and Raj Jain . 1989. Analysis of the increase and decrease algorithms for congestion avoidance in computer networks. Computer Networks and ISDN systems 17, 1 ( 1989 ), 1--14. Dah-Ming Chiu and Raj Jain. 1989. Analysis of the increase and decrease algorithms for congestion avoidance in computer networks. Computer Networks and ISDN systems 17, 1 (1989), 1--14."},{"key":"e_1_3_2_2_9_1","volume-title":"Introduction to Algorithms","author":"Cormen Thomas H.","unstructured":"Thomas H. Cormen , Charles E. Leiserson , Ronald L. Rivest , and Clifford Stein . 2009. Introduction to Algorithms , Third Edition (3 rd ed.). The MIT Press , Cambridge, Massachusetts . Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. 2009. Introduction to Algorithms, Third Edition (3rd ed.). The MIT Press, Cambridge, Massachusetts.","edition":"3"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1177\/0037549709340840"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1111322.1111336"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/SURV.2013.013013.00155"},{"key":"e_1_3_2_2_13_1","volume-title":"Retrieved","year":"2019","unstructured":"Iperf.fr. 2019 . iPerf - The ultimate speed test tool for TCP, UDP and SCTP. (2019) . Retrieved October 24, 2019 from https:\/\/iperf.fr\/ Iperf.fr. 2019. iPerf - The ultimate speed test tool for TCP, UDP and SCTP. (2019). Retrieved October 24, 2019 from https:\/\/iperf.fr\/"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/52325.52356"},{"key":"e_1_3_2_2_15_1","volume-title":"Hawe","author":"Jain Raj","year":"1998","unstructured":"Raj Jain , Dah-Ming W. Chiu , and William R . Hawe . 1998 . A Quantitative Measure Of Fairness And Discrimination For Resource Allocation In Shared Computer Systems. CoRR cs.NI\/9809099 (1998), 38. http: \/\/arxiv.org\/abs\/cs.NI\/9809099 Raj Jain, Dah-Ming W. Chiu, and William R. Hawe. 1998. A Quantitative Measure Of Fairness And Discrimination For Resource Allocation In Shared Computer Systems. CoRR cs.NI\/9809099 (1998), 38. http: \/\/arxiv.org\/abs\/cs.NI\/9809099"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2016.64"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1644893.1644918"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.2008.19"},{"key":"e_1_3_2_2_19_1","volume-title":"Retrieved","author":"Labs Reservoir","year":"2021","unstructured":"Reservoir Labs . 2021 . G2-Mininet: Mininet extensions to support the analysis of the bottleneck structure of networks. https:\/\/github.com\/reservoirlabs\/g2-mininet. (2021) . Retrieved June 11, 2021 from https:\/\/github.com\/reservoirlabs\/g2-mininet Reservoir Labs. 2021. G2-Mininet: Mininet extensions to support the analysis of the bottleneck structure of networks. https:\/\/github.com\/reservoirlabs\/g2-mininet. (2021). Retrieved June 11, 2021 from https:\/\/github.com\/reservoirlabs\/g2-mininet"},{"key":"e_1_3_2_2_20_1","volume-title":"Fat-trees: universal networks for hardwareefficient supercomputing","author":"Leiserson Charles E","year":"1985","unstructured":"Charles E Leiserson . 1985. Fat-trees: universal networks for hardwareefficient supercomputing . IEEE transactions on Computers 100, 10 ( 1985 ), 892--901. Charles E Leiserson. 1985. Fat-trees: universal networks for hardwareefficient supercomputing. IEEE transactions on Computers 100, 10 (1985), 892--901."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3295500.3356145"},{"key":"e_1_3_2_2_22_1","volume-title":"Retrieved","year":"2019","unstructured":"Mininet. 2019 . Mininet: An Instant Virtual Network on your Laptop (or other PC). (2019) . Retrieved October 24, 2019 from http:\/\/mininet.org\/ Mininet. 2019. Mininet: An Instant Virtual Network on your Laptop (or other PC). (2019). Retrieved October 24, 2019 from http:\/\/mininet.org\/"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2013.6567018"},{"key":"e_1_3_2_2_24_1","volume-title":"sFlow Specifications","author":"Phaal Peter","year":"2001","unstructured":"Peter Phaal , Sonia Panchen , and Neil McKee . 2001. sFlow Specifications , InMon Corporation . IETF RFC 3176 ( 2001 ). Peter Phaal, Sonia Panchen, and Neil McKee. 2001. sFlow Specifications, InMon Corporation. IETF RFC 3176 (2001)."},{"key":"e_1_3_2_2_25_1","unstructured":"NOX Repo POX. 2019. The POX Network Software Platform. (2019). =https:\/\/noxrepo.github.io\/pox-doc\/html\/ Last accessed 09\/24\/2019.  NOX Repo POX. 2019. The POX Network Software Platform. (2019). =https:\/\/noxrepo.github.io\/pox-doc\/html\/ Last accessed 09\/24\/2019."},{"key":"e_1_3_2_2_26_1","volume-title":"Min Yeh Teh, and Keren Bergman","author":"Ros-Giralt Jordi","year":"2021","unstructured":"Jordi Ros-Giralt , Noah Amsel , Sruthi Yellamraju , James Ezick , Richard Lethin , Yuang Jiang , Aosong Feng , Leandros Tassiulas , Zhenguo Wu , Min Yeh Teh, and Keren Bergman . 2021 . A Quantitative Theory of Bottleneck Structures for Data Networks. IEEE Transactions on Networking ( under review) (2021). Jordi Ros-Giralt, Noah Amsel, Sruthi Yellamraju, James Ezick, Richard Lethin, Yuang Jiang, Aosong Feng, Leandros Tassiulas, Zhenguo Wu, Min Yeh Teh, and Keren Bergman. 2021. A Quantitative Theory of Bottleneck Structures for Data Networks. IEEE Transactions on Networking (under review) (2021)."},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3366707"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2785956.2787472"},{"key":"e_1_3_2_2_29_1","volume-title":"An In-Depth Analysis of the Slingshot Interconnect. In 2020 SC20: International Conference for High Performance Computing, Networking, Storage and Analysis (SC). IEEE Computer Society, 481--494","author":"Sensi Daniele","year":"2020","unstructured":"Daniele Sensi , Salvatore Girolamo , Kim McMahon , Duncan Roweth , and Torsten Hoefler . 2020 . An In-Depth Analysis of the Slingshot Interconnect. In 2020 SC20: International Conference for High Performance Computing, Networking, Storage and Analysis (SC). IEEE Computer Society, 481--494 . Daniele Sensi, Salvatore Girolamo, Kim McMahon, Duncan Roweth, and Torsten Hoefler. 2020. An In-Depth Analysis of the Slingshot Interconnect. In 2020 SC20: International Conference for High Performance Computing, Networking, Storage and Analysis (SC). IEEE Computer Society, 481--494."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2785956.2787508"},{"key":"e_1_3_2_2_31_1","volume-title":"11th {USENIX} Symposium on Networked Systems Design and Implementation ({NSDI} 14). 29--41.","author":"Singla Ankit","unstructured":"Ankit Singla , P Brighten Godfrey , and Alexandra Kolla . 2014. High throughput data center topology design . In 11th {USENIX} Symposium on Networked Systems Design and Implementation ({NSDI} 14). 29--41. Ankit Singla, P Brighten Godfrey, and Alexandra Kolla. 2014. High throughput data center topology design. In 11th {USENIX} Symposium on Networked Systems Design and Implementation ({NSDI} 14). 29--41."},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2342356.2342390"}],"event":{"name":"SIGCOMM '21: ACM SIGCOMM 2021 Conference","location":"Virtual Event USA","acronym":"SIGCOMM '21","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication"]},"container-title":["Proceedings of the 2021 ACM SIGCOMM 2021 Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3452296.3472898","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3452296.3472898","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:01:13Z","timestamp":1750197673000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3452296.3472898"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,9]]},"references-count":32,"alternative-id":["10.1145\/3452296.3472898","10.1145\/3452296"],"URL":"https:\/\/doi.org\/10.1145\/3452296.3472898","relation":{},"subject":[],"published":{"date-parts":[[2021,8,9]]},"assertion":[{"value":"2021-08-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}