{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T14:45:05Z","timestamp":1775745905240,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":26,"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"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62002066, 62002019"],"award-info":[{"award-number":["62002066, 62002019"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Shanghai Pujiang Program","award":["2020PJD005"],"award-info":[{"award-number":["2020PJD005"]}]},{"DOI":"10.13039\/501100003399","name":"Science and Technology Commission of Shanghai Municipality","doi-asserted-by":"publisher","award":["20S31903800"],"award-info":[{"award-number":["20S31903800"]}],"id":[{"id":"10.13039\/501100003399","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Beijing Institute of Technology Research Fund Program for Young Scholars"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,8,9]]},"DOI":"10.1145\/3472456.3472507","type":"proceedings-article","created":{"date-parts":[[2021,10,5]],"date-time":"2021-10-05T18:46:04Z","timestamp":1633459564000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Optimizing Flow Completion Time via Adaptive Buffer Management in Data Center Networks"],"prefix":"10.1145","author":[{"given":"Sen","family":"Liu","sequence":"first","affiliation":[{"name":"Fudan University, China"}]},{"given":"Xiang","family":"Lin","sequence":"additional","affiliation":[{"name":"Fudan University"}]},{"given":"Zehua","family":"Guo","sequence":"additional","affiliation":[{"name":"Beijing Institute of Technology, China"}]},{"given":"Yi","family":"Wang","sequence":"additional","affiliation":[{"name":"Peng Cheng Laboratory, China"}]},{"given":"Mohamed Adel","family":"Serhani","sequence":"additional","affiliation":[{"name":"United Arab Emirates University"}]},{"given":"Yang","family":"Xu","sequence":"additional","affiliation":[{"name":"Fudan University, China"}]}],"member":"320","published-online":{"date-parts":[[2021,10,5]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3359989.3365426"},{"key":"e_1_3_2_1_2_1","volume-title":"Data center tcp (dctcp). ACM SIGCOMM computer communication review 41, 4","author":"Alizadeh Mohammad","year":"2011","unstructured":"Mohammad Alizadeh , Albert Greenberg , David\u00a0 A Maltz , Jitendra Padhye , Parveen Patel , Balaji Prabhakar , Sudipta Sengupta , and Murari Sridharan . 2011. Data center tcp (dctcp). ACM SIGCOMM computer communication review 41, 4 ( 2011 ), 63\u201374. Mohammad Alizadeh, Albert Greenberg, David\u00a0A Maltz, Jitendra Padhye, Parveen Patel, Balaji Prabhakar, Sudipta Sengupta, and Murari Sridharan. 2011. Data center tcp (dctcp). ACM SIGCOMM computer communication review 41, 4 (2011), 63\u201374."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2017.2669216"},{"key":"e_1_3_2_1_4_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 datacenter transport. In ACM SIGCOMM Computer Communication Review Vol.\u00a043. ACM 435\u2013446.  Mohammad Alizadeh Shuang Yang Milad Sharif Sachin Katti Nick McKeown Balaji Prabhakar and Scott Shenker. 2013. pfabric: Minimal near-optimal datacenter transport. In ACM SIGCOMM Computer Communication Review Vol.\u00a043. ACM 435\u2013446.","DOI":"10.1145\/2534169.2486031"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2019.2927072"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2017.8056946"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2017.8057181"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2013.6567018"},{"key":"e_1_3_2_1_9_1","volume-title":"2015 USENIXAnnual Technical Conference (USENIX ATC15)","author":"Lee Changhyun","year":"2015","unstructured":"Changhyun Lee , Chunjong Park , Keon Jang , Sue Moon , and Dongsu Han . 2015 . Accurate latency-based congestion feedback for datacenters . In 2015 USENIXAnnual Technical Conference (USENIX ATC15) . 403\u2013415. Changhyun Lee, Chunjong Park, Keon Jang, Sue Moon, and Dongsu Han. 2015. Accurate latency-based congestion feedback for datacenters. In 2015 USENIXAnnual Technical Conference (USENIX ATC15). 403\u2013415."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1672308.1672325"},{"key":"e_1_3_2_1_11_1","unstructured":"2014 [Online]. Available: http:\/\/dpdk.org\/. Intel DPDK. http:\/\/dpdk.org\/  2014 [Online]. Available: http:\/\/dpdk.org\/. Intel DPDK. http:\/\/dpdk.org\/"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1879141.1879175"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"Arjun Roy Hongyi Zeng Jasmeet Bagga George Porter and Alex\u00a0C Snoeren. 2015. Inside the social network\u2019s (datacenter) network. In ACM SIGCOMM Computer Communication Review Vol.\u00a045. ACM 123\u2013137.  Arjun Roy Hongyi Zeng Jasmeet Bagga George Porter and Alex\u00a0C Snoeren. 2015. Inside the social network\u2019s (datacenter) network. In ACM SIGCOMM Computer Communication Review Vol.\u00a045. ACM 123\u2013137.","DOI":"10.1145\/2829988.2787472"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3230543.3230564"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3098822.3098840"},{"key":"e_1_3_2_1_16_1","volume-title":"To schedule or not to schedule: when no-scheduling can beat the best-known flow scheduling algorithm in datacenter networks. Computer Networks","author":"Abbasloo Soheil","year":"2020","unstructured":"Soheil Abbasloo , Yang Xu , and H.\u00a0 Jonathan Chao . 2020. To schedule or not to schedule: when no-scheduling can beat the best-known flow scheduling algorithm in datacenter networks. Computer Networks ( 2020 ), 107177. Soheil Abbasloo, Yang Xu, and H.\u00a0Jonathan Chao. 2020. To schedule or not to schedule: when no-scheduling can beat the best-known flow scheduling algorithm in datacenter networks. Computer Networks (2020), 107177."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.664262"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3106989.3107003"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2019.00014"},{"key":"e_1_3_2_1_20_1","volume-title":"Fundamentals of Queueing Theory","author":"Gross D.","unstructured":"D. Gross . 1985. Fundamentals of Queueing Theory . WILEY. D. Gross. 1985. Fundamentals of Queueing Theory. WILEY."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.251892"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2377677.2377709"},{"key":"e_1_3_2_1_23_1","volume-title":"IEEE INFOCOM 2014 - IEEE Conference on Computer Communications. 1581\u20131589","author":"Xu H.","unstructured":"H. Xu and B. Li . 2014. RepFlow: Minimizing flow completion times with replicated flows in data centers . In IEEE INFOCOM 2014 - IEEE Conference on Computer Communications. 1581\u20131589 . H. Xu and B. Li. 2014. RepFlow: Minimizing flow completion times with replicated flows in data centers. In IEEE INFOCOM 2014 - IEEE Conference on Computer Communications. 1581\u20131589."},{"key":"e_1_3_2_1_24_1","volume-title":"Proc. IEEE INFOCOM. 1\u20139.","author":"Kheirkhah M.","unstructured":"M. Kheirkhah , I. Wakeman , and G. Parisis . 2016. MMPTCP: A multipath transport protocol for data centers . In Proc. IEEE INFOCOM. 1\u20139. M. Kheirkhah, I. Wakeman, and G. Parisis. 2016. MMPTCP: A multipath transport protocol for data centers. In Proc. IEEE INFOCOM. 1\u20139."},{"key":"e_1_3_2_1_25_1","volume-title":"Proc. IEEE ICNP. 362\u2013367","author":"Wang W.","unstructured":"W. Wang , Y. Sun , K. Zheng , M.\u00a0 A. Kaafar , D. Li , and Z. Li . 2014. Freeway: Adaptively Isolating the Elephant and Mice Flows on Different Transmission Paths . In Proc. IEEE ICNP. 362\u2013367 . W. Wang, Y. Sun, K. Zheng, M.\u00a0A. Kaafar, D. Li, and Z. Li. 2014. Freeway: Adaptively Isolating the Elephant and Mice Flows on Different Transmission Paths. In Proc. IEEE ICNP. 362\u2013367."},{"key":"e_1_3_2_1_26_1","volume-title":"Approximating Fair Queueing on Reconfigurable Switches.NSDI","author":"Sharma Naveen\u00a0Kr","year":"2018","unstructured":"Naveen\u00a0Kr Sharma , Ming Liu , Kishore Atreya , and Arvind Krishnamurthy . 2018. Approximating Fair Queueing on Reconfigurable Switches.NSDI ( 2018 ). Naveen\u00a0Kr Sharma, Ming Liu, Kishore Atreya, and Arvind Krishnamurthy. 2018. Approximating Fair Queueing on Reconfigurable Switches.NSDI (2018)."}],"event":{"name":"ICPP 2021: 50th International Conference on Parallel Processing","location":"Lemont IL USA","acronym":"ICPP 2021"},"container-title":["50th International Conference on Parallel Processing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3472456.3472507","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3472456.3472507","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:48:12Z","timestamp":1750193292000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3472456.3472507"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,9]]},"references-count":26,"alternative-id":["10.1145\/3472456.3472507","10.1145\/3472456"],"URL":"https:\/\/doi.org\/10.1145\/3472456.3472507","relation":{},"subject":[],"published":{"date-parts":[[2021,8,9]]},"assertion":[{"value":"2021-10-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}