{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,10]],"date-time":"2026-08-10T15:31:32Z","timestamp":1786375892778,"version":"build-2736575974"},"reference-count":34,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100004735","name":"Hunan Provincial Natural Science Foundation","doi-asserted-by":"publisher","award":["2026JJ70137"],"award-info":[{"award-number":["2026JJ70137"]}],"id":[{"id":"10.13039\/501100004735","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computer Networks"],"published-print":{"date-parts":[[2026,9]]},"DOI":"10.1016\/j.comnet.2026.112526","type":"journal-article","created":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T15:21:22Z","timestamp":1783178482000},"page":"112526","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["AdaCoflow: Adaptive coflow scheduling for datacenter networks with uncertainty"],"prefix":"10.1016","volume":"287","author":[{"given":"Jifang","family":"Rong","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xuchong","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fengjuan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qiangying","family":"Xiao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ying","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wei","family":"Shi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.comnet.2026.112526_b1","doi-asserted-by":"crossref","DOI":"10.1016\/j.comnet.2025.111765","article-title":"Deadline-aware load balancing for coflow in datacenter networks","volume":"273","author":"Gong","year":"2025","journal-title":"Comput. Netw."},{"key":"10.1016\/j.comnet.2026.112526_b2","series-title":"Proceedings of the 2025 2nd International Conference on Big Data Analytics and Artificial Intelligence Application","article-title":"Distributed multi-level task scheduling framework for datacenter applications","author":"Mo","year":"2026"},{"key":"10.1016\/j.comnet.2026.112526_b3","series-title":"Proceedings of the 11th ACM Workshop on Hot Topics in Networks (HotNets)","first-page":"31","article-title":"Coflow: A networking abstraction for cluster applications","author":"Chowdhury","year":"2012"},{"key":"10.1016\/j.comnet.2026.112526_b4","series-title":"Proceedings of the ACM SIGCOMM 2014 Conference","first-page":"443","article-title":"Efficient coflow scheduling with varys","author":"Chowdhury","year":"2014"},{"key":"10.1016\/j.comnet.2026.112526_b5","series-title":"Proceedings of the ACM SIGCOMM 2015 Conference","first-page":"393","article-title":"Efficient coflow scheduling without prior knowledge","author":"Chowdhury","year":"2015"},{"key":"10.1016\/j.comnet.2026.112526_b6","doi-asserted-by":"crossref","DOI":"10.1016\/j.comnet.2024.110429","article-title":"SARS: Towards minimizing average coflow completion time in MapReduce systems","volume":"247","author":"Wang","year":"2024","journal-title":"Comput. Netw."},{"key":"10.1016\/j.comnet.2026.112526_b7","doi-asserted-by":"crossref","DOI":"10.1016\/j.comnet.2024.110685","article-title":"MSDQ: Multi-scheduling dual-queues coflow scheduling without prior knowledge","volume":"252","author":"Liu","year":"2024","journal-title":"Comput. Netw."},{"issue":"1","key":"10.1016\/j.comnet.2026.112526_b8","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1109\/TNET.2022.3187821","article-title":"Meeting coflow deadlines in data center networks with policy-based selective completion","volume":"31","author":"Luo","year":"2023","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"10.1016\/j.comnet.2026.112526_b9","first-page":"12","article-title":"Online scheduling of coflows by attention-empowered deep reinforcement learning","volume":"145","author":"Wang","year":"2023","journal-title":"Future Gener. Comput. Syst."},{"issue":"2","key":"10.1016\/j.comnet.2026.112526_b10","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1109\/TPDS.2024.3508275","article-title":"Slark: A performance robust decentralized inter-datacenter deadline-aware coflows scheduling framework with local information","volume":"36","author":"Dong","year":"2025","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"10.1016\/j.comnet.2026.112526_b11","series-title":"Proceedings of the 21st ACM Workshop on Hot Topics in Networks (HotNets)","first-page":"93","article-title":"Efficient flow scheduling in distributed deep learning training with echelon formation","author":"Pan","year":"2022"},{"key":"10.1016\/j.comnet.2026.112526_b12","series-title":"Proceedings of the ACM SIGCOMM 2024 Conference","article-title":"Crux: GPU-efficient communication scheduling for deep learning clusters","author":"Cao","year":"2024"},{"key":"10.1016\/j.comnet.2026.112526_b13","series-title":"Proceedings of the 29th ACM International Conference on Architectural Support for Programming Languages and Operating Systems","article-title":"Centauri: Enabling efficient scheduling for communication-computation overlap in large model training via communication partitioning","author":"Chen","year":"2024"},{"key":"10.1016\/j.comnet.2026.112526_b14","series-title":"Proceedings of the ACM SIGCOMM 2025 Conference","article-title":"Coflow scheduling for LLM training","author":"Wan","year":"2025"},{"key":"10.1016\/j.comnet.2026.112526_b15","series-title":"Proceedings of the 23rd ACM Workshop on Hot Topics in Networks (HotNets)","first-page":"167","article-title":"MLTCP: A distributed technique to approximate centralized flow scheduling for machine learning","author":"Rajasekaran","year":"2024"},{"issue":"5","key":"10.1016\/j.comnet.2026.112526_b16","doi-asserted-by":"crossref","first-page":"861","DOI":"10.1109\/TPDS.2025.3543882","article-title":"Courier: A unified communication agent to support concurrent flow scheduling in cluster computing","volume":"36","author":"Zhang","year":"2025","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"10.1016\/j.comnet.2026.112526_b17","series-title":"19th USENIX Symposium on Operating Systems Design and Implementation","article-title":"S\u00f6ze: One network telemetry is all you need for per-flow weighted bandwidth allocation at scale","author":"Wang","year":"2025"},{"issue":"3","key":"10.1016\/j.comnet.2026.112526_b18","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1214\/aoms\/1177729586","article-title":"A stochastic approximation method","volume":"22","author":"Robbins","year":"1951","journal-title":"Ann. Math. Stat."},{"key":"10.1016\/j.comnet.2026.112526_b19","series-title":"Optimizing Methods in Statistics","first-page":"233","article-title":"A convergence theorem for non-negative almost supermartingales and some applications","author":"Robbins","year":"1971"},{"key":"10.1016\/j.comnet.2026.112526_b20","article-title":"Scheduling coflows for minimizing the total weighted completion time in heterogeneous parallel networks","volume":"180","author":"Chen","year":"2023","journal-title":"J. Parallel Distrib. Comput."},{"issue":"3","key":"10.1016\/j.comnet.2026.112526_b21","doi-asserted-by":"crossref","first-page":"2068","DOI":"10.1109\/TNET.2024.3354245","article-title":"Scheduling coflows in hybrid optical-circuit and electrical-packet-switched data center networks with performance guarantee","volume":"32","author":"Wang","year":"2024","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"9\u201311","key":"10.1016\/j.comnet.2026.112526_b22","article-title":"Toward latency-efficient multicast coflow scheduling for reconfigurable data center networks","volume":"37","author":"Li","year":"2025","journal-title":"Concurr. Comput. : Pr. Exp."},{"key":"10.1016\/j.comnet.2026.112526_b23","series-title":"Proceedings of the ACM SIGCOMM 2024 Conference","article-title":"Alibaba HPN: A data center network for large language model training","author":"Qian","year":"2024"},{"key":"10.1016\/j.comnet.2026.112526_b24","series-title":"Proceedings of the ACM SIGCOMM 2024 Conference","article-title":"PPT: A pragmatic transport for datacenters","author":"Suo","year":"2024"},{"key":"10.1016\/j.comnet.2026.112526_b25","series-title":"Proceedings of the ACM SIGCOMM 2025 Conference","article-title":"ResCCL: Resource-efficient scheduling for collective communication","author":"Liu","year":"2025"},{"key":"10.1016\/j.comnet.2026.112526_b26","series-title":"Proceedings of the ACM SIGCOMM 2025 Conference","article-title":"SyCCL: Exploiting symmetry for efficient collective communication","author":"Cao","year":"2025"},{"key":"10.1016\/j.comnet.2026.112526_b27","series-title":"2025 USENIX Annual Technical Conference","article-title":"CrossPipe: Towards optimal pipeline schedules for cross-datacenter training","author":"Chen","year":"2025"},{"key":"10.1016\/j.comnet.2026.112526_b28","series-title":"Proceedings of the 24th International Conference on Distributed Computing and Networking","first-page":"25","article-title":"Learned load balancing","author":"Chang","year":"2023"},{"key":"10.1016\/j.comnet.2026.112526_b29","doi-asserted-by":"crossref","unstructured":"Z. Liu, Z. Niu, R. Shu, L. Gao, G. Lai, N. Wang, Z. He, J. Nelson, D.R.K. Ports, L. Yuan, P. Cheng, Y. Xiong, SlimeMold: Hardware load balancer at scale in datacenter, in: Proceedings of the 7th Asia-Pacific Workshop on Networking (APNet), 2023, pp. 136\u2013142.","DOI":"10.1145\/3600061.3600067"},{"key":"10.1016\/j.comnet.2026.112526_b30","series-title":"Proceedings of the Nineteenth European Conference on Computer Systems (EuroSys)","article-title":"Halflife: An adaptive flowlet-based load balancer with fading timeout in data center networks","author":"Liu","year":"2024"},{"key":"10.1016\/j.comnet.2026.112526_b31","series-title":"2025 USENIX Annual Technical Conference","article-title":"FLB: Fine-grained load balancing for lossless datacenter networks","author":"Hu","year":"2025"},{"key":"10.1016\/j.comnet.2026.112526_b32","series-title":"The 9th Asia-Pacific Workshop on Networking (APNet)","article-title":"Maat: A fair layer-4 load balancer with per-connection consistency","author":"Huang","year":"2025"},{"issue":"6","key":"10.1016\/j.comnet.2026.112526_b33","doi-asserted-by":"crossref","first-page":"146:1","DOI":"10.1145\/3638757","article-title":"Deep learning workload scheduling in GPU datacenters: A survey","volume":"56","author":"Ye","year":"2024","journal-title":"ACM Comput. Surv."},{"issue":"1","key":"10.1016\/j.comnet.2026.112526_b34","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1109\/COMST.2023.3329027","article-title":"A survey on scheduling techniques in computing and network convergence","volume":"26","author":"Tang","year":"2024","journal-title":"IEEE Commun. Surv. Tutor."}],"container-title":["Computer Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1389128626005384?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1389128626005384?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,8,10]],"date-time":"2026-08-10T15:19:26Z","timestamp":1786375166000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1389128626005384"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9]]},"references-count":34,"alternative-id":["S1389128626005384"],"URL":"https:\/\/doi.org\/10.1016\/j.comnet.2026.112526","relation":{},"ISSN":["1389-1286"],"issn-type":[{"value":"1389-1286","type":"print"}],"subject":[],"published":{"date-parts":[[2026,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"AdaCoflow: Adaptive coflow scheduling for datacenter networks with uncertainty","name":"articletitle","label":"Article Title"},{"value":"Computer Networks","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.comnet.2026.112526","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"112526"}}