{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T17:53:32Z","timestamp":1775066012764,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":47,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,8,22]],"date-time":"2022-08-22T00:00:00Z","timestamp":1661126400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Sloan fellowship"},{"name":"NSF","award":["1704742,2047283"],"award-info":[{"award-number":["1704742,2047283"]}]},{"name":"Google faculty research award"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,8,22]]},"DOI":"10.1145\/3544216.3544235","type":"proceedings-article","created":{"date-parts":[[2022,8,11]],"date-time":"2022-08-11T22:58:16Z","timestamp":1660258696000},"page":"53-65","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":28,"title":["dcPIM"],"prefix":"10.1145","author":[{"given":"Qizhe","family":"Cai","sequence":"first","affiliation":[{"name":"Cornell University"}]},{"given":"Mina Tahmasbi","family":"Arashloo","sequence":"additional","affiliation":[{"name":"University of Waterloo"}]},{"given":"Rachit","family":"Agarwal","sequence":"additional","affiliation":[{"name":"Cornell University"}]}],"member":"320","published-online":{"date-parts":[[2022,8,22]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"crossref","unstructured":"Rachit Agarwal Shijin Rajakrishnan and David Shmoys. 2022. From Switch Scheduling to Datacenter Scheduling: Matching-Coordinated Greed Is Good. In ACMPODC.  Rachit Agarwal Shijin Rajakrishnan and David Shmoys. 2022. From Switch Scheduling to Datacenter Scheduling: Matching-Coordinated Greed Is Good. In ACMPODC .","DOI":"10.1145\/3519270.3538443"},{"key":"e_1_3_2_2_2_1","unstructured":"Saksham Agarwal Shijin Rajakrishnan Akshay Narayan Rachit Agarwal David Shmoys and Amin Vahdat. 2018. Sincronia: near-optimal network design for coflows. In ACM SIGCOMM.  Saksham Agarwal Shijin Rajakrishnan Akshay Narayan Rachit Agarwal David Shmoys and Amin Vahdat. 2018. Sincronia: near-optimal network design for coflows. In ACM SIGCOMM ."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"crossref","unstructured":"Mohammad Al-Fares Alexander Loukissas and Amin Vahdat. 2008. A scalable commodity data center network architecture. In ACM SIGCOMM.  Mohammad Al-Fares Alexander Loukissas and Amin Vahdat. 2008. A scalable commodity data center network architecture. In ACM SIGCOMM .","DOI":"10.1145\/1402958.1402967"},{"key":"e_1_3_2_2_4_1","volume-title":"Francis Matus, Rong Pan, Navindra Yadav, et al.","author":"Alizadeh Mohammad","year":"2014","unstructured":"Mohammad Alizadeh , Tom Edsall , Sarang Dharmapurikar , Ramanan Vaidyanathan , Kevin Chu , Andy Fingerhut , Vinh The Lam , Francis Matus, Rong Pan, Navindra Yadav, et al. 2014 . CONGA : Distributed congestion-aware load balancing for datacenters. In ACM SIGCOMM. Mohammad Alizadeh, Tom Edsall, Sarang Dharmapurikar, Ramanan Vaidyanathan, Kevin Chu, Andy Fingerhut, Vinh The Lam, Francis Matus, Rong Pan, Navindra Yadav, et al. 2014. CONGA: Distributed congestion-aware load balancing for datacenters. In ACM SIGCOMM."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"crossref","unstructured":"Mohammad Alizadeh Albert Greenberg David A. Maltz Jitendra Padhye Parveen Patel Balaji Prabhakar Sudipta Sengupta and Murari Sridharan. 2010. Data Center TCP (DCTCP). In ACM SIGCOMM.  Mohammad Alizadeh Albert Greenberg David A. Maltz Jitendra Padhye Parveen Patel Balaji Prabhakar Sudipta Sengupta and Murari Sridharan. 2010. Data Center TCP (DCTCP). In ACM SIGCOMM .","DOI":"10.1145\/1851182.1851192"},{"key":"e_1_3_2_2_6_1","unstructured":"Mohammad Alizadeh Abdul Kabbani Tom Edsall Balaji Prabhakar Amin Vahdat and Masato Yasuda. 2012. Less is More: Trading a Little Bandwidth for Ultra-low Latency in the Data Center. In USENIX NSDI.  Mohammad Alizadeh Abdul Kabbani Tom Edsall Balaji Prabhakar Amin Vahdat and Masato Yasuda. 2012. Less is More: Trading a Little Bandwidth for Ultra-low Latency in the Data Center. In USENIX NSDI ."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"crossref","unstructured":"Mohammad Alizadeh Shuang Yang Milad Sharif Sachin Katti Nick McKeown Balaji Prabhakar and Scott Shenker. 2013. pFabric: Minimal Near-optimal Data-center Transport. In ACM SIGCOMM.  Mohammad Alizadeh Shuang Yang Milad Sharif Sachin Katti Nick McKeown Balaji Prabhakar and Scott Shenker. 2013. pFabric: Minimal Near-optimal Data-center Transport. In ACM SIGCOMM .","DOI":"10.1145\/2486001.2486031"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"crossref","unstructured":"Thomas E Anderson Susan S Owicki James B Saxe and Charles P Thacker. 1993. High-speed switch scheduling for local-area networks. In ACM TOCS.  Thomas E Anderson Susan S Owicki James B Saxe and Charles P Thacker. 1993. High-speed switch scheduling for local-area networks. In ACM TOCS .","DOI":"10.1145\/143365.143495"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"crossref","unstructured":"Theophilus Benson Aditya Akella and David A Maltz. 2010. Network traffic characteristics of data centers in the wild. In ACMIMC.  Theophilus Benson Aditya Akella and David A Maltz. 2010. Network traffic characteristics of data centers in the wild. In ACMIMC .","DOI":"10.1145\/1879141.1879175"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"crossref","unstructured":"Qizhe Cai Shubham Chaudhary Midhul Vuppalapati Jaehyun Hwang and Rachit Agarwal. 2021. Understanding Host Network Stack Overheads. In ACM SIGCOMM.  Qizhe Cai Shubham Chaudhary Midhul Vuppalapati Jaehyun Hwang and Rachit Agarwal. 2021. Understanding Host Network Stack Overheads. In ACM SIGCOMM .","DOI":"10.1145\/3452296.3472888"},{"key":"e_1_3_2_2_11_1","unstructured":"Peng Cheng Fengyuan Ren Ran Shu and Chuang Lin. 2014. Catch the Whole Lot in an Action: Rapid Precise Packet Loss Notification in Data Center. In USENIX NSDI.  Peng Cheng Fengyuan Ren Ran Shu and Chuang Lin. 2014. Catch the Whole Lot in an Action: Rapid Precise Packet Loss Notification in Data Center. In USENIX NSDI ."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"crossref","unstructured":"Inho Cho Keon Jang and Dongsu Han. 2017. Credit-scheduled delay-bounded congestion control for datacenters. In ACM SIGCOMM.  Inho Cho Keon Jang and Dongsu Han. 2017. Credit-scheduled delay-bounded congestion control for datacenters. In ACM SIGCOMM .","DOI":"10.1145\/3098822.3098840"},{"key":"e_1_3_2_2_13_1","volume-title":"Synchronizing the Linux system time to a PTP hardware clock","author":"Cochran Richard","unstructured":"Richard Cochran , Cristian Marinescu , and Christian Riesch . 2011. Synchronizing the Linux system time to a PTP hardware clock . In IEEE ISPCS. Richard Cochran, Cristian Marinescu, and Christian Riesch. 2011. Synchronizing the Linux system time to a PTP hardware clock. In IEEE ISPCS."},{"key":"e_1_3_2_2_14_1","volume-title":"Yu Charlie Hu, and Ramana Rao Kompella","author":"Dixit Abhishek","year":"2013","unstructured":"Abhishek Dixit , Pawan Prakash , Yu Charlie Hu, and Ramana Rao Kompella . 2013 . On The Impact Of Packet Spraying In Data Center Networks . In IEEE INFOCOM. Abhishek Dixit, Pawan Prakash, Yu Charlie Hu, and Ramana Rao Kompella. 2013. On The Impact Of Packet Spraying In Data Center Networks. In IEEE INFOCOM."},{"key":"e_1_3_2_2_15_1","unstructured":"DPDK. 2022. Data Plane Development Kit. http:\/\/dpdk.org\/. (2022).  DPDK. 2022. Data Plane Development Kit. http:\/\/dpdk.org\/. (2022)."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/HOTI.2009.11"},{"key":"e_1_3_2_2_17_1","unstructured":"Daniel Firestone Andrew Putnam Sambhrama Mundkur Derek Chiou Alireza Dabagh Mike Andrewartha Hari Angepat Vivek Bhanu Adrian Caulfield Eric Chung etal 2018. Azure accelerated networking: Smartnics in the public cloud. In USENIX NSDI.  Daniel Firestone Andrew Putnam Sambhrama Mundkur Derek Chiou Alireza Dabagh Mike Andrewartha Hari Angepat Vivek Bhanu Adrian Caulfield Eric Chung et al. 2018. Azure accelerated networking: Smartnics in the public cloud. In USENIX NSDI ."},{"key":"e_1_3_2_2_18_1","unstructured":"Peter X Gao Akshay Narayan Gautam Kumar Rachit Agarwal Sylvia Ratnasamy and Scott Shenker. 2015. phost: Distributed near-optimal datacenter transport over commodity network fabric. In ACM CoNEXT.  Peter X Gao Akshay Narayan Gautam Kumar Rachit Agarwal Sylvia Ratnasamy and Scott Shenker. 2015. phost: Distributed near-optimal datacenter transport over commodity network fabric. In ACM CoNEXT ."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2934872.2934911"},{"key":"e_1_3_2_2_20_1","unstructured":"Albert Greenberg James R Hamilton Navendu Jain Srikanth Kandula Changhoon Kim Parantap Lahiri David A Maltz Parveen Patel and Sudipta Sengupta. 2009. VL2: a scalable and flexible data center network. In ACM SIGCOMM.  Albert Greenberg James R Hamilton Navendu Jain Srikanth Kandula Changhoon Kim Parantap Lahiri David A Maltz Parveen Patel and Sudipta Sengupta. 2009. VL2: a scalable and flexible data center network. In ACM SIGCOMM ."},{"key":"e_1_3_2_2_21_1","volume-title":"Andrew W Moore, Steven Hand, and Jon Crowcroft.","author":"Grosvenor Matthew P","year":"2015","unstructured":"Matthew P Grosvenor , Malte Schwarzkopf , Ionel Gog , Robert NM Watson , Andrew W Moore, Steven Hand, and Jon Crowcroft. 2015 . Queues don't matter when you can jump them!. In USENIX NSDI. Matthew P Grosvenor, Malte Schwarzkopf, Ionel Gog, Robert NM Watson, Andrew W Moore, Steven Hand, and Jon Crowcroft. 2015. Queues don't matter when you can jump them!. In USENIX NSDI."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"crossref","unstructured":"Mark Handley Costin Raiciu Alexandru Agache Andrei Voinescu Andrew Moore Gianni Antichi and Marcin Wojcik. 2017. Re-architecting datacenter networks and stacks for low latency and high performance. In ACM SIGCOMM.  Mark Handley Costin Raiciu Alexandru Agache Andrei Voinescu Andrew Moore Gianni Antichi and Marcin Wojcik. 2017. Re-architecting datacenter networks and stacks for low latency and high performance. In ACM SIGCOMM .","DOI":"10.1145\/3098822.3098825"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"crossref","unstructured":"Chi-Yao Hong Matthew Caesar and P Godfrey. 2012. Finishing flows quickly with preemptive scheduling. In ACM SIGCOMM.  Chi-Yao Hong Matthew Caesar and P Godfrey. 2012. Finishing flows quickly with preemptive scheduling. In ACM SIGCOMM .","DOI":"10.1145\/2342356.2342389"},{"key":"e_1_3_2_2_24_1","volume-title":"Aeolus: A Building Block for Proactive Transport in Datacenters. In ACM SIGCOMM.","author":"Hu Shuihai","year":"2020","unstructured":"Shuihai Hu , Wei Bai , Gaoxiong Zeng , Zilong Wang , Baochen Qiao , Kai Chen , Kun Tan , and Yi Wang . 2020 . Aeolus: A Building Block for Proactive Transport in Datacenters. In ACM SIGCOMM. Shuihai Hu, Wei Bai, Gaoxiong Zeng, Zilong Wang, Baochen Qiao, Kai Chen, Kun Tan, and Yi Wang. 2020. Aeolus: A Building Block for Proactive Transport in Datacenters. In ACM SIGCOMM."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"crossref","unstructured":"Amos Israeli and Alon Itai. 1986. A fast and simple randomized parallela lgorithm for maximal matching. In Information Processing Letters.  Amos Israeli and Alon Itai. 1986. A fast and simple randomized parallela lgorithm for maximal matching. In Information Processing Letters .","DOI":"10.1016\/0020-0190(86)90144-4"},{"key":"e_1_3_2_2_26_1","volume-title":"A high-throughput scheduling algorithm for a buffered crossbar switch fabric","author":"Javidi Tara","unstructured":"Tara Javidi , Robert Magill , and Terry Hrabik . 2001. A high-throughput scheduling algorithm for a buffered crossbar switch fabric . In IEEE ICC. Tara Javidi, Robert Magill, and Terry Hrabik. 2001. A high-throughput scheduling algorithm for a buffered crossbar switch fabric. In IEEE ICC."},{"key":"e_1_3_2_2_27_1","unstructured":"Richard M Karp Umesh V Vazirani and Vijay V Vazirani. 1990. An optimal algorithm for on-line bipartite matching. In ACM STOC.  Richard M Karp Umesh V Vazirani and Vijay V Vazirani. 1990. An optimal algorithm for on-line bipartite matching. In ACM STOC ."},{"key":"e_1_3_2_2_28_1","volume-title":"Yan Zhuang, Fei Feng, Lingbo Tang, Zheng Cao, Ming Zhang, Frank Kelly, Mohammad Alizadeh, and Minlan Yu.","author":"Li Yuliang","year":"2019","unstructured":"Yuliang Li , Rui Miao , Hongqiang Harry Liu , Yan Zhuang, Fei Feng, Lingbo Tang, Zheng Cao, Ming Zhang, Frank Kelly, Mohammad Alizadeh, and Minlan Yu. 2019 . HPCC : High Precision Congestion Control. In ACM SIGCOMM. Yuliang Li, Rui Miao, Hongqiang Harry Liu, Yan Zhuang, Fei Feng, Lingbo Tang, Zheng Cao, Ming Zhang, Frank Kelly, Mohammad Alizadeh, and Minlan Yu. 2019. HPCC: High Precision Congestion Control. In ACM SIGCOMM."},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"crossref","unstructured":"Zvi Lotker Boaz Patt-Shamir and Seth Pettie. 2015. Improved distributed approximate matching. In ACM JACM.  Zvi Lotker Boaz Patt-Shamir and Seth Pettie. 2015. Improved distributed approximate matching. In ACM JACM .","DOI":"10.1145\/2786753"},{"key":"e_1_3_2_2_30_1","volume-title":"Multicast traffic in input-queued switches: optimal scheduling and maximum throughput","author":"Marsan M Ajmone","unstructured":"M Ajmone Marsan , Andrea Bianco , Paolo Giaccone , Emilio Leonardi , and Fabio Neri . 2003. Multicast traffic in input-queued switches: optimal scheduling and maximum throughput . In IEEE\/ACM ToN. M Ajmone Marsan, Andrea Bianco, Paolo Giaccone, Emilio Leonardi, and Fabio Neri. 2003. Multicast traffic in input-queued switches: optimal scheduling and maximum throughput. In IEEE\/ACM ToN."},{"key":"e_1_3_2_2_31_1","volume-title":"The iSLIP Scheduling Algorithm for Input-queued Switches","author":"McKeown Nick","unstructured":"Nick McKeown . 1999. The iSLIP Scheduling Algorithm for Input-queued Switches . In IEEE\/ACM ToN. Nick McKeown. 1999. The iSLIP Scheduling Algorithm for Input-queued Switches. In IEEE\/ACM ToN."},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"crossref","unstructured":"Nick McKeown Adisak Mekkittikul Venkat Anantharam and Jean Walrand. 1999. Achieving 100% throughput in an input-queued switch. In IEEE Transactions on Communications.  Nick McKeown Adisak Mekkittikul Venkat Anantharam and Jean Walrand. 1999. Achieving 100% throughput in an input-queued switch. In IEEE Transactions on Communications .","DOI":"10.1109\/26.780463"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"crossref","unstructured":"Nick McKeown Pravin Varaiya and Jean Walrand. 1993. Scheduling cells in an input-queued switch. In Electronics Letters.  Nick McKeown Pravin Varaiya and Jean Walrand. 1993. Scheduling cells in an input-queued switch. In Electronics Letters .","DOI":"10.1049\/el:19931459"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3230543.3230564"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"crossref","unstructured":"Ali Munir Ghufran Baig Syed M Irteza Ihsan A Qazi Alex X Liu and Fahad R Dogar. 2014. Friends not foes: synthesizing existing transport strategies for data center networks. In ACM SIGCOMM.  Ali Munir Ghufran Baig Syed M Irteza Ihsan A Qazi Alex X Liu and Fahad R Dogar. 2014. Friends not foes: synthesizing existing transport strategies for data center networks. In ACM SIGCOMM .","DOI":"10.1145\/2619239.2626305"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2740070.2626309"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"crossref","unstructured":"Arjun Roy Hongyi Zeng Jasmeet Bagga George Porter and Alex C Snoeren. 2015. Inside the social network's (datacenter) network. In ACM SIGCOMM.  Arjun Roy Hongyi Zeng Jasmeet Bagga George Porter and Alex C Snoeren. 2015. Inside the social network's (datacenter) network. In ACM SIGCOMM .","DOI":"10.1145\/2785956.2787472"},{"key":"e_1_3_2_2_38_1","volume-title":"Amin Vahdat, et al.","author":"Saeed Ahmed","year":"2017","unstructured":"Ahmed Saeed , Nandita Dukkipati , Vytautas Valancius , Carlo Contavalli , Amin Vahdat, et al. 2017 . Carousel : Scalable Traffic Shaping at End Hosts. In ACM SIGCOMM. Ahmed Saeed, Nandita Dukkipati, Vytautas Valancius, Carlo Contavalli, Amin Vahdat, et al. 2017. Carousel: Scalable Traffic Shaping at End Hosts. In ACM SIGCOMM."},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/3387514.3405899"},{"key":"e_1_3_2_2_40_1","volume-title":"Efficient randomized algorithms for input-queued switch scheduling","author":"Shah Devavrat","unstructured":"Devavrat Shah , Paolo Giaccone , and Balaji Prabhakar . 2002. Efficient randomized algorithms for input-queued switch scheduling . In IEEE Micro . Devavrat Shah, Paolo Giaccone, and Balaji Prabhakar. 2002. Efficient randomized algorithms for input-queued switch scheduling. In IEEE Micro."},{"key":"e_1_3_2_2_41_1","volume-title":"Optimal scheduling algorithms for input-queued switches","author":"Shah Devavrat","unstructured":"Devavrat Shah and Damon Wischik . 2006. Optimal scheduling algorithms for input-queued switches . In IEEE INFOCOM. Devavrat Shah and Damon Wischik. 2006. Optimal scheduling algorithms for input-queued switches. In IEEE INFOCOM."},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"crossref","unstructured":"Arjun Singh Joon Ong Amit Agarwal Glen Anderson Ashby Armistead Roy Bannon Seb Boving Gaurav Desai Bob Felderman Paulie Germano etal 2015. Jupiter rising: A decade of clos topologies and centralized control in google's datacenter network. In ACM SIGCOMM.  Arjun Singh Joon Ong Amit Agarwal Glen Anderson Ashby Armistead Roy Bannon Seb Boving Gaurav Desai Bob Felderman Paulie Germano et al. 2015. Jupiter rising: A decade of clos topologies and centralized control in google's datacenter network. In ACM SIGCOMM .","DOI":"10.1145\/2785956.2787508"},{"key":"e_1_3_2_2_43_1","volume-title":"Data structures and network algorithms","author":"Tarjan Robert Endre","unstructured":"Robert Endre Tarjan . 1983. Data structures and network algorithms . Vol. 44 . Siam . Robert Endre Tarjan. 1983. Data structures and network algorithms. Vol. 44. Siam."},{"key":"e_1_3_2_2_44_1","unstructured":"George Varghese. 2005. Network Algorithmics: an interdisciplinary approach to designing fast networked devices. Morgan Kaufmann.  George Varghese. 2005. Network Algorithmics: an interdisciplinary approach to designing fast networked devices . Morgan Kaufmann."},{"key":"e_1_3_2_2_45_1","volume-title":"Ganesh Ananthanarayanan, Rachit Agarwal, Randy Katz, Ion Stoica, and Amin Vahdat.","author":"Zats David","year":"2015","unstructured":"David Zats , Anand Padmanabha Iyer , Ganesh Ananthanarayanan, Rachit Agarwal, Randy Katz, Ion Stoica, and Amin Vahdat. 2015 . FastLane: Making Short Flows Shorter with Agile Drop Notification. In ACM SoCC. David Zats, Anand Padmanabha Iyer, Ganesh Ananthanarayanan, Rachit Agarwal, Randy Katz, Ion Stoica, and Amin Vahdat. 2015. FastLane: Making Short Flows Shorter with Agile Drop Notification. In ACM SoCC."},{"key":"e_1_3_2_2_46_1","volume-title":"Mohamad Haj Yahia, and Ming Zhang","author":"Zhu Yibo","year":"2015","unstructured":"Yibo Zhu , Haggai Eran , Daniel Firestone , Chuanxiong Guo , Marina Lipshteyn , Yehonatan Liron , Jitendra Padhye , Shachar Raindel , Mohamad Haj Yahia, and Ming Zhang . 2015 . Congestion control for large-scale RDMA deployments. In ACM SIGCOMM. Yibo Zhu, Haggai Eran, Daniel Firestone, Chuanxiong Guo, Marina Lipshteyn, Yehonatan Liron, Jitendra Padhye, Shachar Raindel, Mohamad Haj Yahia, and Ming Zhang. 2015. Congestion control for large-scale RDMA deployments. In ACM SIGCOMM."},{"key":"e_1_3_2_2_47_1","volume-title":"Stardust: Divide and Conquer in the Data Center Network. In USENIX NSDI.","author":"Zilberman Noa","year":"2019","unstructured":"Noa Zilberman , Gabi Bracha , and Golan Schzukin . 2019 . Stardust: Divide and Conquer in the Data Center Network. In USENIX NSDI. Noa Zilberman, Gabi Bracha, and Golan Schzukin. 2019. Stardust: Divide and Conquer in the Data Center Network. In USENIX NSDI."}],"event":{"name":"SIGCOMM '22: ACM SIGCOMM 2022 Conference","location":"Amsterdam Netherlands","acronym":"SIGCOMM '22","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication"]},"container-title":["Proceedings of the ACM SIGCOMM 2022 Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3544216.3544235","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3544216.3544235","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3544216.3544235","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:31:11Z","timestamp":1750188671000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3544216.3544235"}},"subtitle":["near-optimal proactive datacenter transport"],"short-title":[],"issued":{"date-parts":[[2022,8,22]]},"references-count":47,"alternative-id":["10.1145\/3544216.3544235","10.1145\/3544216"],"URL":"https:\/\/doi.org\/10.1145\/3544216.3544235","relation":{},"subject":[],"published":{"date-parts":[[2022,8,22]]},"assertion":[{"value":"2022-08-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}