{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T12:24:47Z","timestamp":1761395087500,"version":"3.40.5"},"reference-count":29,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2017,11,1]],"date-time":"2017-11-01T00:00:00Z","timestamp":1509494400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computer Networks"],"published-print":{"date-parts":[[2017,11]]},"DOI":"10.1016\/j.comnet.2017.08.020","type":"journal-article","created":{"date-parts":[[2017,8,31]],"date-time":"2017-08-31T06:16:53Z","timestamp":1504160213000},"page":"352-367","update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":8,"special_numbering":"C","title":["More load, more differentiation \u2014 Let more flows finish before deadline in data center networks"],"prefix":"10.1016","volume":"127","author":[{"given":"Han","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0003-4429-9959","authenticated-orcid":false,"given":"Xingang","family":"Shi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yingya","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhiliang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xia","family":"Yin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.comnet.2017.08.020_bib0001","series-title":"ACM SIGCOMM Computer Communication Review","first-page":"443","article-title":"Efficient coflow scheduling with varys","volume":"vol. 44","author":"Chowdhury","year":"2014"},{"key":"10.1016\/j.comnet.2017.08.020_bib0002","series-title":"Proceedings of the 2016 conference on ACM SIGCOMM 2016 Conference","first-page":"174","article-title":"Scheduling mix-flows in commodity datacenters with karuna","author":"Chen","year":"2016"},{"key":"10.1016\/j.comnet.2017.08.020_bib0003","series-title":"Quality of Service (IWQoS), 2016 IEEE\/ACM 24th International Symposium on","first-page":"1","article-title":"Fdrc-flow duration time based rate control in data center networks","author":"Zhang","year":"2016"},{"key":"10.1016\/j.comnet.2017.08.020_bib0004","series-title":"Proceedings of the 11th ACM Workshop on Hot Topics in Networks","first-page":"31","article-title":"Coflow: a networking abstraction for cluster applications","author":"Chowdhury","year":"2012"},{"key":"10.1016\/j.comnet.2017.08.020_bib0005","series-title":"ACM SIGCOMM Computer Communication Review","first-page":"393","article-title":"Efficient coflow scheduling without prior knowledge","volume":"vol. 45","author":"Chowdhury","year":"2015"},{"key":"10.1016\/j.comnet.2017.08.020_bib0006","first-page":"63","article-title":"Data center tcp (dctcp)","author":"Alizadeh","year":"2010"},{"key":"10.1016\/j.comnet.2017.08.020_bib0007","series-title":"ISCA \u201911","first-page":"319","article-title":"Power management of online data-intensive services","author":"Meisner","year":"2011"},{"key":"10.1016\/j.comnet.2017.08.020_bib0008","series-title":"SIGCOMM \u201912","first-page":"115","article-title":"Deadline-aware datacenter tcp (d2tcp)","author":"Vamanan","year":"2012"},{"unstructured":"Latency, Latency is everywhere and it costs you sales - how to crush it, 2009, (https:\/\/2.zoppoz.workers.dev:443\/http\/highscalability.com\/latency-everywhere-and-it-costs-you-sales-how-crush-it).","key":"10.1016\/j.comnet.2017.08.020_bib0009"},{"key":"10.1016\/j.comnet.2017.08.020_bib0010","series-title":"SIGCOMM \u201911","first-page":"50","article-title":"Better never than late: meeting deadlines in datacenter networks","author":"Wilson","year":"2011"},{"issue":"4","key":"10.1016\/j.comnet.2017.08.020_bib0011","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1145\/2377677.2377710","article-title":"Finishing flows quickly with preemptive scheduling","volume":"42","author":"Hong","year":"2012","journal-title":"ACM SIGCOMM Comput. Commun. Rev."},{"key":"10.1016\/j.comnet.2017.08.020_bib0012","series-title":"INFOCOM, 2013 Proceedings IEEE","first-page":"2157","article-title":"Minimizing flow completion times in data centers","author":"Munir","year":"2013"},{"key":"10.1016\/j.comnet.2017.08.020_bib0013","series-title":"SIGCOMM \u201913","first-page":"435","article-title":"pfabric: Minimal near-optimal datacenter transport","author":"Alizadeh","year":"2013"},{"unstructured":"The network simulator \u2014 ns-2, (https:\/\/2.zoppoz.workers.dev:443\/http\/www.isi.edu\/nsnam\/ns\/).","key":"10.1016\/j.comnet.2017.08.020_bib0014"},{"unstructured":"Simulation code of lpd, (https:\/\/2.zoppoz.workers.dev:443\/https\/github.com\/zhanghan1990\/LPD-sim\/).","key":"10.1016\/j.comnet.2017.08.020_bib0015"},{"unstructured":"Linux kernel code of lpd, (https:\/\/2.zoppoz.workers.dev:443\/https\/github.com\/zhanghan1990\/LPD\/).","key":"10.1016\/j.comnet.2017.08.020_bib0016"},{"key":"10.1016\/j.comnet.2017.08.020_bib0017","series-title":"FAST\u201908","first-page":"12:1","article-title":"Measurement and analysis of tcp throughput collapse in cluster-based storage systems","author":"Phanishayee","year":"2008"},{"key":"10.1016\/j.comnet.2017.08.020_bib0018","first-page":"73","article-title":"Understanding tcp incast throughput collapse in datacenter networks","author":"Chen","year":"2009"},{"year":"2003","author":"Poynton","series-title":"Digital Video and HDTV Algorithms and Interfaces","key":"10.1016\/j.comnet.2017.08.020_bib0019"},{"key":"10.1016\/j.comnet.2017.08.020_bib0020","series-title":"ACM SIGCOMM Computer Communication Review","first-page":"537","article-title":"Timely: Rtt-based congestion control for the datacenter","volume":"vol. 45","author":"Mittal","year":"2015"},{"key":"10.1016\/j.comnet.2017.08.020_bib0021","series-title":"SIGCOMM \u201912","first-page":"139","article-title":"Detail: Reducing the flow completion time tail in datacenter networks","author":"Zats","year":"2012"},{"key":"10.1016\/j.comnet.2017.08.020_bib0022","series-title":"Proceedings of the 2014 ACM Conference on SIGCOMM","first-page":"491","article-title":"Friends, not foes: synthesizing existing transport strategies for data center networks","author":"Munir","year":"2014"},{"key":"10.1016\/j.comnet.2017.08.020_bib0023","series-title":"2015 IEEE Conference on Computer Communications (INFOCOM)","first-page":"127","article-title":"More load, more differentiationa design principle for deadline-aware congestion control","author":"Zhang","year":"2015"},{"key":"10.1016\/j.comnet.2017.08.020_bib0024","series-title":"Proceedings of the ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems","first-page":"73","article-title":"Analysis of dctcp: stability, convergence, and fairness","author":"Alizadeh","year":"2011"},{"key":"10.1016\/j.comnet.2017.08.020_bib0025","series-title":"ACM SIGCOMM Computer Communication Review","first-page":"151","article-title":"Fluid-based analysis of a network of aqm routers supporting tcp flows with an application to red","volume":"vol. 30","author":"Misra","year":"2000"},{"unstructured":"H. Scalability, Latency is everywhere and it costs you sales - how to crush it,, (https:\/\/2.zoppoz.workers.dev:443\/http\/simula.stanford.edu\/~alizade\/Site\/DCTCP.html).","key":"10.1016\/j.comnet.2017.08.020_bib0026"},{"key":"10.1016\/j.comnet.2017.08.020_bib0027","series-title":"Proceedings of the 2014 ACM conference on SIGCOMM","first-page":"467","article-title":"Application-driven bandwidth guarantees in datacenters","author":"Lee","year":"2014"},{"unstructured":"The dummynet project. [online]. available,, (https:\/\/2.zoppoz.workers.dev:443\/http\/info.iet.unipi.it\/luigi\/dummynet\/).","key":"10.1016\/j.comnet.2017.08.020_bib0028"},{"key":"10.1016\/j.comnet.2017.08.020_bib0029","series-title":"Proceedings of the ninth ACM conference on Emerging networking experiments and technologies","first-page":"73","article-title":"Explicit multipath congestion control for data center networks","author":"Cao","year":"2013"}],"container-title":["Computer Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S138912861730333X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S138912861730333X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,11,22]],"date-time":"2018-11-22T23:39:42Z","timestamp":1542929982000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S138912861730333X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11]]},"references-count":29,"alternative-id":["S138912861730333X"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.comnet.2017.08.020","relation":{},"ISSN":["1389-1286"],"issn-type":[{"type":"print","value":"1389-1286"}],"subject":[],"published":{"date-parts":[[2017,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"More load, more differentiation \u2014 Let more flows finish before deadline in data center networks","name":"articletitle","label":"Article Title"},{"value":"Computer Networks","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.comnet.2017.08.020","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2017 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}