{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:39:01Z","timestamp":1740123541022,"version":"3.37.3"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2021,1,8]],"date-time":"2021-01-08T00:00:00Z","timestamp":1610064000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,8]],"date-time":"2021-01-08T00:00:00Z","timestamp":1610064000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61772386"],"award-info":[{"award-number":["61772386"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2021,7]]},"DOI":"10.1007\/s11227-020-03614-2","type":"journal-article","created":{"date-parts":[[2021,1,8]],"date-time":"2021-01-08T16:06:47Z","timestamp":1610122007000},"page":"7690-7717","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Fair and near-optimal coflow scheduling without prior knowledge of coflow size"],"prefix":"10.1007","volume":"77","author":[{"given":"Chenghao","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huyin","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenjia","family":"Ding","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tianying","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,1,8]]},"reference":[{"key":"3614_CR1","unstructured":"Coflow benchmark based on facebook traces (2018). https:\/\/github.com\/coflow\/coflow-benchmark"},{"issue":"4","key":"3614_CR2","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1145\/1851182.1851192","volume":"41","author":"M Alizadeh","year":"2011","unstructured":"Alizadeh M, Greenberg A, Maltz DA, Padhye J, Patel P, Prabhakar B, Sengupta S, Sridharan M (2011) Data center TCP (DCTCP). ACM SIGCOMM Computer Commun Rev 41(4):63\u201374. https:\/\/doi.org\/10.1145\/1851182.1851192","journal-title":"ACM SIGCOMM Computer Commun Rev"},{"issue":"4","key":"3614_CR3","doi-asserted-by":"publisher","first-page":"1954","DOI":"10.1109\/TNET.2017.2669216","volume":"25","author":"W Bai","year":"2017","unstructured":"Bai W, Chen L, Chen K, Han D, Tian C, Wang H (2017) PIAS: Practical information-agnostic flow scheduling for commodity data centers. IEEE\/ACM Trans Netw 25(4):1954\u20131967. https:\/\/doi.org\/10.1109\/TNET.2017.2669216","journal-title":"IEEE\/ACM Trans Netw"},{"key":"3614_CR4","doi-asserted-by":"publisher","unstructured":"Ballani H, Costa P, Karagiannis T, Rowstron A (2011) Towards predictable datacenter networks. In: Proceedings of the ACM SIGCOMM 2011 Conference on SIGCOMM - SIGCOMM \u201911, vol.\u00a041, pp. 242\u2013253. ACM Press, Toronto, Ontario, Canada. https:\/\/doi.org\/10.1145\/2018436.2018465","DOI":"10.1145\/2018436.2018465"},{"key":"3614_CR5","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/j.peva.2014.07.009","volume":"79","author":"T Bonald","year":"2014","unstructured":"Bonald T, Roberts J (2014) Enhanced cluster computing performance through proportional fairness. Perform Eval 79:134\u2013145. https:\/\/doi.org\/10.1016\/j.peva.2014.07.009","journal-title":"Perform Eval"},{"key":"3614_CR6","doi-asserted-by":"publisher","unstructured":"Chen Y, Wu J (2018) Multi-hop coflow routing and scheduling in data centers. In: 2018 IEEE International Conference on Communications (ICC), pp. 1\u20136. IEEE, Kansas City, MO. https:\/\/doi.org\/10.1109\/ICC.2018.8422880","DOI":"10.1109\/ICC.2018.8422880"},{"key":"3614_CR7","unstructured":"Chowdhury M, Liu Z, Ghodsi A, Stoica I (2016) HUG: multi-resource fairness for correlated and elastic demands. 13th USENIX Symposium on networked systems design and implementation (NSDI 16). USENIX, Santa Clara, California, pp 407\u2013424"},{"key":"3614_CR8","doi-asserted-by":"publisher","unstructured":"Chowdhury M, Stoica I (2012) Coflow: an application layer abstraction for cluster networking. In: Proceedings of the 11th ACM workshop on hot topics in networks - HotNets-XI, pp. 1\u20136. ACM Press. https:\/\/doi.org\/10.1145\/2390231.2390237","DOI":"10.1145\/2390231.2390237"},{"key":"3614_CR9","doi-asserted-by":"publisher","unstructured":"Chowdhury M, Stoica I (2015) Efficient coflow scheduling without prior knowledge. In: Proceedings of the 2015 ACM Conference on Special Interest Group on Data Communication - SIGCOMM \u201915, pp. 393\u2013406. ACM Press, London, United Kingdom. https:\/\/doi.org\/10.1145\/2785956.2787480","DOI":"10.1145\/2785956.2787480"},{"issue":"4","key":"3614_CR10","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1145\/2043164.2018448","volume":"41","author":"M Chowdhury","year":"2011","unstructured":"Chowdhury M, Zaharia M, Ma J, Jordan MI, Stoica I (2011) Managing Data Transfers in Computer Clusters with Orchestra. ACM SIGCOMM Computer Commun Rev 41(4):98\u2013109. https:\/\/doi.org\/10.1145\/2043164.2018448","journal-title":"ACM SIGCOMM Computer Commun Rev"},{"key":"3614_CR11","doi-asserted-by":"publisher","unstructured":"Chowdhury M, Zhong Y, Stoica I (2014) Efficient coflow scheduling with varys. In: Proceedings of the 2014 ACM Conference on SIGCOMM - SIGCOMM \u201914, pp. 443\u2013454. ACM Press, Chicago, Illinois, USA. https:\/\/doi.org\/10.1145\/2619239.2626315","DOI":"10.1145\/2619239.2626315"},{"key":"3614_CR12","volume-title":"Coflow a networking abstraction for distributed data-parallel applications","author":"NMMK Chowdhury","year":"2015","unstructured":"Chowdhury NMMK (2015) Coflow a networking abstraction for distributed data-parallel applications. University of California, Berkeley"},{"issue":"1","key":"3614_CR13","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/1327452.1327492","volume":"51","author":"J Dean","year":"2008","unstructured":"Dean J, Ghemawat S (2008) MapReduce: simplified data processing on large clusters. Commun ACM 51(1):107\u2013113. https:\/\/doi.org\/10.1145\/1327452.1327492","journal-title":"Commun ACM"},{"key":"3614_CR14","doi-asserted-by":"publisher","unstructured":"Dogar FR, Karagiannis T, Ballani H, Rowstron A (2014) Decentralized task-aware scheduling for data center networks. In: Proceedings of the 2014 ACM Conference on SIGCOMM - SIGCOMM \u201914, pp. 431\u2013442. ACM Press, Chicago, Illinois, USA. https:\/\/doi.org\/10.1145\/2619239.2626322","DOI":"10.1145\/2619239.2626322"},{"key":"3614_CR15","unstructured":"Ghodsi A, Zaharia M, Hindman B, Konwinski A, Shenker S, Stoica I (2011) Dominant resource fairness: fair allocation of multiple resource types. In: 8th USENIX Symposium on networked systems design and implementation (NSDI \u201911), vol 11. USENIX, Boston, MA, pp 323\u2013336"},{"key":"3614_CR16","doi-asserted-by":"publisher","unstructured":"Ghodsi A, Zaharia M, Shenker S, Stoica I (2013) Choosy: max-min fair sharing for datacenter jobs with constraints. In: Proceedings of the 8th ACM European Conference on Computer Systems - EuroSys \u201913, pp. 365\u2013378. ACM Press, Prague, Czech Republic. https:\/\/doi.org\/10.1145\/2465351.2465387","DOI":"10.1145\/2465351.2465387"},{"key":"3614_CR17","doi-asserted-by":"publisher","unstructured":"Guo C, Lu G, Wang HJ, Yang S, Kong C, Sun P, Wu W, Zhang Y (2010) SecondNet: a data center network virtualization architecture with bandwidth guarantees. In: Proceedings of the 6th International Conference on - Co-NEXT \u201910. ACM Press, Philadelphia, USA. https:\/\/doi.org\/10.1145\/1921168.1921188","DOI":"10.1145\/1921168.1921188"},{"key":"3614_CR18","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.jnca.2019.02.031","volume":"135","author":"Y Guo","year":"2019","unstructured":"Guo Y, Wang Z, Zhang H, Yin X, Shi X, Wu J (2019) Joint optimization of tasks placement and routing to minimize coflow completion time. J Netw Computer Appl 135:47\u201361. https:\/\/doi.org\/10.1016\/j.jnca.2019.02.031","journal-title":"J Netw Computer Appl"},{"key":"3614_CR19","doi-asserted-by":"publisher","unstructured":"Hong CY, Caesar M, Godfrey PB (2012) Finishing flows quickly with preemptive scheduling. In: Proceedings of the ACM SIGCOMM 2012 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication - SIGCOMM \u201912, pp. 127\u2013138. ACM Press, Helsinki, Finland. https:\/\/doi.org\/10.1145\/2342356.2342389","DOI":"10.1145\/2342356.2342389"},{"key":"3614_CR20","doi-asserted-by":"publisher","unstructured":"Isard M, Budiu M, Yu Y, Birrell A, Fetterly D (2007) Dryad: distributed data-parallel programs from sequential building blocks. In: ACM SIGOPS operating systems review, vol.\u00a041, pp. 59\u201372. ACM Press, Lisboa, Portugal. https:\/\/doi.org\/10.1145\/1272996.1273005","DOI":"10.1145\/1272996.1273005"},{"key":"3614_CR21","unstructured":"Jajoo A, Hu YC, Lin X (2019) Your coflow has many flows: sampling them for fun and speed. In: Your coflow has many flows: sampling them for fun and speed. USENIX, RENTON, WA, USA, pp 833\u2013847"},{"key":"3614_CR22","unstructured":"Jeyakumar V, Alizadeh M, Mazieres D, Prabhakar B, Kim C, Greenberg A (2013) EyeQ: Practical network performance isolation at the edge. In: 10th USENIX Symposium on networked systems design and implementation (NSDI \u201913). USENIX, Lombard, IL, pp 297\u2013311"},{"issue":"1","key":"3614_CR23","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/s11235-015-9975-y","volume":"63","author":"D Jiang","year":"2016","unstructured":"Jiang D, Xu Z, Liu J, Zhao W (2016) An optimization-based robust routing algorithm to energy-efficient networks for cloud computing. Telecommun Syst 63(1):89\u201398. https:\/\/doi.org\/10.1007\/s11235-015-9975-y","journal-title":"Telecommun Syst"},{"key":"3614_CR24","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1016\/j.future.2019.03.035","volume":"97","author":"C Li","year":"2019","unstructured":"Li C, Zhang H, Zhou T (2019) Coflow scheduling algorithm based density peaks clustering. Future Gener Computer Syst 97:805\u2013813. https:\/\/doi.org\/10.1016\/j.future.2019.03.035","journal-title":"Future Gener Computer Syst"},{"issue":"3","key":"3614_CR25","doi-asserted-by":"publisher","first-page":"691","DOI":"10.2307\/2337038","volume":"78","author":"NJD Nagelkerke","year":"1991","unstructured":"Nagelkerke NJD (1991) A note on a general definition of the coefficient of determination. Biometrika 78(3):691\u2013692. https:\/\/doi.org\/10.2307\/2337038","journal-title":"Biometrika"},{"issue":"4","key":"3614_CR26","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1145\/2377677.2377717","volume":"42","author":"L Popa","year":"2012","unstructured":"Popa L, Kumar G, Chowdhury M, Krishnamurthy A, Ratnasamy S, Stoica I (2012) FairCloud: sharing the network in cloud computing. ACM SIGCOMM Computer Commun Rev 42(4):187\u2013198. https:\/\/doi.org\/10.1145\/2377677.2377717","journal-title":"ACM SIGCOMM Computer Commun Rev"},{"issue":"1","key":"3614_CR27","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1109\/TNSM.2017.2743066","volume":"15","author":"P Poullie","year":"2018","unstructured":"Poullie P, Bocek T, Stiller B (2018) A survey of the state-of-the-art in fair multi-resource allocations for data centers. IEEE Trans Netw Serv Manag 15(1):169\u2013183. https:\/\/doi.org\/10.1109\/TNSM.2017.2743066","journal-title":"IEEE Trans Netw Serv Manag"},{"issue":"4","key":"3614_CR28","doi-asserted-by":"publisher","first-page":"1674","DOI":"10.1109\/TNET.2018.2845852","volume":"26","author":"M Shafiee","year":"2018","unstructured":"Shafiee M, Ghaderi J (2018) An improved bound for minimizing the total weighted completion time of coflows in datacenters. IEEE\/ACM Trans Netw 26(4):1674\u20131687. https:\/\/doi.org\/10.1109\/TNET.2018.2845852","journal-title":"IEEE\/ACM Trans Netw"},{"key":"3614_CR29","unstructured":"Shi L, Zhang J, Liu Y, Robertazzi T (2018) Coflow scheduling in data centers: routing and bandwidth allocation. arXiv:1812.06898[cs]"},{"key":"3614_CR30","doi-asserted-by":"publisher","unstructured":"Singh A, Ong J, Agarwal A, Anderson G, Armistead A, Bannon R, Boving S, Desai G, Felderman B, Germano P, Kanagala A, Provost J, Simmons J, Tanda E, Wanderer J, H\u00f6lzle U, Stuart S, Vahdat A (2015) Jupiter rising: a decade of clos topologies and centralized control in google\u2019s datacenter network. In: Proceedings of the 2015 ACM Conference on Special Interest Group on Data Communication - SIGCOMM \u201915, vol.\u00a045, pp. 183\u2013197. ACM Press, London, United Kingdom. https:\/\/doi.org\/10.1145\/2785956.2787508","DOI":"10.1145\/2785956.2787508"},{"key":"3614_CR31","doi-asserted-by":"publisher","unstructured":"Wang L, Wang W (2018) Fair coflow scheduling without prior knowledge. In: 2018 IEEE 38th International Conference on Distributed Computing Systems (ICDCS), pp. 22\u201332. IEEE, Vienna . https:\/\/doi.org\/10.1109\/ICDCS.2018.00013","DOI":"10.1109\/ICDCS.2018.00013"},{"key":"3614_CR32","doi-asserted-by":"publisher","unstructured":"Wang L, Wang W, Li B (2018) Utopia: near-optimal coflow scheduling with isolation guarantee. In: IEEE INFOCOM 2018 - IEEE Conference on Computer Communications, pp. 891\u2013899. IEEE, Honolulu, HI. https:\/\/doi.org\/10.1109\/INFOCOM.2018.8485970","DOI":"10.1109\/INFOCOM.2018.8485970"},{"issue":"4","key":"3614_CR33","doi-asserted-by":"publisher","first-page":"1962","DOI":"10.1109\/TNET.2018.2858801","volume":"26","author":"S Wang","year":"2018","unstructured":"Wang S, Zhang J, Huang T, Pan T, Liu J, Liu Y (2018) Multi-attributes-based coflow scheduling without prior knowledge. IEEE\/ACM Trans Netw 26(4):1962\u20131975. https:\/\/doi.org\/10.1109\/TNET.2018.2858801","journal-title":"IEEE\/ACM Trans Netw"},{"key":"3614_CR34","doi-asserted-by":"publisher","unstructured":"Wang W, Jin AL (2016) Friends or foes: revisiting strategy-proofness in cloud network sharing. In: 2016 IEEE 24th International Conference on Network Protocols (ICNP), pp. 1\u201310. IEEE, Singapore. https:\/\/doi.org\/10.1109\/ICNP.2016.7784425","DOI":"10.1109\/ICNP.2016.7784425"},{"key":"3614_CR35","doi-asserted-by":"publisher","unstructured":"Wang W, Ma S, Li B, Li B (2017) Coflex: Navigating the fairness-efficiency tradeoff for coflow scheduling. In: IEEE INFOCOM 2017 - IEEE Conference on Computer Communications, pp. 1\u20139. IEEE, Atlanta, GA, USA. https:\/\/doi.org\/10.1109\/INFOCOM.2017.8057172","DOI":"10.1109\/INFOCOM.2017.8057172"},{"issue":"9","key":"3614_CR36","doi-asserted-by":"publisher","first-page":"2003","DOI":"10.1109\/TPDS.2019.2905560","volume":"30","author":"Z Wang","year":"2019","unstructured":"Wang Z, Zhang H, Shi X, Yin X, Li Y, Geng H, Wu Q, Liu J (2019) Efficient scheduling of weighted coflows in data centers. IEEE Trans Parallel Distrib Syst 30(9):2003\u20132017. https:\/\/doi.org\/10.1109\/TPDS.2019.2905560","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"3614_CR37","unstructured":"Zaharia M, Chowdhury M, Franklin MJ, Shenker S, Stoica I (2010) Spark: cluster computing with working sets. In: Proceedings of the 2nd USENIX Conference on Hot Topics in Cloud Computing., vol.\u00a010, pp. 10\u201317. Boston, MA"},{"key":"3614_CR38","doi-asserted-by":"publisher","unstructured":"Zhang H, Chen L, Yi B, Chen K, Chowdhury M., Geng Y (2016) CODA: toward automatically identifying and scheduling coflows in the dark. In: Proceedings of the 2016 Conference on ACM SIGCOMM 2016 Conference - SIGCOMM \u201916, pp. 160\u2013173. ACM Press, Florianopolis, Brazil . https:\/\/doi.org\/10.1145\/2934872.2934880","DOI":"10.1145\/2934872.2934880"},{"key":"3614_CR39","doi-asserted-by":"publisher","unstructured":"Zhang H, Shi X, Yin X, Wang Z (2017) Yosemite: efficient scheduling of weighted coflows in data centers. In: 2017 IEEE 25th International Conference on Network Protocols (ICNP), pp. 1\u20132. IEEE, Toronto, ON. https:\/\/doi.org\/10.1109\/ICNP.2017.8117586","DOI":"10.1109\/ICNP.2017.8117586"},{"key":"3614_CR40","doi-asserted-by":"publisher","unstructured":"Zhao Y, Chen K, Bai W, Yu M, Tian C, Geng Y, Zhang Y, Li D, Wang S (2015) Rapier: integrating routing and scheduling for coflow-aware data center networks. In: 2015 IEEE Conference on Computer Communications (INFOCOM), pp. 424\u2013432. IEEE, Kowloon, Hong Kong . https:\/\/doi.org\/10.1109\/INFOCOM.2015.7218408","DOI":"10.1109\/INFOCOM.2015.7218408"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-020-03614-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-020-03614-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-020-03614-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,21]],"date-time":"2021-06-21T11:00:13Z","timestamp":1624273213000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-020-03614-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,8]]},"references-count":40,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2021,7]]}},"alternative-id":["3614"],"URL":"https:\/\/doi.org\/10.1007\/s11227-020-03614-2","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"type":"print","value":"0920-8542"},{"type":"electronic","value":"1573-0484"}],"subject":[],"published":{"date-parts":[[2021,1,8]]},"assertion":[{"value":"29 December 2020","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 January 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}