{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T14:20:29Z","timestamp":1761402029779,"version":"3.41.0"},"reference-count":26,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2019,11,8]],"date-time":"2019-11-08T00:00:00Z","timestamp":1573171200000},"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":["SIGCOMM Comput. Commun. Rev."],"published-print":{"date-parts":[[2019,11,8]]},"abstract":"<jats:p>\n            Recent years have seen a slew of papers on datacenter congestion control mechanisms. In this editorial, we ask whether the bulk of this research is needed for the common case where congestion control involves hosts responding to simple congestion signals from the network and the performance goal is reducing some average measure of flow completion time. We raise this question because we find that, out of all the possible variations one could make in congestion control algorithms, the most essential feature is the switch scheduling algorithm. More specifically, we find that congestion control mechanisms that use Shortest-Remaining-Processing-Time (SRPT) achieve superior performance as long as the rate-setting algorithm at the host is reasonable. We further find that while SRPT's performance is quite robust to host behaviors, the performance of schemes that use scheduling algorithms like FIFO or Fair Queuing depend far more crucially on the rate-setting algorithm, and their performance is typically worse than what can be achieved with SRPT. Given these findings, we then ask whether it is practical to realize SRPT in switches without requiring custom hardware. We observe that\n            <jats:italic>approximate and deployable SRPT<\/jats:italic>\n            (ADS) designs exist, which leverage the small number of priority queues supported in almost all commodity switches, and require only software changes in the host and the switches. Our evaluations with one very simple ADS design shows that it can achieve performance close to true SRPT and is significantly better than FIFO. Thus, the answer to our basic question - whether the bulk of recent research on datacenter congestion control algorithms is needed for the common case - is no.\n          <\/jats:p>","DOI":"10.1145\/3371927.3371932","type":"journal-article","created":{"date-parts":[[2019,11,8]],"date-time":"2019-11-08T20:27:58Z","timestamp":1573244878000},"page":"32-38","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":20,"title":["Datacenter congestion control"],"prefix":"10.1145","volume":"49","author":[{"given":"Aisha","family":"Mushtaq","sequence":"first","affiliation":[{"name":"UC Berkeley"}]},{"given":"Radhika","family":"Mittal","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign"}]},{"given":"James","family":"McCauley","sequence":"additional","affiliation":[{"name":"UC Berkeley"}]},{"given":"Mohammad","family":"Alizadeh","sequence":"additional","affiliation":[{"name":"MIT"}]},{"given":"Sylvia","family":"Ratnasamy","sequence":"additional","affiliation":[{"name":"UC Berkeley"}]},{"given":"Scott","family":"Shenker","sequence":"additional","affiliation":[{"name":"UC Berkeley"}]}],"member":"320","published-online":{"date-parts":[[2019,11,8]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Data center tcp (dctcp). ACM SIGCOMM computer communication review, 41(4):63--74","author":"Alizadeh M.","year":"2011","unstructured":"M. Alizadeh , A. Greenberg , D. A. Maitz , J. Padhye , P. Patel , B. Prabhakar , S. Sengupta , and M. Sridharan . Data center tcp (dctcp). ACM SIGCOMM computer communication review, 41(4):63--74 , 2011 . M. Alizadeh, A. Greenberg, D. A. Maitz, J. Padhye, P. Patel, B. Prabhakar, S. Sengupta, and M. Sridharan. Data center tcp (dctcp). ACM SIGCOMM computer communication review, 41(4):63--74, 2011."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2534169.2486031"},{"key":"e_1_2_1_3_1","first-page":"455","volume-title":"12th USENIX Symposium on Networked Systems Design and Implementation (NSDI 15)","author":"Bai W.","year":"2015","unstructured":"W. Bai , L. Chen , K. Chen , D. Han , C. Tian , and H. Wang . PIAS: information-agnostic flow scheduling for commodity data centers . In 12th USENIX Symposium on Networked Systems Design and Implementation (NSDI 15) , pages 455 -- 468 , Oakland, CA , 2015 . USENIX Association. W. Bai, L. Chen, K. Chen, D. Han, C. Tian, and H. Wang. PIAS: information-agnostic flow scheduling for commodity data centers. In 12th USENIX Symposium on Networked Systems Design and Implementation (NSDI 15), pages 455--468, Oakland, CA, 2015. USENIX Association."},{"key":"e_1_2_1_4_1","volume-title":"Proc. ACM Internet Measurement Conference (IMC)","author":"Benson T.","year":"2012","unstructured":"T. Benson , A. Akella , and D. Maltz . Network Traffic Characteristics of Data Centers in the Wild . In Proc. ACM Internet Measurement Conference (IMC) , 2012 . T. Benson, A. Akella, and D. Maltz. Network Traffic Characteristics of Data Centers in the Wild. In Proc. ACM Internet Measurement Conference (IMC), 2012."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3098822.3098840"},{"key":"e_1_2_1_6_1","first-page":"1","volume-title":"ACM SIGCOMM Computer Communication Review","author":"Demers A.","year":"1989","unstructured":"A. Demers , S. Keshav , and S. Shenker . Analysis and simulation of a fair queueing algorithm . In ACM SIGCOMM Computer Communication Review , volume 19 , pages 1 -- 12 . ACM , 1989 . A. Demers, S. Keshav, and S. Shenker. Analysis and simulation of a fair queueing algorithm. In ACM SIGCOMM Computer Communication Review, volume 19, pages 1--12. ACM, 1989."},{"key":"e_1_2_1_7_1","first-page":"395","volume-title":"12th USENIX Symposium on Networked Systems Design and Implementation (NSDI 15)","author":"Dong M.","year":"2015","unstructured":"M. Dong , Q. Li , D. Zarchy , P. B. Godfrey , and M. Schapira . Pcc: Re-architecting congestion control for consistent high performance . In 12th USENIX Symposium on Networked Systems Design and Implementation (NSDI 15) , pages 395 -- 408 , 2015 . M. Dong, Q. Li, D. Zarchy, P. B. Godfrey, and M. Schapira. Pcc: Re-architecting congestion control for consistent high performance. In 12th USENIX Symposium on Networked Systems Design and Implementation (NSDI 15), pages 395--408, 2015."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1111322.1111336"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2716281.2836086"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3098822.3098825"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2377677.2377710"},{"key":"e_1_2_1_12_1","volume-title":"Analysis of an equal-cost multi-path algorithm","author":"Hopps C. E.","year":"2000","unstructured":"C. E. Hopps . Analysis of an equal-cost multi-path algorithm , 2000 . C. E. Hopps. Analysis of an equal-cost multi-path algorithm, 2000."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/HOTI.2010.26"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2017.8056946"},{"key":"e_1_2_1_15_1","volume-title":"Virtual eXtensible Local Area Network (VXLAN): A Framework for Overlaying Virtualized Layer 2 Networks over Layer 3 Networks. IETF RFC 7348 (Informational)","author":"Mahalingam M.","year":"2014","unstructured":"M. Mahalingam , D. Dutt , K. Duda , P. Agarwal , L. Kreeger , T. Sridhar , M. Bursell , and C. Wright . Virtual eXtensible Local Area Network (VXLAN): A Framework for Overlaying Virtualized Layer 2 Networks over Layer 3 Networks. IETF RFC 7348 (Informational) , 2014 . M. Mahalingam, D. Dutt, K. Duda, P. Agarwal, L. Kreeger, T. Sridhar, M. Bursell, and C. Wright. Virtual eXtensible Local Area Network (VXLAN): A Framework for Overlaying Virtualized Layer 2 Networks over Layer 3 Networks. IETF RFC 7348 (Informational), 2014."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3230543.3230564"},{"key":"e_1_2_1_17_1","first-page":"491","volume-title":"ACM SIGCOMM Computer Communication Review","author":"Munir A.","year":"2014","unstructured":"A. Munir , G. Baig , S. M. Irteza , I. A. Qazi , A. X. Liu , and F. R. Dogar . Friends, not foes: synthesizing existing transport strategies for data center networks . In ACM SIGCOMM Computer Communication Review , volume 44 , pages 491 -- 502 . ACM , 2014 . A. Munir, G. Baig, S. M. Irteza, I. A. Qazi, A. X. Liu, and F. R. Dogar. Friends, not foes: synthesizing existing transport strategies for data center networks. In ACM SIGCOMM Computer Communication Review, volume 44, pages 491--502. ACM, 2014."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2934872.2934890"},{"key":"e_1_2_1_19_1","unstructured":"The network simulator - ns-2. http:\/\/www.isi.edu\/nsnam\/ns\/.  The network simulator - ns-2. http:\/\/www.isi.edu\/nsnam\/ns\/."},{"key":"e_1_2_1_20_1","unstructured":"P4 behavioral model v2 (bmv2). http:\/\/github.com\/p4lang\/behavioral-model.  P4 behavioral model v2 (bmv2). http:\/\/github.com\/p4lang\/behavioral-model."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2785956.2787472"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/1972457.1972489"},{"key":"e_1_2_1_23_1","first-page":"23","volume-title":"Proceedings of the 14th ACM workshop on hot topics in networks","author":"Sivaraman A.","unstructured":"A. Sivaraman , S. Subramanian , A. Agrawal , S. Chole , S.-T. Chuang , T. Edsall , M. Alizadeh , S. Katti , N. McKeown , and H. Balakrishnan . Towards programmable packet scheduling . In Proceedings of the 14th ACM workshop on hot topics in networks , page 23 . ACM, 2015. A. Sivaraman, S. Subramanian, A. Agrawal, S. Chole, S.-T. Chuang, T. Edsall, M. Alizadeh, S. Katti, N. McKeown, and H. Balakrishnan. Towards programmable packet scheduling. In Proceedings of the 14th ACM workshop on hot topics in networks, page 23. ACM, 2015."},{"key":"e_1_2_1_24_1","first-page":"565","volume-title":"Is advance knowledge of flow sizes a plausible assumption? In 16th {USENIX} Symposium on Networked Systems Design and Implementation (NSDI 19)","author":"\u0110uki\u0107 V.","year":"2019","unstructured":"V. \u0110uki\u0107 , S. A. Jyothi , B. Karla\u0161 , M. Owaida , C. Zhang , and A. Singla . Is advance knowledge of flow sizes a plausible assumption? In 16th {USENIX} Symposium on Networked Systems Design and Implementation (NSDI 19) , pages 565 -- 580 , 2019 . V. \u0110uki\u0107, S. A. Jyothi, B. Karla\u0161, M. Owaida, C. Zhang, and A. Singla. Is advance knowledge of flow sizes a plausible assumption? In 16th {USENIX} Symposium on Networked Systems Design and Implementation (NSDI 19), pages 565--580, 2019."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2377677.2377709"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2018436.2018443"}],"container-title":["ACM SIGCOMM Computer Communication Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3371927.3371932","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3371927.3371932","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:44:19Z","timestamp":1750203859000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3371927.3371932"}},"subtitle":["identifying what is essential and making it practical"],"short-title":[],"issued":{"date-parts":[[2019,11,8]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,11,8]]}},"alternative-id":["10.1145\/3371927.3371932"],"URL":"https:\/\/doi.org\/10.1145\/3371927.3371932","relation":{},"ISSN":["0146-4833"],"issn-type":[{"type":"print","value":"0146-4833"}],"subject":[],"published":{"date-parts":[[2019,11,8]]},"assertion":[{"value":"2019-11-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}