{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T11:53:02Z","timestamp":1753357982585},"reference-count":33,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:00:00Z","timestamp":1556668800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:00:00Z","timestamp":1556668800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:00:00Z","timestamp":1556668800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,5]]},"DOI":"10.1109\/icc.2019.8762027","type":"proceedings-article","created":{"date-parts":[[2019,7,16]],"date-time":"2019-07-16T00:16:31Z","timestamp":1563236191000},"page":"1-6","source":"Crossref","is-referenced-by-count":4,"title":["Creek: Inter Many-to-Many Coflows Scheduling for Datacenter Networks"],"prefix":"10.1109","author":[{"given":"Hengky","family":"Susanto","sequence":"first","affiliation":[]},{"given":"Ahmed M.","family":"Abdelmoniem","sequence":"additional","affiliation":[]},{"given":"Hao","family":"Jin","sequence":"additional","affiliation":[]},{"given":"Brahim","family":"Bensaou","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref33","DOI":"10.1109\/TPDS.2019.2893239"},{"year":"2001","author":"c","article-title":"Introduction to Algorithm","key":"ref32"},{"doi-asserted-by":"publisher","key":"ref31","DOI":"10.1145\/2785956.2787472"},{"doi-asserted-by":"publisher","key":"ref30","DOI":"10.1145\/1402958.1402967"},{"key":"ref10","doi-asserted-by":"crossref","DOI":"10.1145\/2534169.2486031","article-title":"pFabric:Minimal Near-Optimal Datacenter Transport","author":"alizadeh","year":"2013","journal-title":"ACM SIGCOMM"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1145\/1851182.1851192"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1145\/2934872.2934880"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1145\/2619239.2626316"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1145\/1592568.1592576"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1145\/2390231.2390237"},{"key":"ref16","doi-asserted-by":"crossref","DOI":"10.1145\/2740070.2626305","article-title":"Friends, not Foes – Syntehsizing Exiting Transport Strategies for Data Center Networks","author":"munir","year":"2014","journal-title":"ACM SIGCOMM"},{"doi-asserted-by":"publisher","key":"ref17","DOI":"10.1145\/1879141.1879175"},{"key":"ref18","article-title":"MapReduce: Simplifed Data Processing on Large Clusters","author":"dean","year":"2004","journal-title":"USENIX OSDI"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.1109\/INFOCOM.2018.8486219"},{"key":"ref28","article-title":"TAO: Facebook’s Distributed Data Store for the Social Graph","author":"bronson","year":"2013","journal-title":"USENIX ATC"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1145\/2619239.2626315"},{"doi-asserted-by":"publisher","key":"ref27","DOI":"10.1109\/ICNP.2016.7784423"},{"key":"ref3","doi-asserted-by":"crossref","DOI":"10.1145\/2740070.2626322","article-title":"Decentralized Task-Aware Schduling for Data Center Networks","author":"dogar","year":"2014","journal-title":"ACM SIGCOMM"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1145\/2018436.2018448"},{"year":"2013","author":"kurose","article-title":"Computer Networking, a Top Down Approach 6th addition","key":"ref29"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1145\/2785956.2787480"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1109\/INFOCOM.2015.7218460"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1109\/INFOCOM.2015.7218408"},{"key":"ref2","article-title":"Sincronia: Near-Optimal Netwok Design for Coflows","author":"argawal","year":"2018","journal-title":"ACM SIGCOM"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1145\/2755573.2755592"},{"year":"0","key":"ref1"},{"key":"ref20","article-title":"Resilent Distributed Datasets: A Fault-Tolerant Abstraction for in-Memory Custer Computing","author":"zhaharia","year":"2008","journal-title":"USENIX NSDI"},{"doi-asserted-by":"publisher","key":"ref22","DOI":"10.14778\/1454159.1454166"},{"doi-asserted-by":"publisher","key":"ref21","DOI":"10.1109\/ICDCS.2018.00013"},{"key":"ref24","article-title":"Distrubted GraphLab: A Framework for Machine Learning and Data Mining in the Cloud","author":"low","year":"2012","journal-title":"PVLDB"},{"key":"ref23","article-title":"Pregel: A System for Large-Scale Graph Processing","author":"malewicz","year":"2008","journal-title":"ACM SIGMOD"},{"key":"ref26","article-title":"Online Flow Size prediction fo Improved Network Routing","author":"poupart","year":"2016","journal-title":"IEEE ICNP"},{"key":"ref25","article-title":"Information-Agnostic Flow Scheduling for Comodity Data Centers","author":"bai","year":"2015","journal-title":"USENIX NSDI"}],"event":{"name":"ICC 2019 - 2019 IEEE International Conference on Communications (ICC)","start":{"date-parts":[[2019,5,20]]},"location":"Shanghai, China","end":{"date-parts":[[2019,5,24]]}},"container-title":["ICC 2019 - 2019 IEEE International Conference on Communications (ICC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8753818\/8761046\/08762027.pdf?arnumber=8762027","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,15]],"date-time":"2022-07-15T03:16:49Z","timestamp":1657855009000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8762027\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5]]},"references-count":33,"URL":"https:\/\/doi.org\/10.1109\/icc.2019.8762027","relation":{},"subject":[],"published":{"date-parts":[[2019,5]]}}}