{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,11]],"date-time":"2025-03-11T13:20:07Z","timestamp":1741699207671,"version":"3.38.0"},"reference-count":30,"publisher":"SAGE Publications","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["JHS"],"published-print":{"date-parts":[[2018,1,15]]},"DOI":"10.3233\/jhs-170581","type":"journal-article","created":{"date-parts":[[2018,1,16]],"date-time":"2018-01-16T17:46:11Z","timestamp":1516124771000},"page":"63-78","source":"Crossref","is-referenced-by-count":0,"title":["Flow scheduling strategies for minimizing flow completion times in data center networks"],"prefix":"10.1177","volume":"24","author":[{"given":"Chao","family":"Hu","sequence":"first","affiliation":[{"name":"College of Command and Control Engineering, Army Engineering University of PLA, China"},{"name":"Key Laboratory of Computer Network and Information Integration (Southeast University), Ministry of Education, China"}]},{"given":"Bo","family":"Liu","sequence":"additional","affiliation":[{"name":"College of Command and Control Engineering, Army Engineering University of PLA, China"}]},{"given":"Changyou","family":"Xing","sequence":"additional","affiliation":[{"name":"College of Command and Control Engineering, Army Engineering University of PLA, China"}]},{"given":"Ke","family":"Ding","sequence":"additional","affiliation":[{"name":"College of Command and Control Engineering, Army Engineering University of PLA, China"}]},{"given":"Bo","family":"Xu","sequence":"additional","affiliation":[{"name":"College of Command and Control Engineering, Army Engineering University of PLA, China"}]},{"given":"Xianglin","family":"Wei","sequence":"additional","affiliation":[{"name":"Nanjing Telecommunication Technology Research Institute, Nanjing 210007, China"}]},{"given":"Xiaoming","family":"Zhang","sequence":"additional","affiliation":[{"name":"National Computer Network Emergency Response Technical Team\/Coordination Center of China, China"}]}],"member":"179","reference":[{"key":"10.3233\/JHS-170581_ref1","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1145\/2184319.2184335","article-title":"A guided tour of data-center networking","volume":"6","author":"Abts","year":"2012","journal-title":"Commun. ACM"},{"key":"10.3233\/JHS-170581_ref2","unstructured":"M.\u00a0Al-Fares, S.\u00a0Radhakrishnan, B.\u00a0Raghavan, N.\u00a0Huang and A.\u00a0Vahdat, Hedera: Dynamic flow scheduling for data center networks, in: USENIX NSDI, San Jose, California, USA, 2010."},{"key":"10.3233\/JHS-170581_ref3","doi-asserted-by":"crossref","unstructured":"M.\u00a0Alizadeh, A.\u00a0Greenberg, D.A.\u00a0Maltz, J.\u00a0Padhye, P.\u00a0Patel, B.\u00a0Prabhakar et al., Data center TCP (DCTCP), in: ACM SIGCOMM, New Delhi, India, 2010, pp.\u00a063\u201374.","DOI":"10.1145\/1851275.1851192"},{"key":"10.3233\/JHS-170581_ref4","unstructured":"M.\u00a0Alizadeh, A.\u00a0Kabbani, T.\u00a0Edsall, B.\u00a0Prabhakar, A.\u00a0Vahdat and M.\u00a0Yasuda, Less is more: Trading a little bandwidth for ultra-low latency in the data center, in: USENIX NSDI, San Jose, CA, USA, 2012, pp.\u00a019\u201330."},{"key":"10.3233\/JHS-170581_ref5","doi-asserted-by":"crossref","unstructured":"M.\u00a0Alizadeh, S.\u00a0Yang, M.\u00a0Sharif, S.\u00a0Katti, N.\u00a0Mckeown, B.\u00a0Prabhakar and S.\u00a0Shenker, pFabric: Minimal near-optimal datacenter transport, in: ACM SIGCOMM, Hong Kong, China, 2013, pp.\u00a0435\u2013446.","DOI":"10.1145\/2534169.2486031"},{"key":"10.3233\/JHS-170581_ref6","unstructured":"W.\u00a0Bai, L.\u00a0Chen, K.\u00a0Chen, D.\u00a0Han, C.\u00a0Tian and H.\u00a0Wang, Information-agnostic flow scheduling for commodity data centers, in: USENIX NSDI, Oakland, CA, USA, 2015, pp.\u00a0455\u2013468."},{"key":"10.3233\/JHS-170581_ref7","doi-asserted-by":"crossref","unstructured":"N.\u00a0Bansal and M.\u00a0Harchol-Balter, Analysis of srpt scheduling: Investigating unfairness, in: ACM SIGMETRICS, Cambridge, Massachusetts, USA, 2001, pp.\u00a0279\u2013290.","DOI":"10.1145\/384268.378792"},{"key":"10.3233\/JHS-170581_ref8","doi-asserted-by":"crossref","unstructured":"T.\u00a0Benson, A.\u00a0Akella and D.\u00a0Maltz, Network traffic characteristics of data centers in the wild, in: IMC, Melbourne, Australia, 2010, pp.\u00a0267\u2013280.","DOI":"10.1145\/1879141.1879175"},{"key":"10.3233\/JHS-170581_ref9","doi-asserted-by":"crossref","unstructured":"M.\u00a0Chowdhury and I.\u00a0Stoica, Efficient coflow scheduling without prior knowledge, in: ACM SIGCOMM, London, United Kingdom, 2015, pp.\u00a0393\u2013406.","DOI":"10.1145\/2829988.2787480"},{"key":"10.3233\/JHS-170581_ref10","unstructured":"R.O.\u00a0Duda and P.E.\u00a0Hart, Pattern Classification and Scene Analysis, John Wiley & Sons, 1973."},{"key":"10.3233\/JHS-170581_ref11","doi-asserted-by":"crossref","unstructured":"N.\u00a0Dukkipati, M.\u00a0Kobayashi, R.\u00a0Zhang-Shen and N.\u00a0McKeown, Processor sharing flows in the Internet, in: IWQoS, Passau, Germany, 2005, pp.\u00a0267\u2013281.","DOI":"10.1007\/11499169_22"},{"key":"10.3233\/JHS-170581_ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1592568.1592576"},{"key":"10.3233\/JHS-170581_ref13","doi-asserted-by":"crossref","unstructured":"D.\u00a0Gross, J.F.\u00a0Shortle, J.M.\u00a0Thompson and C.M.\u00a0Harris, Fundamentals of Queueing Theory, Wiley-Interscience, 2008.","DOI":"10.1002\/9781118625651"},{"key":"10.3233\/JHS-170581_ref14","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1145\/1400097.1400105","article-title":"Cubic: A new TCP-friendly high-speed TCP variant","volume":"5","author":"Ha","year":"2008","journal-title":"ACM SIGOPS Operating Systems Review\u00a0\u2013 Research and developments in the Linux kernel"},{"key":"10.3233\/JHS-170581_ref15","doi-asserted-by":"crossref","unstructured":"N.\u00a0Handigol, B.\u00a0Heller, V.\u00a0Jeyakumar, B.\u00a0Lantz and N.\u00a0McKeown, Reproducible network experiments using container-based emulation, in: ACM CoNEXT, Nice, France, 2012, pp.\u00a0253\u2013264.","DOI":"10.1145\/2413176.2413206"},{"key":"10.3233\/JHS-170581_ref17","doi-asserted-by":"crossref","unstructured":"C.-Y.\u00a0Hong, M.\u00a0Caesar and P.B.\u00a0Godfrey, Finishing flows quickly with preemptive scheduling, in: ACM SIGCOMM, Helsinki, Finland, 2012, pp.\u00a0127\u2013138.","DOI":"10.1145\/2377677.2377710"},{"key":"10.3233\/JHS-170581_ref18","doi-asserted-by":"crossref","unstructured":"C.\u00a0Hu, B.\u00a0Liu, C.\u00a0Xing, Z.\u00a0Yue, L.\u00a0Song and M.\u00a0Chen, Queueing model based analysis on flow scheduling in information-agnostic datacenter networks, in: IEEE ICC, Kuala Lumpur, Malaysia, 2016.","DOI":"10.1109\/ICC.2016.7511253"},{"key":"10.3233\/JHS-170581_ref20","doi-asserted-by":"publisher","first-page":"1246","DOI":"10.1109\/TNET.2006.886335","article-title":"FAST TCP: Motivation, architecture, algorithms, performance","volume":"6","author":"Jin","year":"2006","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"10.3233\/JHS-170581_ref21","doi-asserted-by":"publisher","DOI":"10.1145\/1644893.1644918"},{"key":"10.3233\/JHS-170581_ref22","unstructured":"C.\u00a0Lu, Queueing Theory, Beijing University of Post and Telecommunication Press, 1993."},{"key":"10.3233\/JHS-170581_ref23","doi-asserted-by":"crossref","unstructured":"A.\u00a0Munir, I.A.\u00a0Qazi, Z.A.\u00a0Uzmi, A.\u00a0Mushtaq, S.N.\u00a0Ismail, M.S.\u00a0Iqbal and B.\u00a0Khan, Minimizing flow completion times in data centers, in: IEEE INFOCOM, Turin, Italy, 2013.","DOI":"10.1109\/INFCOM.2013.6567018"},{"key":"10.3233\/JHS-170581_ref24","doi-asserted-by":"crossref","unstructured":"I.A.\u00a0Rai, G.\u00a0Urvoy-Keller and E.W.\u00a0Biersack, Analysis of las scheduling for job size distributions with high variance, in: ACM SIGMETRICS, San Diego, CA, USA, 2003, pp.\u00a0218\u2013228.","DOI":"10.1145\/885651.781055"},{"key":"10.3233\/JHS-170581_ref25","doi-asserted-by":"crossref","unstructured":"C.\u00a0Raiciu, S.\u00a0Barre, C.\u00a0Pluntke, A.\u00a0Greenhalgh, D.\u00a0Wischik and M.\u00a0Handley, Improving datacenter performance and robustness with multipath tcp, in: ACM SIGCOMM, Toronto, Ontario, Canada, 2011, pp.\u00a0266\u2013277.","DOI":"10.1145\/2043164.2018467"},{"key":"10.3233\/JHS-170581_ref27","doi-asserted-by":"crossref","unstructured":"B.\u00a0Vamanan, J.\u00a0Hasan and T.\u00a0Vijaykumar, Deadline-aware datacenter TCP (D2TCP), in: ACM SIGCOMM, Helsinki, Finland, 2012, pp.\u00a0115\u2013126.","DOI":"10.1145\/2377677.2377709"},{"key":"10.3233\/JHS-170581_ref28","doi-asserted-by":"crossref","unstructured":"C.\u00a0Wilson, H.\u00a0Ballani, T.\u00a0Karagiannis and A.\u00a0Rowstron, Better never than late: Meeting deadlines in datacenter networks, in: ACM SIGCOMM, Toronto, Ontario, Canada, 2011, pp.\u00a050\u201361.","DOI":"10.1145\/2043164.2018443"},{"key":"10.3233\/JHS-170581_ref29","doi-asserted-by":"crossref","unstructured":"H.\u00a0Wu, Z.\u00a0Feng, C.\u00a0Guo and Y.\u00a0Zhang, Ictcp: Incast congestion control for tcp in data center networks, in: IEEE\/ACM Transactions on Networking, Vol.\u00a02, 2013, pp.\u00a0345\u2013358.","DOI":"10.1109\/TNET.2012.2197411"},{"key":"10.3233\/JHS-170581_ref30","doi-asserted-by":"crossref","unstructured":"B.\u00a0Xu, C.\u00a0Hu, B.\u00a0Liu, C.\u00a0Xing and D.\u00a0Li, Queue demotion threshold configuration for minimizing flow completion in information-agnostic datacenters, in: IEEE ICC, Paris, France, 2017.","DOI":"10.1109\/ICC.2017.7996827"},{"key":"10.3233\/JHS-170581_ref31","doi-asserted-by":"crossref","unstructured":"H.\u00a0Xu and B.\u00a0Li, RepFlow: Minimizing flow completion times with replicated flows in data centers, in: IEEE INFOCOM, Toronto, Canada, 2014.","DOI":"10.1109\/INFOCOM.2014.6848094"},{"key":"10.3233\/JHS-170581_ref32","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1109\/TNET.2004.826280","article-title":"Enhancing both network and user performance for networks supporting best effort traffic","volume":"2","author":"Yang","year":"2004","journal-title":"IEEE\/ACM Trans. on Networking"},{"key":"10.3233\/JHS-170581_ref33","doi-asserted-by":"crossref","unstructured":"D.\u00a0Zats, T.\u00a0Das, P.\u00a0Mohan, D.\u00a0Borthakur and R.\u00a0Katz, DeTail: Reducing the flow completion time tail in datacenter networks, in: ACM SIGCOMM, Helsinki, Finland, 2012, pp.\u00a0139\u2013150.","DOI":"10.1145\/2377677.2377711"}],"container-title":["Journal of High Speed Networks"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/JHS-170581","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,10]],"date-time":"2025-03-10T15:53:36Z","timestamp":1741622016000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/JHS-170581"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1,15]]},"references-count":30,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.3233\/jhs-170581","relation":{},"ISSN":["1875-8940","0926-6801"],"issn-type":[{"type":"electronic","value":"1875-8940"},{"type":"print","value":"0926-6801"}],"subject":[],"published":{"date-parts":[[2018,1,15]]}}}