{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,5]],"date-time":"2024-10-05T04:11:15Z","timestamp":1728101475564},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"19","license":[{"start":{"date-parts":[[2024,8,30]],"date-time":"2024-08-30T00:00:00Z","timestamp":1724976000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,8,30]],"date-time":"2024-08-30T00:00:00Z","timestamp":1724976000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Natural Science Foundation for Young Scientists of Shandong Province","award":["ZR2022QF143"],"award-info":[{"award-number":["ZR2022QF143"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1007\/s11227-024-06457-3","type":"journal-article","created":{"date-parts":[[2024,8,30]],"date-time":"2024-08-30T12:02:27Z","timestamp":1725019347000},"page":"26726-26750","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Fast and isolation guaranteed coflow scheduling via traffic forecasting in multi-tenant environment"],"prefix":"10.1007","volume":"80","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":"Fei","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sheng","family":"Hao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,8,30]]},"reference":[{"key":"6457_CR1","doi-asserted-by":"publisher","unstructured":"Ekanayake J, Gunarathne T, Fox G, Balkir AS, Poulain C, Araujo N, Barga R (2009) DryadLINQ for scientific analyses. In: 2009 Fifth IEEE International Conference on E-Science, pp. 329\u2013336. IEEE, https:\/\/doi.org\/10.1109\/e-Science.2009.53","DOI":"10.1109\/e-Science.2009.53"},{"key":"6457_CR2","unstructured":"Apache Spark. http:\/\/spark.apache.org\/ Accessed 2021-04-04"},{"issue":"1","key":"6457_CR3","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"},{"issue":"1","key":"6457_CR4","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1109\/TNET.2021.3116133","volume":"30","author":"M Shafiee","year":"2022","unstructured":"Shafiee M, Ghaderi J (2022) Scheduling coflows with dependency graph. IEEE\/ACM Trans Netw 30(1):450\u2013463. https:\/\/doi.org\/10.1109\/TNET.2021.3116133","journal-title":"IEEE\/ACM Trans Netw"},{"issue":"4","key":"6457_CR5","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":"6457_CR6","doi-asserted-by":"publisher","first-page":"102590","DOI":"10.1016\/j.jnca.2020.102590","volume":"158","author":"P Zhou","year":"2020","unstructured":"Zhou P, He X, Luo S, Yu H, Sun G (2020) JPAS: Job-progress-aware flow scheduling for deep learning clusters. J Netw Comput Appl 158:102590\u2013102604. https:\/\/doi.org\/10.1016\/j.jnca.2020.102590","journal-title":"J Netw Comput Appl"},{"key":"6457_CR7","doi-asserted-by":"publisher","unstructured":"Wang S, Wang S, Zhou D, Yang Y, Zhang W, Huang T, Huo R, Liu Y (2020) Large-Scale and rapid flow size estimation for improving flow scheduling. In: IEEE INFOCOM 2020 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), pp. 1141\u20131146. https:\/\/doi.org\/10.1109\/INFOCOMWKSHPS50562.2020.9163019","DOI":"10.1109\/INFOCOMWKSHPS50562.2020.9163019"},{"issue":"7","key":"6457_CR8","doi-asserted-by":"publisher","first-page":"7690","DOI":"10.1007\/s11227-020-03614-2","volume":"77","author":"C Li","year":"2021","unstructured":"Li C, Zhang H, Ding W, Zhou T (2021) Fair and near-optimal coflow scheduling without prior knowledge of coflow size. J Supercomput 77(7):7690\u20137717. https:\/\/doi.org\/10.1007\/s11227-020-03614-2","journal-title":"J Supercomput"},{"key":"6457_CR9","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/j.comnet.2019.05.010","volume":"158","author":"B Tian","year":"2019","unstructured":"Tian B, Tian C, Wang B, Li B, He Z, Dai H, Liu K, Dou W, Chen G (2019) Scheduling dependent coflows to minimize the total weighted job completion time in datacenters. Comput Netw 158:193\u2013205. https:\/\/doi.org\/10.1016\/j.comnet.2019.05.010","journal-title":"Comput Netw"},{"issue":"1","key":"6457_CR10","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1109\/TNET.2020.3037064","volume":"29","author":"Y Zhao","year":"2021","unstructured":"Zhao Y, Tian C, Fan J, Guan T, Zhang X, Qiao C (2021) Joint reducer placement and coflow bandwidth scheduling for computing clusters. IEEE\/ACM Trans Netw 29(1):438\u2013451. https:\/\/doi.org\/10.1109\/TNET.2020.3037064","journal-title":"IEEE\/ACM Trans Netw"},{"issue":"3","key":"6457_CR11","doi-asserted-by":"publisher","first-page":"1280","DOI":"10.1109\/TNET.2021.3058164","volume":"29","author":"H Tan","year":"2021","unstructured":"Tan H, Zhang C, Xu C, Li Y, Han Z, Li X-Y (2021) Regularization-based coflow scheduling in optical circuit switches. IEEE\/ACM Trans Netw 29(3):1280\u20131293. https:\/\/doi.org\/10.1109\/TNET.2021.3058164","journal-title":"IEEE\/ACM Trans Netw"},{"key":"6457_CR12","unstructured":"Chowdhury M, Liu Z, Ghodsi A, Stoica I (2016) HUG: multi-resource fairness for correlated and elastic demands. In: 13th USENIX Symposium on Networked Systems Design and Implementation (NSDI 16), pp. 407\u2013424. USENIX, Santa Clara, California"},{"key":"6457_CR13","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"},{"key":"6457_CR14","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"},{"key":"6457_CR15","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":"6457_CR16","doi-asserted-by":"publisher","unstructured":"Lu Y, Chen G, Luo L, Tan K, Xiong Y, Wang X, Chen E (2017) One more queue is enough: minimizing flow completion time with explicit priority notification. In: IEEE INFOCOM 2017 - IEEE Conference on Computer Communications, pp. 1\u20139. IEEE, https:\/\/doi.org\/10.1109\/INFOCOM.2017.8056946","DOI":"10.1109\/INFOCOM.2017.8056946"},{"key":"6457_CR17","doi-asserted-by":"publisher","unstructured":"Wang S, Li D, Geng J (2020) Geryon: accelerating distributed CNN training by network-level flow scheduling. In: IEEE INFOCOM 2020 - IEEE Conference on Computer Communications, pp. 1678\u20131687. https:\/\/doi.org\/10.1109\/INFOCOM41043.2020.9155282","DOI":"10.1109\/INFOCOM41043.2020.9155282"},{"key":"6457_CR18","doi-asserted-by":"publisher","unstructured":"Goyal P, Shah P, Zhao K, Nikolaidis G, Alizadeh M, Anderson TE (2022) Backpressure flow control. In: 19th USENIX Symposium on Networked Systems Design and Implementation (NSDI 22), pp. 779\u2013805. https:\/\/doi.org\/10.1145\/3375235.3375239","DOI":"10.1145\/3375235.3375239"},{"key":"6457_CR19","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":"6457_CR20","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"},{"issue":"1","key":"6457_CR21","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1109\/TNET.2022.3187821","volume":"31","author":"S Luo","year":"2023","unstructured":"Luo S, Fan P, Xing H, Yu H (2023) Meeting coflow deadlines in data center networks with policy-based selective completion. IEEE\/ACM Trans Netw 31(1):178\u2013191. https:\/\/doi.org\/10.1109\/TNET.2022.3187821","journal-title":"IEEE\/ACM Trans Netw"},{"issue":"12","key":"6457_CR22","doi-asserted-by":"publisher","first-page":"1755","DOI":"10.1109\/TC.2019.2931716","volume":"68","author":"Q Zhou","year":"2019","unstructured":"Zhou Q, Wang K, Li P, Zeng D, Guo S, Ye B, Guo M (2019) Fast coflow scheduling via traffic compression and stage pipelining in datacenter. Networks 68(12):1755\u20131771. https:\/\/doi.org\/10.1109\/TC.2019.2931716","journal-title":"Networks"},{"issue":"4","key":"6457_CR23","doi-asserted-by":"publisher","first-page":"1494","DOI":"10.1109\/TNET.2021.3138923","volume":"30","author":"A Jajoo","year":"2022","unstructured":"Jajoo A, Hu YC, Lin X (2022) A case for sampling-based learning techniques in coflow scheduling. IEEE\/ACM Trans Netw 30(4):1494\u20131508. https:\/\/doi.org\/10.1109\/TNET.2021.3138923","journal-title":"IEEE\/ACM Trans Netw"},{"key":"6457_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. Futur Gener Comput Syst 97:805\u2013813. https:\/\/doi.org\/10.1016\/j.future.2019.03.035","journal-title":"Futur Gener Comput Syst"},{"key":"6457_CR25","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, pp. 1\u201312. ACM Press, Philadelphia, USA. https:\/\/doi.org\/10.1145\/1921168.1921188","DOI":"10.1145\/1921168.1921188"},{"key":"6457_CR26","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. 41, pp. 242\u2013253. ACM Press, Toronto, Ontario, Canada. https:\/\/doi.org\/10.1145\/2018436.2018465","DOI":"10.1145\/2018436.2018465"},{"issue":"4","key":"6457_CR27","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 Comput Commun Rev 42(4):187\u2013198. https:\/\/doi.org\/10.1145\/2377677.2377717","journal-title":"ACM SIGCOMM Comput Commun Rev"},{"key":"6457_CR28","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), pp. 297\u2013311. USENIX, Lombard, IL"},{"key":"6457_CR29","doi-asserted-by":"publisher","unstructured":"Wang W, Jin A-L (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"},{"issue":"7","key":"6457_CR30","doi-asserted-by":"publisher","first-page":"1565","DOI":"10.1109\/TPDS.2018.2889685","volume":"30","author":"T Zhang","year":"2019","unstructured":"Zhang T, Shu R, Shan Z, Ren F (2019) Distributed bottleneck-aware coflow scheduling in data centers. IEEE Trans Parallel Distrib Syst 30(7):1565\u20131579. https:\/\/doi.org\/10.1109\/TPDS.2018.2889685","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"6457_CR31","doi-asserted-by":"publisher","unstructured":"Ben\u00a0Yedder H, Ding Q, Zakia U, Li Z, Haeri S, Trajkovic L (2017) Comparison of virtualization algorithms and topologies for data center networks. In: 2017 26th International Conference on Computer Communication and Networks (ICCCN), pp. 1\u20136. https:\/\/doi.org\/10.1109\/ICCCN.2017.8038524","DOI":"10.1109\/ICCCN.2017.8038524"},{"key":"6457_CR32","doi-asserted-by":"publisher","unstructured":"Namyar P, Supittayapornpong S, Zhang M, Yu M, Govindan R (2021) A throughput-centric view of the performance of datacenter topologies. In: Proceedings of the 2021 ACM SIGCOMM 2021 Conference, pp. 349\u2013369. ACM, https:\/\/doi.org\/10.1145\/3452296.3472913","DOI":"10.1145\/3452296.3472913"},{"key":"6457_CR33","unstructured":"Chowdhury NMMK, Phd. (2015) University of California, Berkeley"},{"key":"6457_CR34","unstructured":"Inotify(7) - Linux Manual Page"},{"key":"6457_CR35","unstructured":"Coflow Benchmark Based on Facebook Traces (2023)"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-024-06457-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-024-06457-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-024-06457-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,4]],"date-time":"2024-10-04T09:15:36Z","timestamp":1728033336000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-024-06457-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,30]]},"references-count":35,"journal-issue":{"issue":"19","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["6457"],"URL":"https:\/\/doi.org\/10.1007\/s11227-024-06457-3","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"type":"print","value":"0920-8542"},{"type":"electronic","value":"1573-0484"}],"subject":[],"published":{"date-parts":[[2024,8,30]]},"assertion":[{"value":"13 August 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 August 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}